SelectionDAGISel.cpp revision 3e697cfa979538c77459a3e4237e9bc1ac638761
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" 16381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng#include "SimpleBBISel.h" 175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 18c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 2978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 305a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 315eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 38381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 39eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 416f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 47124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 48a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 49db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 50db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 51db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 527e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 55ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 5670587ea813986bb0dbef71610091d496e28c22a6Chris LattnerEnableValueProp("enable-value-prop", cl::Hidden); 5770587ea813986bb0dbef71610091d496e28c22a6Chris Lattnerstatic cl::opt<bool> 58f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan SandsEnableLegalizeTypes("enable-legalize-types", cl::Hidden); 5978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohmanstatic cl::opt<bool> 6078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan GohmanEnableFastISel("fast-isel", cl::Hidden, 6178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman cl::desc("Enable the experimental \"fast\" instruction selector")); 623e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohmanstatic cl::opt<bool> 633e697cfa979538c77459a3e4237e9bc1ac638761Dan GohmanDisableFastISelAbort("fast-isel-no-abort", cl::Hidden, 643e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman cl::desc("Use the SelectionDAGISel when \"fast\" instruction " 653e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman "selection fails")); 66ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 67da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 687944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 74462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 81462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 82462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 83a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 84a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 85a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 86a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 87a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 883e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 893e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 905bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 917944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 92462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 93462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 94462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 95462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 96462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 977944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 987944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 99eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 100eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 101eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 102eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 103eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 104eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 105eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 106eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 107eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 108eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 109eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 110eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 111844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 112844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 113844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 114844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 115844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 116844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 11713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 118844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 119844731a7f1909f55935e3514c9e713a62d67662eDan GohmandefaultListDAGScheduler("default", " Best scheduler for the target", 120844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1214ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1225c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 123bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 1241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence 1251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// insertvalue or extractvalue indices that identify a member, return 1261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// the linearized index of the start of the member. 1271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanstatic unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty, 1291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *Indices, 1301d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *IndicesEnd, 1311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned CurIndex = 0) { 1321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Base case: We're done. 1338f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && Indices == IndicesEnd) 1341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman return CurIndex; 1351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 1361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given a struct type, recursively traverse the elements. 1371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1388f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1398f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman EI = EB, 1401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) { 1428f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == unsigned(EI - EB)) 1438f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex); 1448f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex); 1451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given an array type, recursively traverse the elements. 1481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 1491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *EltTy = ATy->getElementType(); 1501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) { 1518f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == i) 1528f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex); 1538f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex); 1541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // We haven't found the type we're looking for, so keep searching. 1578f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return CurIndex + 1; 1581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman} 1591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 160f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// ComputeValueVTs - Given an LLVM IR type, compute a sequence of 16183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands/// MVTs that represent all the individual underlying 162f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// non-aggregate types that comprise it. 1631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// If Offsets is non-null, it points to a vector to be filled in 1651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// with the in-memory offsets of each of the individual values. 1661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 167f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnerstatic void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty, 1681d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<MVT> &ValueVTs, 1691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<uint64_t> *Offsets = 0, 1701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t StartingOffset = 0) { 171f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given a struct type, recursively traverse the elements. 172f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1731d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy); 1741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1751d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI = EB, 1761d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1771d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) 1781d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, *EI, ValueVTs, Offsets, 1791d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + SL->getElementOffset(EI - EB)); 180f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 181f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner } 182f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given an array type, recursively traverse the elements. 183f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 184f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner const Type *EltTy = ATy->getElementType(); 1851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy); 186f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) 1871d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets, 1881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + i * EltSize); 189f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 19023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 19183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands // Base case: we can get an MVT for this LLVM IR type. 192f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ValueVTs.push_back(TLI.getValueType(Ty)); 1931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (Offsets) 1941d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Offsets->push_back(StartingOffset); 195f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner} 19623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 197f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnernamespace { 1980fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegsForValue - This struct represents the registers (physical or virtual) 1990fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// that a particular set of values is assigned, and the type information about 2000fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// the value. The most common situation is to represent one value at a time, 2010fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// but struct or array values are handled element-wise as multiple values. 2020fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// The splitting of aggregates is performed recursively, so that we never 2030fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have aggregate-typed registers. The values at this point do not necessarily 2040fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have legal types, so each value may require one or more registers of some 2050fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// legal type. 2060fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2079525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 20823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 2090fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 21023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 21123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 2120fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs - The value types of the values, which may not be legal, and 2130fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// may need be promoted or synthesized from one or more registers. 2140fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 21583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 216864635ad7b3046d3042311423071152c613961deChris Lattner 2170fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegVTs - The value types of the registers. This is the same size as 2180fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs and it records, for each value, what the type of the assigned 2190fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// register or registers are. (Individual values are never synthesized 2200fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// from more than one type of register.) 2210fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2220fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// With virtual registers, the contents of RegVTs is redundant with TLI's 2230fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// getRegisterType member function, however when with physical registers 2240fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// it is necessary to have a separate record of the types. 225864635ad7b3046d3042311423071152c613961deChris Lattner /// 22683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RegVTs; 227864635ad7b3046d3042311423071152c613961deChris Lattner 2280fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Regs - This list holds the registers assigned to the values. 2290fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Each legal or promoted value requires one register, and each 2300fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// expanded value requires multiple registers. 2310fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2320fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<unsigned, 4> Regs; 233864635ad7b3046d3042311423071152c613961deChris Lattner 23423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 235864635ad7b3046d3042311423071152c613961deChris Lattner 23623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 237b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 23883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT regvt, MVT valuevt) 2390fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 24023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 241b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 24283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> ®vts, 24383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> &valuevts) 2440fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 24523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 24623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 24723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 24823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 249b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 25083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 25123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 25283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI->getRegisterType(ValueVT); 25323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 25423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 25523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 25623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 25723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 258864635ad7b3046d3042311423071152c613961deChris Lattner } 259864635ad7b3046d3042311423071152c613961deChris Lattner 26041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner /// append - Add the specified values to this one. 26141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner void append(const RegsForValue &RHS) { 26241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner TLI = RHS.TLI; 26341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 26441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 26541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 26641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } 26741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 26841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 269864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 27023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 271864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 272b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 273475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getCopyFromRegs(SelectionDAG &DAG, 274475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 275c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 276c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 277c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 278c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 279b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 280475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void getCopyToRegs(SDValue Val, SelectionDAG &DAG, 281475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 282c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 283c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 284c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 285c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 286c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 287475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const; 288864635ad7b3046d3042311423071152c613961deChris Lattner }; 289864635ad7b3046d3042311423071152c613961deChris Lattner} 2904ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 2939373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 2949373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 2959373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 2969373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2974576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 2984576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast) { 2999373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 3009373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3019373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 3024576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createTDListDAGScheduler(IS, DAG, BB, Fast); 3039373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 3049373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 3059373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 3064576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createBURRListDAGScheduler(IS, DAG, BB, Fast); 3079373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 3089373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 3099373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3109373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3119373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 3121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 3131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 314f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 315f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 3161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 3171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 3181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 31984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 3201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 3299f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 3321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 3331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 3351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 336f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 337f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 338f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 339f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 340f40708223e409a152834b1553c6883ff2035b957Duncan Sands 34183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned MakeReg(MVT VT) { 34284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 344571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 345571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 346571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 347571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 348571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 349571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 350edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3513c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 3523c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 358ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 359ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner struct LiveOutInfo { 360ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits; 361ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne, KnownZero; 362ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LiveOutInfo() : NumSignBits(0) {} 363ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner }; 364ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 365ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// LiveOutRegInfo - Information about live out vregs, indexed by their 366ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// register number offset by 'FirstVirtualRegister'. 367ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner std::vector<LiveOutInfo> LiveOutRegInfo; 3681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 3691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 371cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 372cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 373cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 374f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 3758806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 3768806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 377f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 378f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 379f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 382ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 3831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 3841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 3851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 3861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 388571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 3901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 3921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 394bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 397bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 398bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 399bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 401bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 402bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 403bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 404bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 406edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 40784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 409bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 410bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 41116ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 41216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 413bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 414bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 4151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 416bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 417bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 418bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 4192aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 4201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 422b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 424514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 425ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 426d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 427ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 428a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 429b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 430d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 4311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 4326266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4352aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 4362aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 4452aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 4460e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB); 4471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 4480e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MF.push_back(MBB); 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 4521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 4538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 4548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 4558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 4578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 4586f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman 4596f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 4606f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 4616f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 4626f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 4636f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4646f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 4656f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 4666f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 4676f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHIReg += NumRegisters; 4686f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 4698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4733c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 4743c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 4753c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 47610a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 47710a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 47810a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 47910a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 4803c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 48183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 482b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 48395b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 48423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 485b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 48683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 48783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI.getRegisterType(ValueVT); 4888c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 489b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 49023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 49123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 49223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 49323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 49423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 49523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 4963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 4991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 5001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 507475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<const Value*, SDValue> NodeMap; 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 509d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 510d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 511d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 512d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 513475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> PendingLoads; 514d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 51586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 51686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 51786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 51886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 51986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 520475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> PendingExports; 52186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 5225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 5235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 5245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 5255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 5265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 5275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 5285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 5305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 5315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 5325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 5335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 5345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 5355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 5365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 5375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 5385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 5404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 5414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 5424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 5434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 5454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 5464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 5494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 5505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 5515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 552f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 554f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 555f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 556f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 559f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 560f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 561f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 562f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 563f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 564f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 565f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 566f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 567f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 568f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 569b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 570b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 5715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 5735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 574f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 5754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 5765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 5775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 5785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 5795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 580f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 581f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 5825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 5844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 5854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 5864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 5874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 590f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 597a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 5985f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 600f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 601f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 602f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 6033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 6043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 6053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 6064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 607f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 611ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 6125eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen /// GFI - Garbage collection metadata for the function. 6135eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GCFunctionInfo *GFI; 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 6165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 617ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 6185eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GCFunctionInfo *gfi) 6195f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 6205eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen FuncInfo(funcinfo), GFI(gfi) { 6211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 62386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 62486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 62586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 62686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 627a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 628475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getRoot() { 629d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 630d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 631edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 632d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 633475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = PendingLoads[0]; 634d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 635d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 636d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 637d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 638d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 639d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 640475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 641bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 642d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 643d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 644d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 645a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 646a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 64786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 64886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 64986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 65086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 651475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getControlRoot() { 652475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getRoot(); 65386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 65486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 65586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 65686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 65786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 65886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 65986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 66086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 66186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 66286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 66386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 66486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 66586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 66686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 66786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 66886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 66986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 67086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 67186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 67286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 67386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 67486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 67586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 67686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 67786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 67886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 679571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 6801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 6811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 6831e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 6841e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 6851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 6861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 6871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 6891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 6901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 6911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 6921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 6961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 697475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getValue(const Value *V); 6981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 699475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void setValue(const Value *V, SDValue NewN) { 700475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 7011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 7020da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 7031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7044e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 7055c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 706e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 707e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 708f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 709571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 710571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 711571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 7128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 713571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 714475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void LowerCallTo(CallSite CS, SDValue Callee, bool IsTailCall, 715070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 716dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 7171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 7181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 7191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 720f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 7211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 7221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 723b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 724dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 725b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 726b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 727b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 728dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 729b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 730b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 731b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 732dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 734b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 7364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 7374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 7384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 7394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 740f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 7414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 7424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 7434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 7444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 74537efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 7463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 7473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 748f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 750b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 751b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 7521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 754e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 7555fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 7567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 7581628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 76001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 761b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 7621628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 7637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 7651628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 7671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7687f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 7697f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 7707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 7717f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 7727f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 7737f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 7747f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 7757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 7767f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 77724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 7783822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 7793822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 78045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 78145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 782b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVICmp(User &I); 783b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVFCmp(User &I); 7843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 7853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 7863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 7873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 7883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 7893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 7903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 7913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 7923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 7933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 7943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 7953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 7963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 7971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7982bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 7992bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 8003e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 801c7029805ef35ce9805931067b841e6af11db382eChris Lattner 8021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitExtractValue(ExtractValueInst &I); 8031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitInsertValue(InsertValueInst &I); 804041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 8051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 8061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 8071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 8091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 8101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 8111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 8121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 8131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 8141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 815fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 816c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 8170eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 8181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 8201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 8211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 8221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 8231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 8251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 8261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 8291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 8301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 83263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 83363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangprivate: 83463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op); 83563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 8361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 8371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 8381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 840b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 841b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 842b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 843b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 8444468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 845475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic SDValue getCopyFromParts(SelectionDAG &DAG, 846475871a144eb604ddaf37503397ba0941442e5fbDan Gohman const SDValue *Parts, 8476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 84883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 84983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT, 8504468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 852014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 853475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = Parts[0]; 854014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 856014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 85783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 85883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 85983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned ValueBits = ValueVT.getSizeInBits(); 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 861014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 864014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 86583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RoundVT = RoundBits == ValueBits ? 86683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT : MVT::getIntegerVT(RoundBits); 867475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Lo, Hi; 868014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 869014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 87083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT HalfVT = MVT::getIntegerVT(RoundBits/2); 871014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 872014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 873014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 8746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 875014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 876014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 8776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 878014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 88583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OddVT = MVT::getIntegerVT(OddParts * PartBits); 886014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 889014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 89283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits); 893014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 89583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands DAG.getConstant(Lo.getValueType().getSizeInBits(), 896014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 897014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 899014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 90283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 903014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 905014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 906014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 90835213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 911014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 912014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 914475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 916014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 918014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 925014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 926014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 927014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 928014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 930014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 933014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 93483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands Val = DAG.getNode(IntermediateVT.isVector() ? 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 9376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 938014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 940014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 941014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 9426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 943014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 944014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 945014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 94683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 94783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.isVector() && "Unknown vector conversion!"); 948014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 9496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 95183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (ValueVT.isVector()) { 95283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 95383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 954014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 955014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 956014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 95883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && 95983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.isInteger()) { 9608e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(PartVT)) { 961014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 962014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 963014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 964014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 965014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 966014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 967014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 968014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 969014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 970014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 972014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 97383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 9748e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(Val.getValueType())) 9754468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 976d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 9774468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 978d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 979d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 980014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 98183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 982014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 983014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 984014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 985475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 9866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 9876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 988b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 989b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 990b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 9916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 992475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val, 993475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Parts, 9946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 99583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 996b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 99725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 99883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PtrVT = TLI.getPointerTy(); 99983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = Val.getValueType(); 100083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 1001014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 1002014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1003014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 1004014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1005014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 100683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 1007014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 1008014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 1009014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 1010014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1011014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1012014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 101383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (NumParts * PartBits > ValueVT.getSizeInBits()) { 1014014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 101583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 1016014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 1017014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 101883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartVT.isInteger() && ValueVT.isInteger()) { 101983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1020014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 1021014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1022014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1023014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 102483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartBits == ValueVT.getSizeInBits()) { 1025014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 1026014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 1027014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 102883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 1029014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 103083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && ValueVT.isInteger()) { 103183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1032014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1033014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1034014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1035014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1036014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1038014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 1039014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 104083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(NumParts * PartBits == ValueVT.getSizeInBits() && 1041014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 1042014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1043014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 1044014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 1045014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 10466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1049014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 1050014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 1051014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 105283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(PartVT.isInteger() && ValueVT.isInteger() && 1053014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 1054014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 1055014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 1056014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 1057475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 1058014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 1059014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1060014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 1061014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1062014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 1063014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 1064014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 106583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1066014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1067014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1068014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1069014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 1070014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 107125eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 107283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT::getIntegerVT(ValueVT.getSizeInBits()), 107325eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 1074014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 1075014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 1076014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 107783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::getIntegerVT (ThisBits); 1078475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part0 = Parts[i]; 1079475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part1 = Parts[i+StepSize/2]; 108025eb043759c23b61769108f78382eb9701c41db2Duncan Sands 108125eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 108225eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 108325eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 108425eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 108525eb043759c23b61769108f78382eb9701c41db2Duncan Sands 108625eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 108725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 108825eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 108925eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 1090014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1091014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1092014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1093014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1094014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 1095014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1096014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1097014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1098014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1099014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 1100014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 11016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 110283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 11036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1104014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 110583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 110683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1107a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1108a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1109a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 11106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1112014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 11136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 11146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 11156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 111883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 11196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 11206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 11216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 11226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 11236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 112483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned NumElements = ValueVT.getVectorNumElements(); 11256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 112735213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 11286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 11296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 1131475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 11326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 113383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (IntermediateVT.isVector()) 11346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 11356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 11366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 113725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 11386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 11396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 11406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 114125ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 11426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 11446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 11456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 11466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 11476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1148532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 11496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 11506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 11516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 11526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 11536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 11546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 11556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1156532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 11576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 11596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1161475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue SelectionDAGLowering::getValue(const Value *V) { 1162475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 1163199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1164199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1165199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 116683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(V->getType(), true); 1167b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1168b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1169b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1170b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1171b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1172199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1173b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1174b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1175199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1176b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1177b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1178b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1179b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11801d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) && 11811d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman !V->getType()->isAggregateType()) 11826833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1183b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1184b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1185b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1186475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N1 = NodeMap[V]; 1187b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1188b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1189b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1190b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 1192475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants; 11931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 11941d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman OI != OE; ++OI) { 11951d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDNode *Val = getValue(*OI).Val; 11964bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 1197475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Constants.push_back(SDValue(Val, i)); 11981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11994bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 12001d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12011d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12021f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman if (isa<StructType>(C->getType()) || isa<ArrayType>(C->getType())) { 12031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12041f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman "Unknown struct or array constant!"); 12051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12061f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman SmallVector<MVT, 4> ValueVTs; 12071f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman ComputeValueVTs(TLI, C->getType(), ValueVTs); 12081f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman unsigned NumElts = ValueVTs.size(); 12098a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 1210475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); // empty struct 1211475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants(NumElts); 12121f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman for (unsigned i = 0; i != NumElts; ++i) { 12131f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman MVT EltVT = ValueVTs[i]; 12141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 12151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 12161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 12171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 12181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 12191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 12201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12211f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman return DAG.getMergeValues(&Constants[0], NumElts); 12221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1225b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1226b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 12276833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 12286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 1229475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Ops; 1230b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1231b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1232b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1233199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 12346833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12356833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 123683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(VecTy->getElementType()); 12376833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1238475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op; 12396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 12406833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 124183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands else if (EltVT.isFloatingPoint()) 12426833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1243b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 12446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1245b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1246199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1247b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1248b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1249b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1250199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1251199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1252b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1253b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1254199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1255199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1256b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1257199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1258199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1259199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1260199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1261251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1262251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1263199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12646833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1265475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 1266b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1267199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1268199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1269199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 12711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 127286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 12731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 12741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1275b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1276475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> NewValues; 127786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 127886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1279475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RetOp = getValue(I.getOperand(i)); 1280b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1281ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<MVT, 4> ValueVTs; 1282ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs); 1283ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) { 1284ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT VT = ValueVTs[j]; 1285ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1286ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // FIXME: C calling convention requires the return type to be promoted to 1287ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // at least 32-bit. But this is not necessary for non-C calling conventions. 1288ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.isInteger()) { 1289ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT MinVT = TLI.getRegisterType(MVT::i32); 1290ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.bitsLT(MinVT)) 1291ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman VT = MinVT; 1292ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1293b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1294ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 1295ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT PartVT = TLI.getRegisterType(VT); 1296475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 1297ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1298ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1299ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman const Function *F = I.getParent()->getParent(); 1300ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (F->paramHasAttr(0, ParamAttr::SExt)) 1301ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 1302ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1303ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 1304ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1305475871a144eb604ddaf37503397ba0941442e5fbDan Gohman getCopyToParts(DAG, SDValue(RetOp.Val, RetOp.ResNo + j), 1306ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman &Parts[0], NumParts, PartVT, ExtendKind); 1307ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1308ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 1309ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(Parts[i]); 1310ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1311ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1312ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 13131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1314bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1315bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 13161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1318571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1319571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1320571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1321571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1322571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1323571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1324571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1325571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1326571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1327571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1328571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 132986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1330571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1331571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 13328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 13338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 13348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 13358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 13368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 13378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 13388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 13398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 13428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 13468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 13478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 13488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 13498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 13528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 13568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 13588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13596a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 13606a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 13616a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 13626a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 13636a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 13646a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1365571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1366571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1367571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1368571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1369571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1370571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1371571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1372e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1373571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1374e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1375e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 13766a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 13776a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 13786a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1379571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1380571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1381e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1382e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1383e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1384e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 13855a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 13865a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 13875a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 13885a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 13895a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1390e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1391e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1392e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1393e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1394e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1395e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1396e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1397e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1398e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1399e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1400e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1401e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1402e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1403e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1404e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1405e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1406e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1407e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1408e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1409e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1410e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1411e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1412e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1413e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1414e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1415e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1416e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 14176bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 14186bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 1419e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1420e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1421e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1422e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1423e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1424e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1425e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1426e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1427e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1428e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1429e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1430e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1431e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 14320da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1433e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1434571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1435571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1436571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 14375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1438571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1439571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1440571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1441571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1442571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 14436b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 14445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1445571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1446571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1447571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1448571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1449d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1450d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1451571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 14520e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineFunction &MF = DAG.getMachineFunction(); 14530e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 14540e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurBB->getParent()->insert(++BBI, TmpBB); 1455571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1456d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1457d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1458d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1459d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1460d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1461d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1462d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1463d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1464571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1465d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1466d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1467d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1468d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1469d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1470d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1471d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1472d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1473d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1474d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1475d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1476d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1477d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1478d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1479d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1480d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1481d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1482d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1483d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1484d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1485d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1486d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1487571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1488571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1489df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1490df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1491df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1492df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1493df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1494df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1495df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 14960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 14970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 14980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 14990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 15000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 15010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 15020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 15030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 15040ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1505df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1506df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1507df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 15081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 15091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 15101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 15111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 15131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 15141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 15151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 15161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 15171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 15192d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update machine-CFG edges. 15202d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Succ0MBB); 15212d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 15221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 15231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 152486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1525dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 152657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 152757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 152857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 152957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 153057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 153157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 153257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1533571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1534571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1535571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1536571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1537571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1538571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1539571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1540571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1541571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1542571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1543571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1544571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1545571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1546571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1547571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1548571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1549571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1550571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1551d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1552571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1553571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 15540ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 15550ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 15560ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 15570ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 15580ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1559df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1560df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1561df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1562df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1563df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1564df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1565df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1566df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1567df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1568df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1569df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 15705a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 15715a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 15720ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 15730ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 15740ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 15750e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMBB->getParent()->erase(SwitchCases[i].ThisBB); 15760ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1577df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1578571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1579571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 15802452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 15812452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 15826b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 15835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 15842452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 15852452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 15862452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 15871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1589f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1590f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1591f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 1592475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond; 1593475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CondLHS = getValue(CB.CmpLHS); 159457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 15955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 15965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 15975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 15985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 15995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 16015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 1602475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, CondLHS.getValueType()); 16035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 16045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 16055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 16065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 16085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 16105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 16115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1612475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CmpOp = getValue(CB.CmpMHS); 161383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = CmpOp.getValueType(); 16143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 16165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 16175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 1618475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 16195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 16205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 16215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16242d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update successor info 16252d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.TrueBB); 16262d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.FalseBB); 16272d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1628f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1629f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1630f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1631f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1632f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1633f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1635f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1636f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 163757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 163857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1639475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, Cond.getValueType()); 1640f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1641f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1642475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 164357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 1644bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1645bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // If the branch was constant folded, fix up the CFG. 1646bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond.getOpcode() == ISD::BR) { 16473bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.FalseBB); 1648f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1649bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } else { 1650bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // Otherwise, go ahead and insert the false branch. 1651bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond == getControlRoot()) 16523bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.TrueBB); 1653bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1654bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (CB.FalseBB == NextBlock) 1655bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(BrCond); 1656bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson else 1657bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 1658bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.getBasicBlock(CB.FalseBB))); 1659bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } 1660f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1661f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 16623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 166337efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 166437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1665f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 166683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PTy = TLI.getPointerTy(); 1667475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 1668475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Table = DAG.getJumpTable(JT.JTI, PTy); 16693d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 16703d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 16713d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 167237efe6764568a3829fee26aba532283131d1a104Nate Begeman} 167337efe6764568a3829fee26aba532283131d1a104Nate Begeman 16743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 16753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 16763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 16773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 16783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 16793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 16803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 1681475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(JTH.SValue); 168283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1683475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 16843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 16853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 16873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 16883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 16893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 16903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 16918e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 16923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 16933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 16943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 16953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1697475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 16983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 16993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 17013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 17023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 1703475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 17053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 17063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 17133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1714475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 17153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 17163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 17183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 17193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 17203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 17214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 17224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 17253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 17274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 17284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 17294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 1730475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(B.SValue); 173183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1732475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 17344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 1736475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 17384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 17394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1740475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ShiftOp; 17418e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getShiftAmountTy())) 17424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 17434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 17454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 1747475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 17504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1752475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 17544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 17632d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17642d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.Default); 17652d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(MBB); 17662d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1767475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 17682d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(B.Default)); 17692d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 1784475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, 1785ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner TLI.getPointerTy()); 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1787475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal, 1788ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.getConstant(B.Mask, TLI.getPointerTy())); 1789475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 17922d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17932d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.TargetBB); 17942d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(NextMBB); 17952d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1796475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 17984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 18004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 18054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 18074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 18104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 18114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 18134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 18143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1815b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1816b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1817b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1818f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 18199fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1820fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1821fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1822fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 18236f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1824f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1825f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1826f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1827f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1828f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1829f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 183086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1831f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 18329fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1833f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1834f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1835f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 18362d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18372d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Drop into normal successor. 18382d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 18392d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(Return))); 1840b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1841b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1842b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1843b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1844b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 18455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1846b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1847dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1848b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1849b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1851dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1852dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1853dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1854dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 18554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1856dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 18575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1859b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1867b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1868b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1870b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 18755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1876b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1877b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1878b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 18795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1880b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1883b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1884b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1885b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1890b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1891b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1892b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 18930e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 18940e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FallThrough); 1895b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1896b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1897b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1898b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 19015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 19025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 19035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 19045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 19055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 19075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 19115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1912b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1913b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1914b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1915b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1916b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1917b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1918b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1919b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1920b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1921b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1922b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1923b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1924dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1925dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1926b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1927b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19287294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 19297232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen return !DisableJumpTables && 19307232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 19317232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 19327294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 19337294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1934b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1935dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1936b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1937b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1938b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1939dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1940dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1941dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 19435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 19445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 19465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 19485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1949dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19507294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1951dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1952dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 19545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1955dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1956dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 19585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 19594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 19605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1961b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1962b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1963dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1964b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1965b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1966b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1967b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1968b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1969b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1970b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1971b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1973b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1975b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1976b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1977b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 19780e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 19790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, JumpTableBB); 1980b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1981b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1982b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1983b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 19844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1985b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1986b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1987b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1988b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 19895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 19905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 19915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 19925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 19945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 19955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 19965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1997b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1998b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1999b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2001b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2002b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 20035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 2004b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 2005b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 2006b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 2007b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 2008b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 2009b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2010b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2011b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2012b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 2013b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 2014b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 2015b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2016b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 2017b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 2018f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 2019b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 2020b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 2021b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2022b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 2023b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2024b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 2025b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2026dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2027b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2028b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2029b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 2030b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 2031dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 2032b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2033b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2034b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2035b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2036b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2037b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2038b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2039b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2040b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2041b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2042b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2043b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2044b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2045b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2046b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 2047b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2048b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2049b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2050b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 2051b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 2052b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 20535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 20545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 20554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 20565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 2057b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2058b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 2059b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 20605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 20615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 20635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 20645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 20665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 20674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 20684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 20694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 2070b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 20715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 20725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 20735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 20744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 2075b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 2076b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 207754e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 20784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 20794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 20804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 20814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 20824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 20834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 2084b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 20854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 20864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 2087b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 20905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 2091b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20927294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 20937294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 20947294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 20957294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 20967294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 20977294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 2098b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2099b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 2100b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 21015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 2102b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 2103b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2104b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 2105b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 2106b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 2107b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 2108b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 2109b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 2110b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 21115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 21125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 21135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 21145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 2115b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21160e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21170e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, TrueBB); 2118b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 2119b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2120b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2121b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 2122b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 2123b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 2124b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 2125b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 21265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 21275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 21285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 2129b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21300e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21310e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FalseBB); 2132b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 2133b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2134b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2135b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2136b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 2137b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 21385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 21395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 2140b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2141b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2142b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2143b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2144b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2145dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2146dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2147b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2148b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 21504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 21514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 21524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 21534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 21544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 21553ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 215683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits(); 21574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 21594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 21604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 21624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 21634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 21644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 21664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 21674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 21684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 21694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 21704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 21714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 21724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 21734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 21764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 21774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 21784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 21794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 21804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 21814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 21844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 21854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 21874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 21884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 21894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 21904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 21924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 21934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 21944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2195ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 21964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 21974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 21984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 21994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 22004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 22024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 22064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 22074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2208e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 22094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 22104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 22114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 22124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 22154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 22164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 22184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 22194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 22204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 22214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 22224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 22244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 22254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 22264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 22274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 22304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 22314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2233e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 22344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 22354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 22394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 22414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 22434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 22444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 22454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 22474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 22494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 22504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 22514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 22524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22530e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22540e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, CaseBB); 22554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 22564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 22574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 22584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2261efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 22624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 22634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 22654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 22664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 22684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 22704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 22714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 227386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 22745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 22755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 22765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 22775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 22795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 22805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 22815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 22825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 22835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 22845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2285b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 22865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 22885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2289a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2290a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 229127a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 22925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 22935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 22945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 22955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 22965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 22985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 22995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 23005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 23015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 23025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 23035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 23045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 23085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 23095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 23105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 23115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 23145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 23155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2317f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2318f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2319f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2320c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 23215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2322d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2323f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2324f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 23255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2326f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2327c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2328f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 23292d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Default); 2330d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 233186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2332d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 23332d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 2334f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2335f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2336f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2337f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2338f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2339f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 23405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 23415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 23425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 23435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2344c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2345f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2346f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2347f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 23485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 234937efe6764568a3829fee26aba532283131d1a104Nate Begeman 23503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2351b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 23523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 23533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 23553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 23563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 23573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 23583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 23604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 23614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 23633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2364dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2365dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2366dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 23674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 23683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 23693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2370dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2371dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2372dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2373dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2374dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2375dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 23793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2380b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2381b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 238224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 23839d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 23847f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 23857f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 23867f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2387c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2388c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 23899e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2390c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2391c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2392475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2393c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2394c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2395c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 23967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 240001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 24019e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 2402475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 240301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 240401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 240501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 24067f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 24077f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 24087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2409b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2410b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 24117f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 2412475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2413475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 241424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 241524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 24161628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 24171628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2418e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2419475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2420475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 24215bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (!isa<VectorType>(I.getType())) { 24225bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType())) 24235bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 24245bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType())) 24255bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 24265bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman } 2427e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 24281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 24291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 243145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2432e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2433e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2434e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2435e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2436e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2437475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2438475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 243945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2440e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 244145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 244245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 244345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 244445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 244545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 244645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 244745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 244845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 244945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 245045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 245145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 245245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 245345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 245445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 245545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 245645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 245745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 245845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 245945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2460e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2461e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2462e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2463e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2464e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2465475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2466475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2467e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2468e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2469e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2470e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2471e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2472e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2473e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2474e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2475e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2476cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2477cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2478e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2479e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2480e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2481e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2482e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2483e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2484e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 248545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 248645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2487e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 248845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 248945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2490e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2491e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2492e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2493e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2494e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 24951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2497b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVICmp(User &I) { 2498b43e9c196542acc80c9e4643809661065710848fNate Begeman ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2499b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VICmpInst *IC = dyn_cast<VICmpInst>(&I)) 2500b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = IC->getPredicate(); 2501b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2502b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = ICmpInst::Predicate(IC->getPredicate()); 2503475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2504475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2505b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Opcode; 2506b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2507b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 2508b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 2509b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 2510b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 2511b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 2512b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 2513b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 2514b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 2515b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 2516b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 2517b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2518b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid ICmp predicate value"); 2519b43e9c196542acc80c9e4643809661065710848fNate Begeman Opcode = ISD::SETEQ; 2520b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2521b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2522b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode)); 2523b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2524b43e9c196542acc80c9e4643809661065710848fNate Begeman 2525b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVFCmp(User &I) { 2526b43e9c196542acc80c9e4643809661065710848fNate Begeman FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2527b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I)) 2528b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FC->getPredicate(); 2529b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2530b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FCmpInst::Predicate(FC->getPredicate()); 2531475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2532475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2533b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Condition, FOC, FPC; 2534b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2535b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2536b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2537b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2538b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2539b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2540b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2541b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2542b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2543b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2544b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2545b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2546b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2547b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2548b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2549b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2550b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 2551b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2552b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid VFCmp predicate value"); 2553b43e9c196542acc80c9e4643809661065710848fNate Begeman FOC = FPC = ISD::SETFALSE; 2554b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2555b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2556b43e9c196542acc80c9e4643809661065710848fNate Begeman if (FiniteOnlyFPMath()) 2557b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FOC; 2558b43e9c196542acc80c9e4643809661065710848fNate Begeman else 2559b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FPC; 2560b43e9c196542acc80c9e4643809661065710848fNate Begeman 256183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2562b43e9c196542acc80c9e4643809661065710848fNate Begeman 2563b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition)); 2564b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2565b43e9c196542acc80c9e4643809661065710848fNate Begeman 25661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 2567475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond = getValue(I.getOperand(0)); 2568475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TrueVal = getValue(I.getOperand(1)); 2569475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue FalseVal = getValue(I.getOperand(2)); 25707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 25717f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 25721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 25763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 2577475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 257883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 25803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 25833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 2585475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 258683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 25883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 25913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 2593475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 259483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 25963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 25993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2600475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 260183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26020bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 26033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 26063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2607475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 260883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 26103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 26133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 2614475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 261583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 26173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 26203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 2621475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 262283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 26243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 26273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2628475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 262983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 26313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 26343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2635475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 263683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 26383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 26413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2643475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 264483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 264583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2646475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 26478e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 26493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 26523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 26533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 26563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2658475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 265983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 266083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26618e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 26633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 26663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 2669475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 267083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 26733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 26743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 26753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 26763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 26781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26802bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2681475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2682475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVal = getValue(I.getOperand(1)); 2683475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2684c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2685c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26867f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 26877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2689c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2690c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26912bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2692475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2693475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2694384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 26957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2696384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2697384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2698c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26993e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 2700475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V1 = getValue(I.getOperand(0)); 2701475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V2 = getValue(I.getOperand(1)); 2702475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Mask = getValue(I.getOperand(2)); 27033e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 27057f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 27067f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 27073e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 27083e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitInsertValue(InsertValueInst &I) { 27101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op1 = I.getOperand(1); 27121d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = I.getType(); 27131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = Op1->getType(); 27141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool IntoUndef = isa<UndefValue>(Op0); 27151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool FromUndef = isa<UndefValue>(Op1); 27161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> AggValueVTs; 27211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, AggTy, AggValueVTs); 27221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumAggValues = AggValueVTs.size(); 27261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2727475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumAggValues); 27281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2729475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 2730475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = getValue(Op1); 27311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned i = 0; 27321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy the beginning value(s) from the original aggregate. 27331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex; ++i) 27341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2735475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy values from the inserted value(s). 27371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex + NumValValues; ++i) 27381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2739475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Val.Val, Val.ResNo + i - LinearIndex); 27401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy remaining value(s) from the original aggregate. 27411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != NumAggValues; ++i) 27421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2743475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2745f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&AggValueVTs[0], NumAggValues), 2746f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumAggValues)); 2747041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2748041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) { 27501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = Op0->getType(); 27521d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = I.getType(); 27531d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool OutOfUndef = isa<UndefValue>(Op0); 27541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2762475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValValues); 27631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2764475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 27651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy out the selected value(s). 27661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 27671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i - LinearIndex] = 2768dded0fd398bf744454b2c9c95b68f4a27025f880Dan Gohman OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.Val->getValueType(Agg.ResNo + i)) : 2769475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2771f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValValueVTs[0], NumValValues), 2772f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValValues)); 2773041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2774041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27753e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 2777475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 27781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 27791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 27811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 27821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2783c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2784b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 27851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 27861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2787b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 27881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27890bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 27901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 27911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 27921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 27931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 27947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 27967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2797b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 279847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2799a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 28000bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 28010bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 28027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 28037c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 28047c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2806a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 2807475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue IdxN = getValue(Idx); 28087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 28107c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 28118e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IdxN.getValueType().bitsLT(N.getValueType())) { 281247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 28138e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands } else if (IdxN.getValueType().bitsGT(N.getValueType())) 28147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 28157c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 28177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 28187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 28197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 28207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 28216b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 28221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28237c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 28241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28257c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 2826475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Scale = DAG.getIntPtrConstant(ElementSize); 28277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 28287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 28321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 28351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 28361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 28371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 28381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 28391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2841514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 284258092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2843d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 284458092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 28451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2846475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AllocSize = getValue(I.getArraySize()); 284783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 28488e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(AllocSize.getValueType())) 284968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 28508e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(AllocSize.getValueType())) 285168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 28521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 285368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 28540bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 28551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28564515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 28574515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 28584515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 28591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 28601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 28614515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 28621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 28634515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 28644515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 28654515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 28664515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 28670bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 28684515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 28694515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 28700bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 28711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2872475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 287383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2874f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2875475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 28760da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 28770da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 28781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 28801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 28811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 28821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 28858a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Value *SV = I.getOperand(0); 2886475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ptr = getValue(SV); 28878a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28888a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Type *Ty = I.getType(); 28898a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman bool isVolatile = I.isVolatile(); 28908a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned Alignment = I.getAlignment(); 28918a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28928a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<MVT, 4> ValueVTs; 28938a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<uint64_t, 4> Offsets; 28948a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 28958a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned NumValues = ValueVTs.size(); 28968a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 28978a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 2898edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2899475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root; 29008b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman bool ConstantMemory = false; 2901d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 29028b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Serialize volatile loads with other side effects. 2903d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 29048b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else if (AA.pointsToConstantMemory(SV)) { 29058b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Do not serialize (non-volatile) loads of constant memory with anything. 29068b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman Root = DAG.getEntryNode(); 29078b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman ConstantMemory = true; 29088b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } else { 2909d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2910d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2911d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 291228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2913475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValues); 2914475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) { 2917475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getLoad(ValueVTs[i], Root, 29181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SV, Offsets[i], 29211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = L; 29231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = L.getValue(1); 29241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 29251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29268b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (!ConstantMemory) { 2927475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 29288b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman &Chains[0], NumValues); 29298b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (isVolatile) 29308b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman DAG.setRoot(Chain); 29318b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else 29328b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman PendingLoads.push_back(Chain); 29338b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } 29341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2935f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], NumValues), 2936f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValues)); 29371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 29411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 29421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Value *PtrV = I.getOperand(1); 29431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValueVTs; 29451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<uint64_t, 4> Offsets; 29461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 29471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValues = ValueVTs.size(); 29488a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 29498a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 29501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 295190d33ee746f354030a4144c4ffa028599663615bDan Gohman // Get the lowered operands. Note that we do this after 295290d33ee746f354030a4144c4ffa028599663615bDan Gohman // checking if NumResults is zero, because with zero results 295390d33ee746f354030a4144c4ffa028599663615bDan Gohman // the operands won't have values in the map. 295490d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Src = getValue(SrcV); 295590d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Ptr = getValue(PtrV); 295690d33ee746f354030a4144c4ffa028599663615bDan Gohman 2957475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 2958475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool isVolatile = I.isVolatile(); 29611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned Alignment = I.getAlignment(); 29621d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) 2963475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Chains[i] = DAG.getStore(Root, SDValue(Src.Val, Src.ResNo + i), 29641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PtrV, Offsets[i], 29671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29681d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues)); 29701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29720eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 29730eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 29740eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 29750eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2976a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2977a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2978a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 29790eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2980475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops; 2981e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2982e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2983e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2984e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2985e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2986e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2987e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2988e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 29890eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29900eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 29910eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 29920eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29930eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 29940eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 2995475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(I.getOperand(i)); 29960eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 29970eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 29980eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 29990eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30000eade319cdb72e24c11d068728a98083737c6435Chris Lattner 300183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands std::vector<MVT> VTs; 30020eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 300383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(I.getType()); 300483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (VT.isVector()) { 30059d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 300683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(DestTy->getElementType()); 30070eade319cdb72e24c11d068728a98083737c6435Chris Lattner 300883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands VT = MVT::getVectorVT(EltVT, DestTy->getNumElements()); 30090eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 30100eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30110eade319cdb72e24c11d068728a98083737c6435Chris Lattner 30120eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 30130eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 30140eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30150eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 30160eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 30170eade319cdb72e24c11d068728a98083737c6435Chris Lattner 301883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTList = DAG.getNodeValueTypes(VTs); 3019f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 30200eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 3021475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 302248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 3023f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 3024f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 302548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 3026f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 3027f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 302848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 3029f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 3030f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 303148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 3032e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 3033475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = Result.getValue(Result.Val->getNumValues()-1); 3034e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 3035e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 3036e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 3037e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 3038e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 30390eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 30409d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 304183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PTy); 30427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 30430eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30440eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 30450eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30460eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 30470eade319cdb72e24c11d068728a98083737c6435Chris Lattner 3048b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 3049cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 30500b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov V = V->stripPointerCasts(); 3051b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 30524c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 3053cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 3054cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 3055cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 3056cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3057f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 3058cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 3059f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 3060f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 3061f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 3062f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 3063f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 3064f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 3065f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 3066f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 3067f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3068f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 3069f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 3070f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 3071cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 3072cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3073cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 3074cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 3075cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 30766590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 3077cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 3078cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3079cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 3080cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 3081cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 3082cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3083cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3084cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 3085cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3086cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 30876590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 30886590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 30896590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 30906590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 30916590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 30926590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 30936590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 30946590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 30956590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 30966590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 30976590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 3098cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3099cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 3100cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3101f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 3102cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3103cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 3104cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 3105cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 3106cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3107f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3108cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3109f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 3110f40708223e409a152834b1553c6883ff2035b957Duncan Sands 311163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 311263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang/// Inlined utility function to implement binary input atomic intrinsics for 311363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// visitIntrinsicCall: I is a call instruction 311463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// Op is the associated NodeType for I 311563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangconst char * 311663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P WangSelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) { 3117475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3118475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(Op, Root, 311963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang getValue(I.getOperand(1)), 3120fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(2)), 312128873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 312263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang setValue(&I, L); 312363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang DAG.setRoot(L.getValue(1)); 312463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return 0; 312563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang} 312663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 3127c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3128c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 3129c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 3130c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 3131c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 3132c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 31330eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 31340eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 31350eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 31360eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 3137c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 3138c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 3139c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 3140bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 3141bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 3142bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3143bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3144bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 3145bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 3146bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3147bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3148c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 3149d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3150c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 3151c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 3152d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3153c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 315403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 3155707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 3156475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3157475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3158475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3159707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3160707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3161707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 316203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3163707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 316403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 3165707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 3166475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3167475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3168475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3169707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3170707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 3171707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 317203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3173707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 317403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 3175707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 3176475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3177475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3178475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3179707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3180707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3181707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 3182707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 3183707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 3184707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3185707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 3186707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3187707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 3188707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3189707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 3190707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 3191707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 3192707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3193707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 3194707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 319503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3196707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 319786cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 319844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 319943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 320044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 320144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 3202ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 32037f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman DAG.setRoot(DAG.getDbgStopPoint(getRoot(), 32047f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getLine(), 32057f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getColumn(), 32067f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman cast<CompileUnitDesc>(DD))); 320786cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 320843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3209b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 321036ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 321143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 321244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 321343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 321444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 321544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 32164406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 321743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 321843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3219b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 322043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 322143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 322244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 322343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 322444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 322544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 32264406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 322743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 322843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3229b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 323043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 323143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 323244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 32331b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 323443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 32351b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 32361b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 32371b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 32381b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 32391b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 32401b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 32411b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 32421b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 324399fe47bc81d53762454ff112ab34378b00299b5aDan Gohman unsigned SrcFile = MMI->RecordSource(CompileUnit); 32441b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 32451b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 32461b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 324743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 324843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3249b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 325043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 325143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 325244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 325343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3254a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 3255a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 3256a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 3257a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 325843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 325943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 3260c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3261b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 32621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 32631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 32641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 32651532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 3266735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 32671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 32681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3269475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[1]; 32701532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 3271475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 32721532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 32731532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 3274b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3275b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3276b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 32778806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 32788806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 3279b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 328083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 32818806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 32828806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 32831532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 3284f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 3285f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 3286e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 3287f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3288f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 3289f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 3290902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 3291902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 3292902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 3293e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 3294735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3295735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 32968806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 3297475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[2]; 3298735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 3299735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 3300475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 3301735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 3302735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 33037a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 33048806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 3305b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3306b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3307b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3308b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 33098806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 33108806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 33118806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 3312b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 331383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 33148806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 3315735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3316735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 3317735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 3318cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 33193b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 3320735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 33218806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 33227a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 3323f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 33248806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 3325b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3326b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3327b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3328b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3329b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 33302365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 33312365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 33322365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33331532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 33342365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 33352365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 33362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 333786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 33382365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 33392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 33402365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 33412365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 33422365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33432365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33472365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 33482365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 33492365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 33502365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33512365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33522365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33532365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33542365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33552365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 335683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = getValue(I.getOperand(1)).getValueType(); 3357475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CfaArg; 33588e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 33591532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 33601532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33611532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 33621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 33631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 3365475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Offset = DAG.getNode(ISD::ADD, 33661532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 33681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 33691532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 33701532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 33711532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33721532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 33731532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33741532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 33751532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 33761532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 33772365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33782365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33792365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33809ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3381c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3382c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3383c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3384c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 33859ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 33866ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 33876ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 33886ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 33896ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 33906ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3391ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3392ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3393ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3394ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3395ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3396ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3397ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3398ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3399ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3400ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3401ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3402ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3403ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3404ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3405ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3406ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3407c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3408475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 3409c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3410c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3411c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 34128b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3413475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3414475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3415f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3416f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 34178b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 34188b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 341951b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 34208b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3421c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 34223f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3423f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3424f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3425f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3426f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3427f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3428f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 34293f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3430addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3431a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3432d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3433d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3434d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3435d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3436a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3437475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 343883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3439475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3440a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3441c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3442a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3443a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3444475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 344583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3446475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3447a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3448c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3449a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3450a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3451475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 345283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3453475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3454a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3455c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3456a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3457140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3458475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3459475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::STACKSAVE, 3460f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3461140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3462140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3463140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3464140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 346539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 3466475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 346739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3468140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 346939a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 347024e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 347124e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 347224e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 347336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 347436397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 34750b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 347636397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3477475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 347836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 347936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 348036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 348136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 348236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 348336397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 348436397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3485475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::TRAMPOLINE, 3486f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3487f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3488f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3489f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3490f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3491f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 349236397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 349336397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3494ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3495ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 34965eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (GFI) { 3497ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3498ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3499ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3500ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 35015eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI->addStackRoot(FI->getIndex(), TypeMap); 3502ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3503ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3504ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3505ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3506ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 35075eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen assert(0 && "GC failed to lower gcread/gcwrite intrinsics!"); 3508ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3509ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3510917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 35111a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3512917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3513917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 351466fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 351566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 351666fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 351766fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 351866fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 351927b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 3520475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[4]; 352127b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 352227b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 352327b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 352427b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 352527b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 352627b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 352727b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 352827b7db549e4c5bff4579d209304de5628513edebEvan Cheng 352922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 3530475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 353122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 353222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 353322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 353422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 353522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 353622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 353722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 353828873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_cmp_swap: { 3539475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3540475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, Root, 3541ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3542ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3543fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(3)), 354428873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 3545ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3546ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3547ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3548ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 354928873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_add: 355028873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD); 355128873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_sub: 355228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB); 355363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_and: 355463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND); 355563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_or: 355663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR); 355763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_xor: 355863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR); 3559507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth case Intrinsic::atomic_load_nand: 3560507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND); 356163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_min: 356263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN); 356363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_max: 356463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX); 356563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umin: 356663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN); 356763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umax: 356863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX); 356963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_swap: 357063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP); 3571c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3572c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3573c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3574c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3575475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDValue Callee, 35761da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3577070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 35786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3579735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3580070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3581070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 35826f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3583735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3584735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 35856f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 35866f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 35876f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 3588475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ArgNode = getValue(*i); 35896f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 35906f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 35916f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 35926f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 35936f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 35946f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 35956f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 35966f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 35976f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 359808e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3599735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3600735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3601735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 36021532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3603070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3604070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3605070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3606a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3607a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3608a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 36094406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getControlRoot(), BeginLabel)); 3610070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 36116f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3612475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 36136f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 36146f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 361500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 36166f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3617735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 36186f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 36196f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3620735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3621070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36221532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3623070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3624070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3625070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 36264406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getRoot(), EndLabel)); 3627070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36286f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3629070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3630070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3631735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3632735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3633735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 36341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 363564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3636c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 363787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3638c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3639c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3640c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3641c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 364287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 364387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 364487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 364587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 364687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 364787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 364887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 364987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 365087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 365187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 365287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 365387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 365487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 365587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 365687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 3657475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue LHS = getValue(I.getOperand(1)); 3658475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RHS = getValue(I.getOperand(2)); 365987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 366087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 366187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 366287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 366387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 366487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 36652f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 36662f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 366787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 366887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 366987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3670475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 367187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 367287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 367387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 367487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 367587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 36762f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 36772f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 367887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 367987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 368087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3681475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 368287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 368387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 368487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 368587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 368687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 36872f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 36882f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 368987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 369087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 369187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3692475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 369387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 369487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3695f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3696c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 369787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3698ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3699fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3700ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3701c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3702edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3703475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee; 370464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 370564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 370664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 370764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3708070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 37096f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 37101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3712735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3713b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3714b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3715b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3716b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3717475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, 3719475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Flag) const { 372023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 3721475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(ValueVTs.size()); 3722475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts; 37236833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 372423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 372583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 372623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 372783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 372823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 37296833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 373023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3731475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue P; 37326833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 37336833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 37346833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 37356833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 373623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 37376833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 37386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 3739ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3740ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If the source register was virtual and if we know something about it, 3741ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // add an assert node. 3742ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 3743ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT.isInteger() && !RegisterVT.isVector()) { 3744ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 3745ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 3746ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FLI.LiveOutRegInfo.size() > SlotNo) { 3747ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 3748ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3749ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned RegSize = RegisterVT.getSizeInBits(); 3750ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = LOI.NumSignBits; 3751ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 3752ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3753ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // FIXME: We capture more information than the dag can represent. For 3754ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // now, just use the tightest assertzext/assertsext possible. 3755ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner bool isSExt = true; 3756ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT FromVT(MVT::Other); 3757ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits == RegSize) 3758ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 3759ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-1) 3760ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 3761ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-8) 3762ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 3763ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-9) 3764ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 3765ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-16) 3766ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 3767ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-17) 3768ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 3769ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-32) 3770ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 3771ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-33) 3772ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 3773ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3774ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FromVT != MVT::Other) { 3775ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, 3776ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT, P, DAG.getValueType(FromVT)); 3777ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3778ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3779ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3780ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3781ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 378223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 378323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3784b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 378523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 378623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 378723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 378823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37894bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands 3790f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands return DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 3791f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], ValueVTs.size()); 3792b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3793b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3794b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3795b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3796b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3797b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3798475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, 3799475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const { 3800b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 380123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 3802475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts(NumRegs); 38036833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 380483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 380523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 380683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 380723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 380823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 380923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 381023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 381123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3812b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3813b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 3814475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Chains(NumRegs); 381523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3816475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Part; 38176833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 38186833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 38196833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 38206833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3821b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 38226833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 38236833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3824c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 38256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 382633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 382733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 382833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 382933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 383033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 383133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 383233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 383333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 383433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 383533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 383633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 383733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 38386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 38396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3840c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3841864635ad7b3046d3042311423071152c613961deChris Lattner 3842c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3843c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3844c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3845c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 3846475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const { 384783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 38484b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 38496833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 38506833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 385183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 38526833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 38536833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 385423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3855c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3856864635ad7b3046d3042311423071152c613961deChris Lattner 3857864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3858864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3859864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3860864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 38619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 38626f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 38636f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 386483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT FoundVT = MVT::Other; 3865f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 38666f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 38676f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 386883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::Other; 3869f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 38709b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 38719b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 38729b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 38739b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 38749b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 38759b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3876f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3877f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3878f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 38798e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 3880f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3881f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3882f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 38839b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38849b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38859b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3886f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 38879b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3888864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3889864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3890864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3891864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 38929b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 38939b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3894f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3895f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3896f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3897f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3898f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3899f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3900f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3901864635ad7b3046d3042311423071152c613961deChris Lattner } 3902f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3903864635ad7b3046d3042311423071152c613961deChris Lattner} 3904864635ad7b3046d3042311423071152c613961deChris Lattner 3905bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3906bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3907bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3908bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 39095c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 39105c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 39115c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 39125c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3913475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CallOperand; 39145c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3915e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3916e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3917e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3918e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 391923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 39205c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3921bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3922bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3923e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3924e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3925e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3926e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 39277cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 39287cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 39297cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 39307cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39317cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 39327cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39337cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 39347cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39357cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 39367cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39377cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39387cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 39397cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 39407cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 39417cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 39427cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 39437cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 39447cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 39457cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 39467cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 39477cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 39487cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 39497cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3950bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3951bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3952bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3953bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 39540fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 39550fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 39560fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 39570fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 39580fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 39590fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 39600fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 39610fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 39620fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 39630fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 39640fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3965e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 39665c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3967864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 39684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3969e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3970e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3971e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3972e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3973e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3974e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3975e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3976e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3977e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3978e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3979e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3980e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3981e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3982e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3983e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3984e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3985e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3986e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3987e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3988e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3989e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3990e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3991e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3992e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3993e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3994b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 3995e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3996e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3997e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3998e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3999e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 4000e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 4001864635ad7b3046d3042311423071152c613961deChris Lattner 4002bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 4003bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 4004b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 400583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegVT; 400683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = OpInfo.ConstraintVT; 4007864635ad7b3046d3042311423071152c613961deChris Lattner 4008bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 40092a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 40102a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 4011864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 4012bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 4013864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 4014cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 4015cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 4016cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 4017cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 4018cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 4019864635ad7b3046d3042311423071152c613961deChris Lattner 4020864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 4021864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 4022864635ad7b3046d3042311423071152c613961deChris Lattner 4023864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 4024864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 4025864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 4026864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 402750871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Didn't find reg!"); 4028864635ad7b3046d3042311423071152c613961deChris Lattner 4029864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 4030864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 4031864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 403250871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Ran out of registers to allocate!"); 4033864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 4034864635ad7b3046d3042311423071152c613961deChris Lattner } 4035864635ad7b3046d3042311423071152c613961deChris Lattner } 403623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 40377cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 40387cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4039e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4040864635ad7b3046d3042311423071152c613961deChris Lattner } 4041864635ad7b3046d3042311423071152c613961deChris Lattner 40422a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 40432a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 40442a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 4045c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 4046c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 40472a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 40482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 40492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 4050e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 4051e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 4052e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 4053e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 4054e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 40552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 40563a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4057bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 40583a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 40592a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 406184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 40622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 406384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 40642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 406523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 4066e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 40672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 40682a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40692a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 40702a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 40712a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 40722a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40732a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 40742a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 40752a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 40762a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 4077bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 4078bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 40792a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 4080e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 40816f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 4082864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 4083864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 4084864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 40854e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 4086864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 4087864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 4088864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 4089864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 4090864635ad7b3046d3042311423071152c613961deChris Lattner continue; 4091864635ad7b3046d3042311423071152c613961deChris Lattner } 4092864635ad7b3046d3042311423071152c613961deChris Lattner 40934e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 40944e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 4095c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 40966f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 4097c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 4098c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 4099c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 4100c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 4101c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 41024e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 41034e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 4104864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 4105864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 4106864635ad7b3046d3042311423071152c613961deChris Lattner 4107e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 4108864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 4109864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 4110864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 4111864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 4112e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 4113e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 4114864635ad7b3046d3042311423071152c613961deChris Lattner 411523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 4116e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 41177cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4118e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4119864635ad7b3046d3042311423071152c613961deChris Lattner } 41204e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 4121864635ad7b3046d3042311423071152c613961deChris Lattner 4122864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 41234e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 41244e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 41253ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 4126ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 4127ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 4128fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 4129fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 4130ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 41325c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 4133ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4134475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = getRoot(); 4135475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Flag; 4136ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41374e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 41380c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41390c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 41400c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 41410c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 41420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 4143e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4144e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 4145e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 4146e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 4147e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 4148e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4149fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 4150acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 41510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 41525c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 41535c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 41540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 415583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OpVT = MVT::Other; 41561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 41570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 41580c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 41591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 4160acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 4161acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 4162fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 4163acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 4164acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 4165acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 4166acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 4167acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 4168acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 4169acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 4170acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 4171acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 4172acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 41731efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 4174acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 41751efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41761efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 4177fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 41781efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41791efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 41800c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 41811efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41821efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 41830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 4185eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 41860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 4187507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 4188507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 4189eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 4190eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 4191eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 4192eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 4193eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 4194eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 4195eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 4196eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 41974fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman // If OpTy is not a single value, it may be a struct/union that we 4198eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 41994fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman if (!OpTy->isSingleValueType() && OpTy->isSized()) { 4200eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 4201eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 4202eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 4203eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 4204eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 4205eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 4206eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 4207eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 4208eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 4209eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 4210eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 42116995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 4212eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 4213eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 42140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42150c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 42170c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 42182a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 42193ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 42205a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 42211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 4222e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 4223e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 422409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 42250fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 422669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 422769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 422869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 422969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 423069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 423169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 423269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 423369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 423469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 423569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 423669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 423769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 423869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 42390fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 424009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 424109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 424209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 424309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 424409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 424509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 424609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 424709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 424809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 424909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 425009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 425109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 425209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 425309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 425409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 425509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 425609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 425709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 425809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 425909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 426009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 426109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 4262514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 426309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 426409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 426509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 4266475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 426709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 426809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 426909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 427009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 427109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 427209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 427309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 427409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 427509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 427609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 4277e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 4278e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 4279e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 4280e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 42810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42820c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 42830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 4285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 4286e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 4287e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 42885c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 4289e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4290e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 4291e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 4292e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 4293e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 4294e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4295e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 42960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 4297475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> AsmNodeOperands; 4298475871a144eb604ddaf37503397ba0941442e5fbDan Gohman AsmNodeOperands.push_back(SDValue()); // reserve space for input chain 42990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 43000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 43010c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 43022cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 43030f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 43040f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 4305864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 430641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 43070c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 4308864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 43090f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 43100c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 43115c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 43121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 43130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 43142cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 4315c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 4316c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 4317f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 431809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 431922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 432022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 432122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4322c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4323c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 432409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 432522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 432622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 432722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 43282a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 432922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 4330864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 4331864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 4332e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 4333a47c6c37034f4e57bc8187e959da4eadb6e24afaDuncan Sands cerr << "Couldn't allocate output reg for constraint '" 43340c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 4335d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 4336d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 43372cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 433841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 433941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 434041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 4341e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 43420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 434341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 434441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 434541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 434641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 434741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 43482cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 43496656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 43506656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 43516656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 4352e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 4353e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 43546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 43556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 43566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 4357475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InOperandVal = OpInfo.CallOperand; 43583d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 43590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 43602223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 43612223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 43620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 43633d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4364c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4365c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4366c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4367c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4368c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4369c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4370c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4371a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4372a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4373c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4374c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4375c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4376c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4377c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4378c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4379527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4380527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4381527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 438223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 43831fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 43841fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType()); 4385527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4386527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4387527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4388527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4389527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4390c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4391527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4392b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4393527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4394527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4395527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4396527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4397f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4398f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4399f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4400f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4401f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4402f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4403f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4404c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 440587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 440687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44072a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 44080c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 440944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 441044b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 4411475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> Ops; 441248884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 441348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 441448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4415832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 44160c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 441753069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 441853069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4419c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 442087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 442148884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4422c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4423c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 442448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 442587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 44262a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 442709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 442844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 442944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 443044b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 443187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 443287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4433c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4434c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 443587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4436c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 44372223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 443887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44392a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 44402a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 44412a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 44420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 444344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 444487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 444587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4446e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4447e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 444887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4449b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 445087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4451e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4452e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4455c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4456c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4457c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4458e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4459e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4460e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4463c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 44646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4465ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4466ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4467ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4468ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4469ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4470f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4471f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4472bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4473ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4474ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 44766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 44773a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4478475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 44793fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 44803fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // If any of the results of the inline asm is a vector, it may have the 44813fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // wrong width/num elts. This can happen for register classes that can 44823fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // contain multiple different value types. The preg or vreg allocated may 44833fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // not have the same VT as was expected. Convert it to the right type with 44847f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 44853fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) { 44863fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) { 448783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.Val->getValueType(i).isVector()) 44883fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, 44893fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner TLI.getValueType(ResSTy->getElementType(i)), Val); 44903fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } 44913fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } else { 449283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.getValueType().isVector()) 44933fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()), 44943fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val); 44953a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44963fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 4497fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 44983a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44996656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 4500475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<std::pair<SDValue, Value*> > StoresToEmit; 45016656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 45026656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 45036656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 45046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4505864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 45066656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4507475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4508864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 45096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4510ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45116656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4512475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> OutChains; 45136656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 45140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 45156656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 45168b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 45176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4518bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4519bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4520ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4521ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4522ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4523ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 4525475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = getValue(I.getOperand(0)); 45261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 452783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 452868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 45298e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(Src.getValueType())) 453068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 45318e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(Src.getValueType())) 453268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 45331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4535514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 45361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 45370bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 45381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 453947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 454047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 454147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 454247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 454347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4544cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4545475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 454600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 454700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4548cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4549cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 455347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 455447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 455547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 455647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 455747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 455883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 4559475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 456000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 456100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4562cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4563cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4566ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4567ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4568025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4569025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4570025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4571ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4572025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4573832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4574832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4575ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4576025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4577025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4578025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4579025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 458039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4581acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4582acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4583acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 458439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 458539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 45861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4587475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4588acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4589acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4590acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4591acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 45921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4595acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4596acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4597acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4601acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4602acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4603acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4604acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4605acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 46061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4608fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4609fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4610f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4611f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4612a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohmanvoid TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG, 4613475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVectorImpl<SDValue> &ArgValues) { 4614fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4615475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 3+16> Ops; 46168c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4617fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4618fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4619fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4620fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4621a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<MVT, 16> RetVals; 46226aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4623ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4624ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4625f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4626f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4627f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4628f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4629f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4630f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4631f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4632f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4633f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4634f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4635f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ZExt)) 4636f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4637f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::SExt)) 4638f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4639f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::InReg)) 4640f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4641f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::StructRet)) 4642f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4643f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4644f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4645f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(I->getType()); 4646f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4647f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4648f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4649f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should be passed from FE. BE will guess if 4650f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // this info is not there but there are cases it cannot get right. 4651f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.getParamAlignment(j)) 4652f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = F.getParamAlignment(j); 4653f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4654f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4655f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4656f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::Nest)) 4657f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4658f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4659b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4660f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT RegisterVT = getRegisterType(VT); 4661f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4662f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4663f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman RetVals.push_back(RegisterVT); 4664f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4665f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumRegs > 1 && i == 0) 4666f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4667f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4668f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i > 0) 4669f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4670f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4671f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4672b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4673fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 46743b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 46758c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4676fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4677fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4678f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 467986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4680bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 468186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 468286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 468386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 468486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 4685475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TmpRes = LowerOperation(SDValue(Result, 0), DAG); 468686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 468786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 468886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 468986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 469086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 469186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 469286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 46932dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 46942dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman // The FORMAL_ARGUMENTS node itself is likely no longer needed. 46952dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman if (Result != TmpRes.Val && Result->use_empty()) { 46962dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman HandleSDNode Dummy(DAG.getRoot()); 46972dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman DAG.RemoveDeadNode(Result); 46982dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman } 46992dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 470086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 470186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 470227a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 4703475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DAG.setRoot(SDValue(Result, NumArgRegs)); 4704fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4705fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4706fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 470747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 470847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 470947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4710f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4711f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4712f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4713f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4714f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4715f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4716f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4717f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4719f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned j = 0; j != NumParts; ++j) 4720475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Parts[j] = SDValue(Result, i++); 4721f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4722f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE; 4723f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4724f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertSext; 4725f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4726f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertZext; 4727f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4728a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman ArgValues.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 4729a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman AssertOp)); 4730f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4731fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 473227a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4733fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4734fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4735f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4736f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4737f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4738f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4739f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4740475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstd::pair<SDValue, SDValue> 4741475871a144eb604ddaf37503397ba0941442e5fbDan GohmanTargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy, 474200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 474300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4744475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee, 4745f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4746475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 4747f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4748f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4749f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4750f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4751f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4752f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4753f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4754f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 4755f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4756f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 4757f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4758f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4759f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4760f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4761475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = SDValue(Args[i].Node.Val, Args[i].Node.ResNo + Value); 4762f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4763f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4764f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4765f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4766f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isZExt) 4767f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4768f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4769f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4770f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isInReg) 4771f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4772f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSRet) 4773f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4774f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isByVal) { 4775f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4776f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4777f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4778f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4779f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4780f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should come from FE. BE will guess if this 4781f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // info is not there but there are cases it cannot get right. 4782f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].Alignment) 4783f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = Args[i].Alignment; 4784f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4785f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4786f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4787f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isNest) 4788f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4789f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4790f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4791f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4792f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4793475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4794f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4795f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4796f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4797f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 4798f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (Args[i].isZExt) 4799f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 4800f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4801f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4802f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4803f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumParts; ++i) { 4804f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4805f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4806f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumParts > 1 && i == 0) 4807f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4808f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i != 0) 4809f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4810f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4811f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(Parts[i]); 4812f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4813f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 481427a70be55f8b63181598d144d034b396402be66eDan Gohman } 4815f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4816f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4817ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 481823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 481983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> LoweredRetTys; 482083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RetTys; 482123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4822ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 482323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 482423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 482583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 482683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4827ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4828ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4829ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4830ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4831f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4832ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4833f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4834b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4835475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Res = DAG.getNode(ISD::CALL, 4836ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4837ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4838be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4839ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4840b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4841b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4842b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 484300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 484400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 484500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 484600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 484700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4848b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 484900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4850475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> ReturnValues; 4851ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 485223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 485383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 485483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4855ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4856ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4857475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Results; 4858ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4859ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4860475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ReturnValue = 4861ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4862ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4863ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4864ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4865f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands Res = DAG.getMergeValues(DAG.getVTList(&RetTys[0], RetTys.size()), 4866f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &ReturnValues[0], ReturnValues.size()); 4867f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4868b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4869b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4870f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4871f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4872475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) { 4873171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4874171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4875475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 4876171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4877171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 48780aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 48797041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48807041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 48817041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 488383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sandsunsigned SelectionDAGISel::MakeReg(MVT VT) { 488484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 48851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4887495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4888c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 48895eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 4890c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4891495a0b51915eb763576874f29192820b731edc22Chris Lattner} 48921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 48945f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 48955f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 48965f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 48971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 48985eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (MF.getFunction()->hasGC()) 48995eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(*MF.getFunction()); 4900ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 49015eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 490284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4903832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 49041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 49061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 49081532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 49091532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 49101532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 49119fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 49120e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SelectAllBasicBlocks(Fn, MF, FuncInfo); 4913edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4914ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4915ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4916ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 491784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 491884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 491984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4920ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4921ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4922f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4923f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4924f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4925f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4926f40708223e409a152834b1553c6883ff2035b957Duncan Sands 49271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 49281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49306833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4931475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(V); 493218c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4933d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 493418c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 493586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4936b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 493723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 4938475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 493923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 494023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 49411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4943068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 494486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 49451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 494615699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 49470afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4948475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OldRoot = SDL.DAG.getRoot(); 4949475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Args; 4950a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman TLI.LowerArguments(F, SDL.DAG, Args); 4951bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4952bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4953bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4954f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AI != E; ++AI) { 4955f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4956f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(TLI, AI->getType(), ValueVTs); 4957f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumValues = ValueVTs.size(); 4958bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 49594bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands SDL.setValue(AI, SDL.DAG.getMergeValues(&Args[a], NumValues)); 4960bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4961bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4962251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4963251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 496486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4965bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 49660afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4967f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman a += NumValues; 4968f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4969bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4970bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4971966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4972bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4973068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4974068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4975f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4976f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4977f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4978cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4979f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4980f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4981f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4982560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4983560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4984f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4985f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4986f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4987f40708223e409a152834b1553c6883ff2035b957Duncan Sands 498830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and 498930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// whether object offset >= 0. 499030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool 4991475871a144eb604ddaf37503397ba0941442e5fbDan GohmanIsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDValue Op) { 499230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isa<FrameIndexSDNode>(Op)) return false; 499330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 499430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op); 499530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer int FrameIdx = FrameIdxNode->getIndex(); 499630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return MFI->isFixedObjectIndex(FrameIdx) && 499730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MFI->getObjectOffset(FrameIdx) >= 0; 499830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 499930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 500030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could 500130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// possibly be overwritten when lowering the outgoing arguments in a tail 500230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// call. Currently the implementation of this call is very conservative and 500330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with 500430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// virtual registers would be overwritten by direct lowering. 5005475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic bool IsPossiblyOverwrittenArgumentOfTailCall(SDValue Op, 500630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo * MFI) { 500730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer RegisterSDNode * OpReg = NULL; 500830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS || 500930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode()== ISD::CopyFromReg && 501030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) && 501130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) || 501230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::LOAD && 501330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) || 501430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::MERGE_VALUES && 501530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD && 501630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo). 501730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getOperand(1)))) 501830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return true; 501930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return false; 502030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 502130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 5022c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 502348abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 5024c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 5025c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 5026c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 5027475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Terminator = DAG.getRoot(); 5028c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5029c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 5030c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 5031c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 5032c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5033c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5034c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 5035c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 50360e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman BI = DAG.allnodes_end(); BI != BE; ) { 50370e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman --BI; 5038c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 5039475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpRet(Ret, 0); 5040475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpCall(BI, 0); 5041c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 5042c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 5043c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 5044c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 504548abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 5046c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 504730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isMarkedTailCall) continue; 504830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Ret==NULL || 504930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) { 505030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Not eligible. Mark CALL node as non tail call. 5051475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5052c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 505330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 505430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5055c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 5056c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 505730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer else 5058c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 5059c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5060c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 506130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } else { 506230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Look for tail call clobbered arguments. Emit a series of 506330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // copyto/copyfrom virtual register nodes to protect them. 5064475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5065475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = OpCall.getOperand(0), InFlag; 506630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned idx=0; 506730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I = OpCall.Val->op_begin(), 506830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5069475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = *I; 507030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (idx > 4 && (idx % 2)) { 507130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))-> 507230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getArgFlags().isByVal(); 507330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFunction &MF = DAG.getMachineFunction(); 507430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo *MFI = MF.getFrameInfo(); 507530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isByVal && 507630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) { 507783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = Arg.getValueType(); 507830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned VReg = MF.getRegInfo(). 507930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer createVirtualRegister(TLI.getRegClassFor(VT)); 508030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag); 508130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Chain.getValue(1); 508230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag); 508330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = Arg.getValue(1); 508430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Arg.getValue(2); 508530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 508630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 508730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops.push_back(Arg); 508830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 508930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Link in chain of CopyTo/CopyFromReg. 509030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops[0] = Chain; 509130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 5092c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5093c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5094c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5095c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 5096c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5097068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 5098068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5099f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 51005eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GFI); 510178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman BB = FuncInfo.MBBMap[LLVMBB]; 510278eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman 510378eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 510478eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // FastISel doesn't currently support entry blocks, because that 510578eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // requires special handling for arguments. And it doesn't support EH 510678eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // landing pads, which also require special handling. 510778eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // For now, also exclude blocks with terminators that aren't 510878eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // unconditional branches. 51093e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman BasicBlock::iterator Begin = LLVMBB->begin(); 511078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman if (EnableFastISel && 511178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman LLVMBB != &LLVMBB->getParent()->getEntryBlock() && 511278eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman !BB->isLandingPad() && 511378eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman isa<BranchInst>(LLVMBB->getTerminator()) && 511478eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman cast<BranchInst>(LLVMBB->getTerminator())->isUnconditional()) { 511578eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman if (FastISel *F = TLI.createFastISel(BB, &FuncInfo.MF, 511678eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman TLI.getTargetMachine().getInstrInfo())) { 51173e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman Begin = F->SelectInstructions(Begin, LLVMBB->end(), FuncInfo.ValueMap); 51183e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman if (Begin == LLVMBB->end()) 511978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman // The "fast" selector selected the entire block, so we're done. 512078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman return; 512178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman 51223e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman if (!DisableFastISelAbort) { 51233e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman // The "fast" selector couldn't handle something and bailed. 51243e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman // For the purpose of debugging, just abort. 51253e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman DEBUG(Begin->dump()); 51263e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman assert(0 && "FastISel didn't select the entire block"); 51273e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman abort(); 51283e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman } 512978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman } 513078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman } 5131068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 5132bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 5133ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 513486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 51351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 51371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5138f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 51399fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 51401532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 5141f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 5142f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 5143f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 51444406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, DAG.getEntryNode(), LabelID)); 5145f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5146e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 5147e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 5148e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5149e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5150e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 5151e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 5152e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5153e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5154f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 5155f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 5156f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 5157f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 5158cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 5159cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 5160cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 5161cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 5162cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 5163cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 5164cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 5165f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 5166f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5167f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 5168f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 5169f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 5170cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 5171f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 5172f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5173f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 5174f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 5175f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 51769fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51779fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51789fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 51791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 51803e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman for (BasicBlock::iterator I = Begin, E = --LLVMBB->end(); 51811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 51821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 5183f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 51841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 5185f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 51863e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman for (BasicBlock::iterator I = Begin, E = LLVMBB->end(); I != E;++I) 5187f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 51889f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 51891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 519086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 51911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 51941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 51951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 51961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 51971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 51981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 5199edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 52008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 52011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 52031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 5204d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 52058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 52068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 52078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 52088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 52098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 5210532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 5211532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 52121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 52131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 5214d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 52158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 5216d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 52178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 52188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 52198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 52208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 52218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 52228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 52238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 52241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 52251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 52271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 52281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 52291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 52308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 52318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 52328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 52338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 52348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 52358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 52363f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 52378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 52388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 52398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 52408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 524186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 52421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 52448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 52458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 52468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 52478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 52488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 52498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 52508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 525186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 52527e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 52531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 52558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 52568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 52576f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 52586f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 52596f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 52606f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 52616f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 52626f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 52636f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 52646f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman Reg += NumRegisters; 52656f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 52668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 52671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 52691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 5271f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 5272a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 5273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 527437efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 5275f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 5276f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 52773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 52783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 52794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 52804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 52814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5282a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 528386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 5284c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5285c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 5286c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 5287c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 5288c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 5289c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 52901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5292ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnervoid SelectionDAGISel::ComputeLiveOutVRegInfo(SelectionDAG &DAG) { 5293ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 5294ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 5295ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5296ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(DAG.getRoot().Val); 5297ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5298ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 5299ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 5300ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 5301ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5302ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 5303ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 5304ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 5305ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5306ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 5307ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 5308ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5309ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5310ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 5311ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 5312ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOperand(i).getValueType() == MVT::Other) 5313ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(N->getOperand(i).Val); 5314ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5315ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 5316ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 5317ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5318ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5319ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 5320ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 5321ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5322ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5323ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 5324475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 5325ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT SrcVT = Src.getValueType(); 5326ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 5327ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5328ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5329ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = DAG.ComputeNumSignBits(Src); 5330ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 5331ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 5332ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5333ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 5334ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 5335ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 5336ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 5337ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (DestReg >= FLI.LiveOutRegInfo.size()) 5338ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FLI.LiveOutRegInfo.resize(DestReg+1); 5339ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg]; 5340ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 5341ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownOne = NumSignBits; 5342ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownZero = NumSignBits; 5343ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5344ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5345ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 5346ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5347f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 5348462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 5349462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 5350462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 5351462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 5352462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 5353462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 || ViewISelDAGs || ViewSchedDAGs || ViewSUnitDAGs) 5354462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BlockName = DAG.getMachineFunction().getFunction()->getName() + ':' + 5355462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BB->getBasicBlock()->getName(); 5356462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5357462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Initial selection DAG:\n"; 5358417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 5359462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5360462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1) DAG.viewGraph("dag-combine1 input for " + BlockName); 5361417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5362af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 5363ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53645e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 5365ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5366ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5367ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5368ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 53692300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5370417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 53711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5372f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 53731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 53741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 5375f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands if (EnableLegalizeTypes) {// Enable this some day. 5376462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewLegalizeTypesDAGs) DAG.viewGraph("legalize-types input for " + 5377462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BlockName); 5378462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5379462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 5380462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 5381462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DAG.LegalizeTypes(); 5382462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 5383462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DAG.LegalizeTypes(); 5384462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 5385462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5386462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Type-legalized selection DAG:\n"; 5387462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DEBUG(DAG.dump()); 5388462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 538970587ea813986bb0dbef71610091d496e28c22a6Chris Lattner // TODO: enable a dag combine pass here. 539070587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 5391f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 5392462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewLegalizeDAGs) DAG.viewGraph("legalize input for " + BlockName); 5393462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5394ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53955e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 5396ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5397ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5398ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5399ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5401832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 54021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5404462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine2) DAG.viewGraph("dag-combine2 input for " + BlockName); 5405462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5406af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 5407ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54085e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 5409ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5410ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5411ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5412ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 54132300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5414417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 5415417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 5416417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5417462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewISelDAGs) DAG.viewGraph("isel input for " + BlockName); 5418ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5419925a7e8ed6522f291b4ae559ccfa56db461016e3Dan Gohman if (!Fast && EnableValueProp) 5420ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner ComputeLiveOutVRegInfo(DAG); 5421552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 5422a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 5423a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 5424ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54255e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5426ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5427ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5428ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5429ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5430db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5431462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Selected selection DAG:\n"; 5432462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DEBUG(DAG.dump()); 5433462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5434462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSchedDAGs) DAG.viewGraph("scheduler input for " + BlockName); 5435462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 54365e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 54375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler; 54385e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54395e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 54405e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 54415e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 54425e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 54435e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54445e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5445462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 5446462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5447db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Emit machine code to BB. This can change 'BB' to the last block being 5448db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 5449ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54505e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 54515e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 5452ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 54535e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 54545e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54555e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 54565e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 54575e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54585e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 54595e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 54605e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 54615e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 5462ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5463db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5464db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Perform target specific isel post processing. 5465ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54665e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection Post Processing", GroupName); 5467462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman InstructionSelectPostProcessing(); 5468ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5469462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman InstructionSelectPostProcessing(); 5470ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5471f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5472832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 54731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 5474f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 5475f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 54760e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, MachineFunction &MF, 54770e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FunctionLoweringInfo &FuncInfo) { 5478fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman // Define NodeAllocator here so that memory allocation is reused for 54790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman // each basic block. 5480fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocatorType NodeAllocator; 54810e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5482381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng SimpleBBISel SISel(MF, TLI); 548339fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 548439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 548539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 548639fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng PHINodesToUpdate.clear(); 5487381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 5488925a7e8ed6522f291b4ae559ccfa56db461016e3Dan Gohman if (!Fast || !SISel.SelectBasicBlock(LLVMBB, FuncInfo.MBBMap[LLVMBB])) 5489381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng SelectBasicBlock(LLVMBB, MF, FuncInfo, PHINodesToUpdate, NodeAllocator); 549039fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng FinishBasicBlock(LLVMBB, MF, FuncInfo, PHINodesToUpdate, NodeAllocator); 549139fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 54920e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 54930e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5494fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 5495fed90b6d097d50881afb45e4d79f430db66dd741Dan GohmanSelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 5496fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman FunctionLoweringInfo &FuncInfo, 549739fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5498fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocatorType &NodeAllocator) { 549939fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng SelectionDAG DAG(TLI, MF, FuncInfo, 550039fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng getAnalysisToUpdate<MachineModuleInfo>(), 550139fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng NodeAllocator); 550239fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng CurDAG = &DAG; 5503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 550439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng // First step, lower LLVM code to some DAG. This DAG may use operations and 550539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng // types that are not supported by the target. 550639fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 55071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 550839fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng // Second step, emit the lowered DAG as machine code. 550939fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng CodeGenAndEmitDAG(DAG); 551039fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng} 55114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 551239fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Chengvoid 551339fd6e81b1b0de8b820155dc6a0dae226c109de6Evan ChengSelectionDAGISel::FinishBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 551439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng FunctionLoweringInfo &FuncInfo, 551539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 551639fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng NodeAllocatorType &NodeAllocator) { 55174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 55184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 55194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 55204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 55214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 5522f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5523a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 55241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 55254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 5526f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5527f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 5528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5529f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 55309ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 55319ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55329ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 55351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 55364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 55384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 55394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 5540ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 55410e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5542fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 55434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 55445eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GFI); 55454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 55474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 55484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 55494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 55504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 55514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 55524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 5555ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG BSDAG(TLI, MF, FuncInfo, 55560e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5557fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 55584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 55595eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GFI); 55604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 55624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 55634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 55644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 55654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 55664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 55694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 55704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 55754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 55764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 55794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 55804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 55814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 55824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 55834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 55844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 55854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 55864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 55879ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55889ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55899ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 55909ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55919ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55929ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 55939ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 55944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 55964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 55974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 55984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 55994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 56009ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56019ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56029ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 56034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 56089453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 56099453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 56109453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 56113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 56123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 56133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 5614ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 56150e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5616fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 56173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 56185eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GFI); 56193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 56203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 56213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 56223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 56233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 56243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 56253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 56264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 5628ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG JSDAG(TLI, MF, FuncInfo, 56290e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5630fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 56313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 56325eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GFI); 563337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 56343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 56353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 563637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 56373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 56383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 56393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 56403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 564137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 564237efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 564337efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 564437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 564537efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 564637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 56474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 56483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 56499ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56509ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56519ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 5652f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 56534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 5654f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 56559ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56569ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56579ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 565837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 565937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 566037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 566137efe6764568a3829fee26aba532283131d1a104Nate Begeman 5662b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5663b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 5664b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5665b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 5666b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5667b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5668b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 56699ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 56709ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56719ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5672b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5673b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5674b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5675f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5676f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 5677d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 5678ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG SDAG(TLI, MF, FuncInfo, 56790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5680fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 5681f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 56825eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GFI); 5683d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5684f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 5685f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 5686f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 5687d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5688f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 5689f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 5690f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 5691f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 5692d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5693d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5694d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5695d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5696d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 569757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5698d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5699d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5700d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5701d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5702d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5703d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 57049ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 57059ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 57069ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5707d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5708d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5709d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5710f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5711d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5712d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 571357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 571457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5715d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5716d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 57172452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 571857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5719f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 572057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5721a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 57221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5723a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 572413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 57255e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// Schedule - Pick a safe ordering for instructions for each 5726a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 57275e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 57285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan GohmanScheduleDAG *SelectionDAGISel::Schedule(SelectionDAG &DAG) { 5729eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 573013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 573113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5732eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 57339373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 57344ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 573513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5736925a7e8ed6522f291b4ae559ccfa56db461016e3Dan Gohman ScheduleDAG *Scheduler = Ctor(this, &DAG, BB, Fast); 57375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler->Run(); 57383e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 57395e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman return Scheduler; 5740a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 57410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 574203fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 57439ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 57449ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 57459ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 57469ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5747755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5748755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5749755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5750755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5751755480681c795d585c73556c028b6143c46bda86Chris Lattner 5752755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5753755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5754755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5755755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5756475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 5757dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 57582e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 57592e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5760755480681c795d585c73556c028b6143c46bda86Chris Lattner 5761755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5762755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5763755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5764755480681c795d585c73556c028b6143c46bda86Chris Lattner 5765755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 57662e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5767755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5768755480681c795d585c73556c028b6143c46bda86Chris Lattner 5769755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5770755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 57712e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5772ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5773755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5774755480681c795d585c73556c028b6143c46bda86Chris Lattner 5775755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5776755480681c795d585c73556c028b6143c46bda86Chris Lattner 5777755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5778755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5779755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5780755480681c795d585c73556c028b6143c46bda86Chris Lattner 5781755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5782755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5783755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5784755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5785475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 57862e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 57872e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 57882e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5789755480681c795d585c73556c028b6143c46bda86Chris Lattner 5790755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5791755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5792755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5793755480681c795d585c73556c028b6143c46bda86Chris Lattner 5794755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 57952e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5796755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5797755480681c795d585c73556c028b6143c46bda86Chris Lattner 5798755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5799755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 58002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5801755480681c795d585c73556c028b6143c46bda86Chris Lattner 58022e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5803ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5804755480681c795d585c73556c028b6143c46bda86Chris Lattner 5805755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5806755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5807755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5808755480681c795d585c73556c028b6143c46bda86Chris Lattner 5809755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5810755480681c795d585c73556c028b6143c46bda86Chris Lattner 5811755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5812755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5813755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5814755480681c795d585c73556c028b6143c46bda86Chris Lattner 58159ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 58160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 58170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 58180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 5819475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops, SelectionDAG &DAG) { 5820475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 58210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 58220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 58240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 58250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 58270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 58280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 58290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 58310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 58320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 58330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 58340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 58350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 58360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 58370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 58380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 5839475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 58400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5841832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 58420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 58430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 584683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 584736d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 58484b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 58490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 58500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 58510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 58550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 58560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 58570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5858794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 58591997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5860