SelectionDAGISel.cpp revision 1a6acc214dc066ea08365b605e109203e9164068
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 51c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This file was developed by the LLVM research group and is distributed under 61c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 16c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 2844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey#include "llvm/CodeGen/MachineModuleInfo.h" 291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3137efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 33eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 36fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 42124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 45a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 467e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 507944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 51a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 52a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 53a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 54a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 55a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 567944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 575e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 587944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 60eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 61eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 62eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 63eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 724ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 7513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 763700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 7713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 7813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 799ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 809373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 819373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 824ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 834ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 84864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 85864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 86864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 87864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 88864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 899525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 90864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 91864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 92864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 93864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 94864635ad7b3046d3042311423071152c613961deChris Lattner 95864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 96864635ad7b3046d3042311423071152c613961deChris Lattner /// 97864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 98864635ad7b3046d3042311423071152c613961deChris Lattner 99864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 100864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 101864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 102864635ad7b3046d3042311423071152c613961deChris Lattner 103864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 104864635ad7b3046d3042311423071152c613961deChris Lattner 105864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 106864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 107864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 108864635ad7b3046d3042311423071152c613961deChris Lattner } 109864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 110864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 111864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 112864635ad7b3046d3042311423071152c613961deChris Lattner } 113864635ad7b3046d3042311423071152c613961deChris Lattner 114864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 115864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 116864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 117864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1189f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 119c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 120c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 121c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 124a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 125a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 127c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1319f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 132864635ad7b3046d3042311423071152c613961deChris Lattner }; 133864635ad7b3046d3042311423071152c613961deChris Lattner} 1344ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1379373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1389373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1399373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 157f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 158f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1729f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 182571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 188edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1893c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1903c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 200f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 201f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 206f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 207571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 208f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 213bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 214f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 215f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 216bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 217bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 218bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 219f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 222bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 225edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 228bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 229bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 23016ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 23116ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 232bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 233bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 235bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 237bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2382aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 241b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 243a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 244ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 245d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 246ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 247a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 248b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 249d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 251f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2542aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2552aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2642aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 2778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 2788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 2798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 2808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 2818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 2829d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 2838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 284f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 287c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 2888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 289c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 2908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2943c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2953c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 304ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, figure out what type it will decompose into 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3079d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(V->getType()); 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3176cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3186cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3196cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3206cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3293c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3399f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng VT = TLI.getTypeToExpandTo(VT); 3409f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned R = MakeReg(VT); 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3429f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MakeReg(VT); 3433c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3443c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3550da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 357d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 358d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 359d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 360d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 361d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 362d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 400b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 401b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 4025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov bool operator () (const Case& C1, 4075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const Case& C2) { 4085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 413f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 414f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 417f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 424a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 426f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 427f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 432f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 438edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 443a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 444a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 445a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 446d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 447d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 448edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 450d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 451d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 452d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 453d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 454d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 455d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 456d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 457bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 458bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 459d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 460d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 461d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 462a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 463a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 464571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 465571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4691e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4701e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 484466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 48528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 491199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4930da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 4941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4960da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 499864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 500864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 501864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 502864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 503864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 504f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 505571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 506571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 507571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 509571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5101da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 5111da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 5121da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, SDOperand Callee, unsigned OpIdx); 513735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 517f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 521dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 525dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 527b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 528b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 529dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 53437efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 537f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 539b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 540183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey void visitInvoke(InvokeInst &I, bool AsTerminator); 541b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitScalarBinary(User &I, unsigned OpCode); 54424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitVectorBinary(User &I, unsigned OpCode); 54524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitEitherBinary(User &I, unsigned ScalarOp, unsigned VectorOp); 546e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5475fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5489d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 54924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VADD); 55024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 55124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FADD); 5521628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 55324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::ADD); 55401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 555b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5561628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5579d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 55824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VMUL); 55924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 56024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FMUL); 5611628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 56224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::MUL); 5631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 56424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitURem(User &I) { visitScalarBinary(I, ISD::UREM); } 56524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSRem(User &I) { visitScalarBinary(I, ISD::SREM); } 56624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFRem(User &I) { visitScalarBinary(I, ISD::FREM); } 56724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitUDiv(User &I) { visitEitherBinary(I, ISD::UDIV, ISD::VUDIV); } 56824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSDiv(User &I) { visitEitherBinary(I, ISD::SDIV, ISD::VSDIV); } 56924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFDiv(User &I) { visitEitherBinary(I, ISD::FDIV, ISD::VSDIV); } 57024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitAnd (User &I) { visitEitherBinary(I, ISD::AND, ISD::VAND ); } 57124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitOr (User &I) { visitEitherBinary(I, ISD::OR, ISD::VOR ); } 57224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitXor (User &I) { visitEitherBinary(I, ISD::XOR, ISD::VXOR ); } 57324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5743822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5753822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 57645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 57745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 5783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5922bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5932bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5943e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 595c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 6001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 606ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 607c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6080eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6157041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 628199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 629199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 630199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 631199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 632199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 633199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 634199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 635199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 636199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 6370da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 6380da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 6390da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 640199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 641199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 642199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 643199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 644199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 6459d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 64623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 64723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 648b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 6499d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 65023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 65123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 65223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 653bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 65423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 65523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 65623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 65723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 65823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 659bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, 660bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 661199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 662199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 6639d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 665199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 666199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 667199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 668199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 669199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 670bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 6719d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 6722bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6732bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 674199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 675199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 676199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 677199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 678199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 679199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 680199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 681199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 682199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 683199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 684b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 68523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 68623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 6870da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return NodeMap[V] = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], 6880da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 689199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 690199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 6916b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 692199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 693199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 694199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 695199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 696199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 697199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 698199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 699199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 700199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 701199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 702251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 703251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 70670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 7079f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Expand) { 70870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 709251db1890c1fe03d02ee878ada8129537844d031Chris Lattner // register pair InReg and InReg+1. 7109f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToExpandTo(VT); 7119f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(VT); 7129f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7139f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 7149f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BIT_CONVERT, VT, N); 7159f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng else { 7169f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 7179f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 7189f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 7199f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } 7209f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else { 7219f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 7229f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7239f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Promote) // Promotion case 7249f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = MVT::isFloatingPoint(VT) 7259f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng ? DAG.getNode(ISD::FP_ROUND, VT, N) 7269f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng : DAG.getNode(ISD::TRUNCATE, VT, N); 727199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 72870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 72970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 73070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 73170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 7329d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 7339d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(PTy, PTyElementVT, 73470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 73570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 73670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 737bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 73870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 73970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 74070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 74170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 74270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 74370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 74470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 74570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 74670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 74770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 74870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 74970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 75070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 75170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 75270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 75370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 75470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 75570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 75670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 75770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 75870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 75970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 76070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 76170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 76270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 76370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 76470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 76570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 76670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 76770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 768bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size()); 7692e2ef9535070bb352601482cceac1140c1158cddChris Lattner 7702e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7712e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7722e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7732e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7742e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7752e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 776199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 777199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 778199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 779199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 780199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 781199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 784a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 787bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 788ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 789ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 790ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 791ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 792ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 793ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 794ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7958e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7968e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 797ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 798ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 799ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 800ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 801ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 802ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 803ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 80447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 805bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 8068c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer if (FTy->paramHasAttr(0, FunctionType::SExtAttribute)) 8078c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 80847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer if (FTy->paramHasAttr(0, FunctionType::ZExtAttribute)) 80947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 810376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 811ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 812ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 81347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer NewValues.push_back(DAG.getConstant(false, MVT::i32)); 8141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 815bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 816bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 8171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 8181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 819571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 820571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 821571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 822571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 823571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 824571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 825571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 826571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 827571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 828571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 829571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 830571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 831571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 832571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 8348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 8358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 8368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 8378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 8388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 8398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 8408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 8438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 8478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 8488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 8498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 8508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 8538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 8578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 8598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8606a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 8616a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 8626a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 8636a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 8646a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 8656a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 866571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 867571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 868571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 869571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 870571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 871571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 872571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 873e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 874571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 875e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 876e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 8776a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 8786a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 8796a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 880571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 881571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 882e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 883e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 884e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 885e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 8865a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 8875a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 8885a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 8895a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 8905a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 891e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 892e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 893e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 894e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 895e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 896e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 897e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 898e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 899e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 900e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 901e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 902e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 903e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 904e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 905e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 906e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 907e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 908e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 909e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 910e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 911e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 912e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 913e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 914e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 915e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 916e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 917e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 918e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 919e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 920e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 921e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 922e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 923e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 924e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 925e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 926e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 927e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 928e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 929e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 930e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 931e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 932e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 9330da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 934e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 935571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 936571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 937571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 9385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 939571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 940571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 941571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 942571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 943571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 9446b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 9455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 946571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 947571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 948571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 949571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 950d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 951d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 952571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 953571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 954571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 955571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 956d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 957d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 958d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 959d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 960d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 961d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 962d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 963d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 965d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 966d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 967d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 968d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 969d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 970d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 971d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 972d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 973d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 974d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 975d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 976d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 977d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 978d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 979d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 980d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 981d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 982d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 983d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 984d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 985d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 986d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 987571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 988571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 989df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 990df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 991df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 992df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 993df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 994df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 995df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 9960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 9970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 9980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 9990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 10000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 10010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 10020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 10030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 10040ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1005df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1006df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1007df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 10091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 10101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 10111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 10131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 10141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 10151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 10161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 10171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 10191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 10201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1021a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1022dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 102357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 102557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 102657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 102857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 102957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 103057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 103157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 103257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 103357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1034571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1035571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1036571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1037571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1038571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1039571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1040571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1041571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1042571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1043571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1044571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1045571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1046571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1047571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1048571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1049571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1050571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1051571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1052d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1053571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1054571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 10550ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 10560ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 10570ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 10580ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 10590ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1060df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1061df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1062df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1063df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1064df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1065df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1066df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1067df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1068df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1069df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1070df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 10715a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 10725a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 10730ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 10740ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 10750ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 10760ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 10770ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1078df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1079571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1080571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 10812452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 10822452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 10836b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 10845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 10852452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 10862452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 10872452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 10881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 10891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1090f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1091f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1092f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 109357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 109457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 109557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 10965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 10975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 10985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 10995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 11005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 11015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 11025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 11035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 11045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 11055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 11065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 11075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 11095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 11115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 11125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 11145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 11153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 11175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 11185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 11205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 11215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 11225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1126f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1127f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1128f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1129f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1130f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1131f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1132f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1133f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1134f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 113557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 113657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1137f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1138f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1139f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1140f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 114157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 114257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1143f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1144f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1145f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 114657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1147f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 114857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 114957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1150f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1151f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 11523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 115337efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 115437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 11553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov assert(JT.Reg != -1UL && "Should lower JT Header first!"); 115637efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 11573d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 11583d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 11593d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 11603d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 11613d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 116237efe6764568a3829fee26aba532283131d1a104Nate Begeman} 116337efe6764568a3829fee26aba532283131d1a104Nate Begeman 11643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 11653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 11663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 11673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 11683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 11693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 11703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 11713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 11723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 11733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 11743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 11753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 11773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 11783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 11793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 11803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 11813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (VT > TLI.getPointerTy()) 11823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 11833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 11843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 11853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 11873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 11883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 11893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 11913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 11923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 11933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 11943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 11953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 11963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 11983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 11993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 12033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 12053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 12063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 12083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 12093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 12103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 12113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 12123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 12133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1215b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1216183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey assert(0 && "Should never be visited directly"); 1217183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey} 1218183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I, bool AsTerminator) { 1219b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1220b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1221b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 1222b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1223183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (!AsTerminator) { 1224183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Mark landing pad so that it doesn't get deleted in branch folding. 1225183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey LandingPad->setIsLandingPad(); 1226183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1227183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Insert a label before the invoke call to mark the try range. 1228183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // This can be used to detect deletion of the invoke via the 1229183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // MachineModuleInfo. 1230183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 1231183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey unsigned BeginLabel = MMI->NextLabelID(); 1232183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 1233183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getConstant(BeginLabel, MVT::i32))); 1234183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1235183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 1236183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey I.getCallingConv(), 1237183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey false, 1238183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey getValue(I.getOperand(0)), 1239183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 3); 1240183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1241183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Insert a label before the invoke call to mark the try range. 1242183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // This can be used to detect deletion of the invoke via the 1243183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // MachineModuleInfo. 1244183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey unsigned EndLabel = MMI->NextLabelID(); 1245183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 1246183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getConstant(EndLabel, MVT::i32))); 1247183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1248183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Inform MachineModuleInfo of range. 1249183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 1250183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1251183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Update successor info 1252183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey CurMBB->addSuccessor(Return); 1253183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey CurMBB->addSuccessor(LandingPad); 1254183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } else { 1255183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Drop into normal successor. 1256183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1257183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getBasicBlock(Return))); 1258183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } 1259b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1260b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1261b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1262b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1263b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 12645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1265b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1266dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1267b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1268b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1269b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1270dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1271dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1272dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1273dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1274dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (Size >=3) 1275dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 12765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1277b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1278b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1279b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1280b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1281b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1282b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1283b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1284b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1285b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1286b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1287b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1288b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1289b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1290b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1291b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1292b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1293b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 12945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1295b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1296b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1297b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 12985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1299b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1300b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1301b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1302b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1303b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1304b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1305b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1306b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1307b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1308b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1309b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1310b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1311b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1312b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1313b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1314b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1315b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1316b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1317b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 13185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 13195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 13205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 13215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 13225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 13235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 13245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 13255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 13265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 13275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 13285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 13295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 13305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1331b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1332b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1333b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1334b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1335b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1336b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1337b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1338b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1339b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1340b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1341b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1342b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1343dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1344dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1345b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1346b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1347b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1348dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1349b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1350b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1351b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1352dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1353dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1354dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1355dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1356dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1357dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 13595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 13605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 13615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 13625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 13635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 13645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1365dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1366dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if ((!TLI.isOperationLegal(ISD::BR_JT, MVT::Other) && 1367dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov !TLI.isOperationLegal(ISD::BRIND, MVT::Other)) || 1368dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Size <= 5) 1369dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1370dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 13725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1373dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1374dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 13765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 13775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n"; 13785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1379b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1380b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1381dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1382b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1383b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1384b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1385b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1386b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1387b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1388b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1389b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1390b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1391b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1392b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1393b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1394b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1395b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1396b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1397b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1398b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1399b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1400b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1401b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 1402b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1403b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1404b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1405b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1406b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 14075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 14085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 14095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 14105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 14125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 14135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 14145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1415b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1416b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1417b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 14185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1419b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1420b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 14215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1422b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1423b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1424b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1425b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1426b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1427b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1428b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1429b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1430b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1431b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1432b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1433b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1434b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1435b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1436b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTable JT(-1UL, JTI, JumpTableBB, Default); 1437b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1438b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1439b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1440b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1441b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1442b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1443b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1444dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1445b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1446b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1447b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1448b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1449dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1450b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1451b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1452b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1453b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1454b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1455b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1456b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1457b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1458b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1459b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1460b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1461b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1462b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1463b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1464b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1465b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1466b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1467b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1468b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1469b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1470b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 14715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 14725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 1473b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double Density = 0; 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1475b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1476b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1477b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 14785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 14795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 14805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 14815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 14825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 14845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 1485b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 14865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 14875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 14885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 1489b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 1491b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (Density < (LDensity + RDensity)) { 1492b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Density = LDensity + RDensity; 1494b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 14955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 14975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 15025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1504b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1506b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1507b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1508b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1509b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 15125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 15135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 15145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 15155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 15275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 15285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 15295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1533b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1534b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1535b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 15395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 15405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1546dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1547dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 15515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 15525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 15535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 15545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 15565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 15575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 15585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 15595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 15605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 15615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 15635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 15655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 15665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), J=++(Cases.begin()), E=Cases.end(); J!=E; ) { 15675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 15685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 15695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 15705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 15715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 15735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 15745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 15755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 15765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 15775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 15795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 15835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 15845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 15855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 15865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 15895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1592f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1593f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1595c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 15965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1597d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1598f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1599f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1601f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1602c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1603f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1604d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1605f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1606d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1607c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1608d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1609f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1610f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1611f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1612f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1613f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1614f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 16155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 16165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 16175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 16185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1619c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1620f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1622f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 16235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 162437efe6764568a3829fee26aba532283131d1a104Nate Begeman 16253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1626b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 16273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 16283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 16303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 16313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 16323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 16333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 16353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1636dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1637dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1638dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 16393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the switch has more than 5 blocks, and at least 31.25% dense, and the 16403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 16413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1642dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1643dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1644dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1645dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 1646dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 1647dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 1648f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1649f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1650f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 16513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1652b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1653b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 165424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 16559d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 165624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VSUB); 165724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer } else if (Ty->isFloatingPoint()) { 165801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 165901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 166001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 166101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 166201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 166301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 166424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FSUB); 16651628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else 166624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::SUB); 1667b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1668b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 166924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitScalarBinary(User &I, unsigned OpCode) { 16701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 16711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 167224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 167324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 16741628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 16751628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 167624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid 167724d6da5fedcf39891f7d8c5b031c01324b3db545Reid SpencerSelectionDAGLowering::visitVectorBinary(User &I, unsigned OpCode) { 16789d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer assert(isa<VectorType>(I.getType())); 16799d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *Ty = cast<VectorType>(I.getType()); 168024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer SDOperand Typ = DAG.getValueType(TLI.getValueType(Ty->getElementType())); 168124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 168224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, MVT::Vector, 168324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(0)), 168424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(1)), 168524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer DAG.getConstant(Ty->getNumElements(), MVT::i32), 168624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer Typ)); 168724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer} 16881628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 168924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitEitherBinary(User &I, unsigned ScalarOp, 169024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer unsigned VectorOp) { 16919d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 169224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, VectorOp); 169324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else 169424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ScalarOp); 1695e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 16962c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1697e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1698e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1699e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1700e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1701832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer if (TLI.getShiftAmountTy() < Op2.getValueType()) 1702832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 1703832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 1704832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1705e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 17061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 17071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 170945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 1710e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 1711e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 1712e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 1713e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 1714e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 1715e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1716e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 171745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 1718e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 171945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 172045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 172145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 172245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 172345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 172445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 172545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 172645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 172745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 172845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 172945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 173045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 173145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 173245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 173345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 173445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 173545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 173645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 173745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 1738e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 1739e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 1740e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 1741e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 1742e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 1743e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1744e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 1745e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 1746e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 1747e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1748e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1749e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1750e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1751e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1752e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1753e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1754e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1755e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1756e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1757e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1758e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1759e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1760e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1761e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1762e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 176345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 176445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 1765e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 176645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 176745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 1768e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1769e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1770e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1771e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1772e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 17731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 17761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 17771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 17781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 17799d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(I.getType())) { 1780b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1781b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1782b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1783b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1784b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1785b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1786b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 17871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 17903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 17913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 17923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 17933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 17943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 17953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 17963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 17973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 17983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 17993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 18003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 18033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 18063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 18073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 18083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 18113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 18143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 18153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 18183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 18213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 18223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 18253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 18283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 18293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 18323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 18353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 18363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 18393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 18423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 18433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 18463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 18493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 18503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 18533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 18563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 18573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 18581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1859e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 186028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 18623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 18633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 18643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 18653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 18663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 18673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 18683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 18713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 18723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 18733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 18753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 18763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 18773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 18783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 18793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 18803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 18813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 18823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 18833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 18843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 18853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 1886e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 18873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast to a vector from something else. 18883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the output vector. 18899d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 1890e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1891e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1892e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1893e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 18943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 18953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer } 18963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 18973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (SrcVT == MVT::Vector) { 18983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast from a vctor to something else. 18993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the input vector. 1900e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 19013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 19021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 19033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 19053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 19063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 19073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 19083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 19093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 19101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 19111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 19122bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1913c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1914c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1915c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1916c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1917c7029805ef35ce9805931067b841e6af11db382eChris Lattner 19182332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 19192332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 19202332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 19212332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1922c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1923c7029805ef35ce9805931067b841e6af11db382eChris Lattner 19242bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1925384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1926384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1927384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1928384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1929384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1930384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1931384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1932c7029805ef35ce9805931067b841e6af11db382eChris Lattner 19333e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 19343e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 19353e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 19363e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 19373e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 19383e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 19393e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 19403e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 19413e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 19423e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 19433e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 19443e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 19451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 19461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 19471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 19481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 19491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 19501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 19511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1952c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 1953b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 19541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 19551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1956b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 19571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1958dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 19591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 19601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 19611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 19621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 19637c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 19647c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 19657c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 1966b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 196747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 19680d630d220414b02fed6873555bb46795a682174bEvan Cheng TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 19697c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 19707c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 19717c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 19727c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 19737c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1974a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 19757c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 19767c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 19777c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 19787c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 19797c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 198047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 19817c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 19827c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 19837c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 19847c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 19857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 19867c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 19877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 19887c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 19896b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 19901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 19917c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 19921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 19937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 19947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 19957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 19967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 19971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 19981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 19991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 20001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 20031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 20041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 20051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 20061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 20071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2009a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 201058092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2011d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 201258092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 20131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 201568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 201668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 201768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 201868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 201968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 20201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 202168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 20221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 20231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 20251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 20261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 20271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 20281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 20291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 20301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 20311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 20321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 20331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 20341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 20351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 20361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 20371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 20381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 20391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2040bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2041f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2042f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2043f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 20440da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 20450da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 20461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 20481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 20491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 20501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 20531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2054edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2055d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2056d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2057d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2058d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2059d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2060d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2061d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 206228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2063466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 206428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 206528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 206628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 206728b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2068466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 206928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 20705fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 20719d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) { 20724ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 2073466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, 2074466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng DAG.getSrcValue(SV)); 20755fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 20760b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, isVolatile); 20775fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 2078d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 207928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2080d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2081d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2082d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 208328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 208428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 20851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 20891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 20901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 20911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 20920b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 20938b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.isVolatile())); 20941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20960eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 20970eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 20980eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 20990eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 21000eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 21010eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 21020eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 21030eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 21040eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2105e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2106e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2107e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2108e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2109e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2110e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2111e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2112e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2113e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 21140eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 21150eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 21160eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 21170eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 21187255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2119e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 21200eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21210eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2122bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2123e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2124e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2125e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2126e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2127e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2128e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2129e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2130e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 21310eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21320eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 21330eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 21340eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21350eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 21360eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 21370eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 21380eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2139ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, force it to the right vector type. 21400eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 21419d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *OpTy = cast<VectorType>(I.getOperand(i)->getType()); 21420eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 21430eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21440eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 21450eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 21460eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 21470eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 21480eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21490eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 21500eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 21510eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 21520eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 21530eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21540eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 21550eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 21560eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 21570eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 21589d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 21590eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 21600eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21610eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 21620eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 21630eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 21640eade319cdb72e24c11d068728a98083737c6435Chris Lattner 21650eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 21660eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 21670eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 21680eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 21690eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 21700eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2171f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2172f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 21730eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 217448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 217548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2176f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2177f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 217848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2179f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2180f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 218148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2182f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2183f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 218448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2185e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2186e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2187e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2188e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2189e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2190e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2191e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 21920eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 21939d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 21940eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 21950eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 21960eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 21970eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 21980eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 21990eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 22000eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22010eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 22020eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2203c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2204c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2205c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2206c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2207c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2208c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 22090eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 22100eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 22110eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 22120eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2213c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2214c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2215c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2216bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2217bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2218bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2219bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2220bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2221bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2222bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2223bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2224c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2225d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2226c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2227c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2228d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2229c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 223003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 223103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 223203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 223303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 223403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 223503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 223603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 223703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 223803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 223903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 224003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 224103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2242c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 224386cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 224444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 224543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 224644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2247bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 224836ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2249bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2250bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2251bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2252ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 225344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2254ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 225543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 225643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2257bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2258bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2259ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2260bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 226186cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 226243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2263b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 226436ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 226543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 226644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 226743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 226844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 226944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 22701ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2271bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 227243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 227343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2274b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 227543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 227643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 227744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 227843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 227944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 228044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 22811ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2282bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 228343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 228443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2285b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 228643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 228743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 228844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 228943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 229044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 229144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 229244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 22931ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2294bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 229543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 229643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2297b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 229843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 229943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 230044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 230143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 230244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 23030892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2304bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 230544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 230643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 230743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 230843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 230943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2310c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2311b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2312b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2313b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2314735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2315735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Add a label to mark the beginning of the landing pad. Deletion of the 2316735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // landing pad can thus be detected via the MachineModuleInfo. 2317735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned LabelID = MMI->addLandingPad(CurMBB); 2318735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 2319735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.getConstant(LabelID, MVT::i32))); 2320735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2321735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception register as live in. 2322735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionAddressRegister(); 2323735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 2324735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2325735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2326735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2327735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2328735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2329735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2330735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2331735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 23327a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 233364ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2334735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2335b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2336b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2337b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 23380b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_selector: 23390b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_filter:{ 2340b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2341b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2342735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2343735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Inform the MachineModuleInfo of the personality for this landing pad. 2344cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(2)); 2345cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CE && CE->getOpcode() == Instruction::BitCast && 2346cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<Function>(CE->getOperand(0)) && 2347cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "Personality should be a function"); 2348cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey MMI->addPersonality(CurMBB, cast<Function>(CE->getOperand(0))); 23490b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey if (Intrinsic == Intrinsic::eh_filter) 23500b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey MMI->setIsFilterLandingPad(CurMBB); 2351b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2352735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Gather all the type infos for this landing pad and pass them along to 2353735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // MachineModuleInfo. 2354735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::vector<GlobalVariable *> TyInfo; 2355735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = 3, N = I.getNumOperands(); i < N; ++i) { 2356cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i)); 2357cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey if (CE && CE->getOpcode() == Instruction::BitCast && 2358cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<GlobalVariable>(CE->getOperand(0))) { 2359cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey TyInfo.push_back(cast<GlobalVariable>(CE->getOperand(0))); 2360cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey } else { 2361cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i)); 2362cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CI && CI->getZExtValue() == 0 && 2363cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "TypeInfo must be a global variable typeinfo or NULL"); 2364cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey TyInfo.push_back(NULL); 2365735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2366735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2367735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey MMI->addCatchTypeInfo(CurMBB, TyInfo); 2368735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2369735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception selector register as live in. 2370735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionSelectorRegister(); 2371735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 2372735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2373735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 237464ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey SDVTList VTs = DAG.getVTList(MVT::i32, MVT::Other); 2375735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2376735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2377735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2378735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2379735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2380735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 23817a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 238264ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2383b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2384b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2385b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2386b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2387b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2388b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_typeid_for: { 2389b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2390735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2391735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2392735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2393735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey GlobalVariable *GV = NULL; 2394cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(1)); 2395cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey if (CE && CE->getOpcode() == Instruction::BitCast && 2396cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<GlobalVariable>(CE->getOperand(0))) { 2397cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey GV = cast<GlobalVariable>(CE->getOperand(0)); 2398cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey } else { 2399cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(1)); 2400cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CI && CI->getZExtValue() == 0 && 2401cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "TypeInfo must be a global variable typeinfo or NULL"); 2402cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey GV = NULL; 2403b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2404735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2405735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 2406735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, DAG.getConstant(TypeID, MVT::i32)); 24077a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 24087a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2409b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2410b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2411b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2412b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2413b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 24140b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 24150b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2416c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2417c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2418c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2419c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 24206ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 24216ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 24226ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 24236ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 24246ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 24256ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 24266ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2427c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2428c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2429c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2430c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2431c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 24328b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2433bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2434f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2435f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2436f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 24378b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 24388b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 243951b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 24408b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2441addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer case Intrinsic::bit_part_select: { 24423f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 24433f108cb5558a80a63711114d819358f19773c057Reid Spencer assert(0 && "bit_part_select intrinsic not implemented"); 24443f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 2445addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 2446a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 2447d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2448d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2449d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2450d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 2451a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 2452a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2453a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2454a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 2455a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2456a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2457a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2458a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2459a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2460c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2461a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2462a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 2463a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2464a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2465a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 2466a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2467a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2468a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2469a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2470a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2471c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2472a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2473a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 2474a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2475a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2476a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 2477a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2478a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2479a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2480a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2481a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2482c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2483a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2484140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2485bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2486f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2487f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2488140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2489140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2490140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2491140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 249239a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 249339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 249439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2495140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 249639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2497ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2498ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2499ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 2500c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2501c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2502c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2503c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 25041da20a71d1bbabc472f281208be77475550be751Jim Laskeyvoid SelectionDAGLowering::LowerCallTo(Instruction &I, 25051da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, 25061da20a71d1bbabc472f281208be77475550be751Jim Laskey unsigned CallingConv, 25071da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2508735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Callee, unsigned OpIdx) { 25091da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2510735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 2511735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2512735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2513735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2514735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2515735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2516735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2517735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2518735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 2519d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Entry.isSExt = FTy->paramHasAttr(i, FunctionType::SExtAttribute); 2520d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Entry.isZExt = FTy->paramHasAttr(i, FunctionType::ZExtAttribute); 2521735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.isInReg = FTy->paramHasAttr(i, FunctionType::InRegAttribute); 2522735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.isSRet = FTy->paramHasAttr(i, FunctionType::StructRetAttribute); 2523735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2524735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2525735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2526735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2527735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 2528735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey FTy->paramHasAttr(0,FunctionType::SExtAttribute), 25291da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2530735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2531735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2532735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2533735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2534735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2535735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2536735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 25371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 253864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2539c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 25405cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (F->isDeclaration()) 2541c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2542c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2543c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2544c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2545c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2546c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2547a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2548a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2549a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2550a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2551a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2552a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2553a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2554a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2555a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2556a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2557a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2558a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2559c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2560c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2561c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2562c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2563c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2564c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2565c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2566c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2567f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2568f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 256906a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2570c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2571f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2572f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2573f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2574c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2575f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2576f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 257706a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2578c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2579f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2580f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2581f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2582f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2583c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2584ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2585ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2586ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2587c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2588edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 258964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 259064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 259164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 259264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 259364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 2594735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 25951da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 25961da20a71d1bbabc472f281208be77475550be751Jim Laskey I.getCallingConv(), 25971da20a71d1bbabc472f281208be77475550be751Jim Laskey I.isTailCall(), 25981da20a71d1bbabc472f281208be77475550be751Jim Laskey Callee, 25991da20a71d1bbabc472f281208be77475550be751Jim Laskey 1); 26001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2602735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2603864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 26049f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 2605864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 2606864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 2607864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 2608864635ad7b3046d3042311423071152c613961deChris Lattner 2609864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 2610864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 2611864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 2612864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 2613864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 2614693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Chain = Hi.getValue(1); 2615693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Flag = Hi.getValue(2); 26169f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 26179f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 26189f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 26199f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 2620864635ad7b3046d3042311423071152c613961deChris Lattner } 2621864635ad7b3046d3042311423071152c613961deChris Lattner 2622cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 2623864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 2624864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 2625864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 2626864635ad7b3046d3042311423071152c613961deChris Lattner 26275df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 26285df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(ValueVT == MVT::Vector && "Unknown vector conversion!"); 26295df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Val, 26305df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner DAG.getConstant(MVT::getVectorNumElements(RegVT), 26315df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner MVT::i32), 26325df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner DAG.getValueType(MVT::getVectorBaseType(RegVT))); 26335df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner } 26345df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 2635cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 2636cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 2637cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2638cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 2639cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2640cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 26415df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 26425df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(MVT::isFloatingPoint(RegVT) && MVT::isFloatingPoint(ValueVT)); 26435df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2644864635ad7b3046d3042311423071152c613961deChris Lattner} 2645864635ad7b3046d3042311423071152c613961deChris Lattner 2646c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2647c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 2648c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 2649c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2650a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 2651a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 2652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 2653c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 2654c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2655c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 26565df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 26575df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(Val.getValueType() == MVT::Vector &&"Not a vector-vector cast?"); 26585df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner Val = DAG.getNode(ISD::VBIT_CONVERT, RegVT, Val); 26591a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isInteger(RegVT) && MVT::isInteger(Val.getValueType())) { 26600c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 26610c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 26620c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 26630c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 26641a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isFloatingPoint(RegVT) && 26651a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::isFloatingPoint(Val.getValueType())) { 2666c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 26671a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::getSizeInBits(RegVT) == 26681a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::getSizeInBits(Val.getValueType())) { 26691a6acc214dc066ea08365b605e109203e9164068Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, RegVT, Val); 26701a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else { 26711a6acc214dc066ea08365b605e109203e9164068Chris Lattner assert(0 && "Unknown mismatch!"); 26721a6acc214dc066ea08365b605e109203e9164068Chris Lattner } 2673c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2674c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 2675c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2676c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 26779f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 26789f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 26799f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 26809f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 26819f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 2682c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 2683a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 26849f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 2685c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2686c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2687c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2688c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2689864635ad7b3046d3042311423071152c613961deChris Lattner 2690c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2691c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2692c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2693c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 26949f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 26954b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 26964b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 2697c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 2698c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 2699c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2700864635ad7b3046d3042311423071152c613961deChris Lattner 2701864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 2702864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 2703864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 2704864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 27059b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 27069b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 2707f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 2708f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 27099b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 27109b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 2711f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 2712f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 27139b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 27149b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 27159b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 27169b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 27179b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 27189b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 2719f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 2720f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 2721f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 2722f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 2723f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 2724f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 2725f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2726f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 27279b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 27289b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 27299b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2730f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 27319b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2732864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 2733864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 2734864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 2735864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 27369b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 27379b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 2738f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 2739f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 2740f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 2741f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 2742f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 2743f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2744f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 2745864635ad7b3046d3042311423071152c613961deChris Lattner } 2746f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 2747864635ad7b3046d3042311423071152c613961deChris Lattner} 2748864635ad7b3046d3042311423071152c613961deChris Lattner 2749864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 2750864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 2751864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 2752864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 27534e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 2754864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 2755864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 2756864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 2757864635ad7b3046d3042311423071152c613961deChris Lattner 2758864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 2759864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 2760864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 2761864635ad7b3046d3042311423071152c613961deChris Lattner 27622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 27632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 2764864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 2765864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 2766864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 2767cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 2768cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 2769cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 2770cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 2771cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 2772864635ad7b3046d3042311423071152c613961deChris Lattner 2773864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 2774864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 2775864635ad7b3046d3042311423071152c613961deChris Lattner 2776864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 2777864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 2778864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 2779864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 2780864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 2781864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 2782864635ad7b3046d3042311423071152c613961deChris Lattner 2783864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 2784864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 2785864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 2786864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 2787864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 2788864635ad7b3046d3042311423071152c613961deChris Lattner } 2789864635ad7b3046d3042311423071152c613961deChris Lattner } 2790864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 2791864635ad7b3046d3042311423071152c613961deChris Lattner } 2792864635ad7b3046d3042311423071152c613961deChris Lattner 27932a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 27942a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 27952a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 27962a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (PhysReg.second) { 27972a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 27982a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 27992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 28002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (!isOutReg || !isInReg) { 28012a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (VT == MVT::Other) 28022a821601f1db665fbb825727aacf1a54d17b91efChris Lattner ValueVT = *PhysReg.second->vt_begin(); 28032a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 28042a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 28052a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 28062a821601f1db665fbb825727aacf1a54d17b91efChris Lattner SSARegMap *RegMap = DAG.getMachineFunction().getSSARegMap(); 28072a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 28082a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 28092a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 28102a821601f1db665fbb825727aacf1a54d17b91efChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 28112a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 28122a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 28132a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 28142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 28152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 28162a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 28172a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 28182a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 28192a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 28202a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 28212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 28222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 2823864635ad7b3046d3042311423071152c613961deChris Lattner 28244e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 28254e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 2826864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 2827864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 2828864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 28294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 2830864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 2831864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 2832864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2833864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2834864635ad7b3046d3042311423071152c613961deChris Lattner continue; 2835864635ad7b3046d3042311423071152c613961deChris Lattner } 2836864635ad7b3046d3042311423071152c613961deChris Lattner 28374e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 28384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 28399b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 2840864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 2841864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2842864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2843864635ad7b3046d3042311423071152c613961deChris Lattner continue; 28444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 28454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2846864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 2847864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 2848864635ad7b3046d3042311423071152c613961deChris Lattner 2849e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 2850864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 2851864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 2852864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 2853864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 2854864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 2855864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 2856864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 2857864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 2858864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 2859864635ad7b3046d3042311423071152c613961deChris Lattner } 2860864635ad7b3046d3042311423071152c613961deChris Lattner 2861864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 2862864635ad7b3046d3042311423071152c613961deChris Lattner } 28634e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 2864864635ad7b3046d3042311423071152c613961deChris Lattner 2865864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 2866864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 28674e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 28684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2869367f109ba954239a348c624a3331422bfdb31d03Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 2870367f109ba954239a348c624a3331422bfdb31d03Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 2871367f109ba954239a348c624a3331422bfdb31d03Chris Lattner switch (CT) { 2872367f109ba954239a348c624a3331422bfdb31d03Chris Lattner default: assert(0 && "Unknown constraint type!"); 2873367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Other: 2874367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Unknown: 2875367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 0; 2876367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Register: 2877367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 1; 2878367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_RegisterClass: 2879367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 2; 2880367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Memory: 2881367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 3; 2882367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 2883367f109ba954239a348c624a3331422bfdb31d03Chris Lattner} 2884367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 2885367f109ba954239a348c624a3331422bfdb31d03Chris Lattnerstatic std::string GetMostGeneralConstraint(std::vector<std::string> &C, 2886367f109ba954239a348c624a3331422bfdb31d03Chris Lattner const TargetLowering &TLI) { 2887367f109ba954239a348c624a3331422bfdb31d03Chris Lattner assert(!C.empty() && "Must have at least one constraint"); 2888367f109ba954239a348c624a3331422bfdb31d03Chris Lattner if (C.size() == 1) return C[0]; 2889367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 2890367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string *Current = &C[0]; 2891367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 2892367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 28934234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner TargetLowering::ConstraintType Flavor = TLI.getConstraintType(Current[0]); 2894367f109ba954239a348c624a3331422bfdb31d03Chris Lattner for (unsigned j = 1, e = C.size(); j != e; ++j) { 28954234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner TargetLowering::ConstraintType ThisFlavor = TLI.getConstraintType(C[j]); 2896367f109ba954239a348c624a3331422bfdb31d03Chris Lattner if (getConstraintGenerality(ThisFlavor) > 2897367f109ba954239a348c624a3331422bfdb31d03Chris Lattner getConstraintGenerality(Flavor)) { 2898367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // This constraint letter is more general than the previous one, 2899367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // use it. 2900367f109ba954239a348c624a3331422bfdb31d03Chris Lattner Flavor = ThisFlavor; 2901367f109ba954239a348c624a3331422bfdb31d03Chris Lattner Current = &C[j]; 2902367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 2903367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 2904367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return *Current; 2905367f109ba954239a348c624a3331422bfdb31d03Chris Lattner} 2906367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 2907864635ad7b3046d3042311423071152c613961deChris Lattner 2908ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 2909ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 2910ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 2911ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 2912ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2913ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 2914ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 2915ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 29162cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 29171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 2918ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2919ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 2920ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 2921ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 2922ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 2923ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 2924ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 2925ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2926ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 2927ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 2928ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 29294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 29304e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 29314e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 29324e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 29334e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 29341efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 29354e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 2936367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string ConstraintCode = 2937367f109ba954239a348c624a3331422bfdb31d03Chris Lattner GetMostGeneralConstraint(Constraints[i].Codes, TLI); 29382223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 29391efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 29401efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 29411efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 29421efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 29431efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 29441efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 29451efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 29461efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 29471efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 294822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 29491efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 29501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 29511efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 29521efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 29531efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 29541efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 29551efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 29561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 29571efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 29581efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 29591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 29601efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 29611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 29621efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 29631efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2964864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2965864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 29661efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2967864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2968864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2969864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2970864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2971864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 29724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 29734e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 29744e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 29754e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2976864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 29774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 29784e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 29792223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2980864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 29814e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 29821efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 29831efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2984864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 29851efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 29864e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 29874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2988864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2989864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 29904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 29914e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 29924e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 29932cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 29940f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 29950f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2996864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2997864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 29981efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 29990f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 30006656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 3001367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string ConstraintCode = 3002367f109ba954239a348c624a3331422bfdb31d03Chris Lattner GetMostGeneralConstraint(Constraints[i].Codes, TLI); 30031efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 30042cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 30052cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 300622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 300722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 30084234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner CTy = TLI.getConstraintType(ConstraintCode); 300922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 301022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 301122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 301222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 301322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 301422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 301522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 301622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 301722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 301822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 301922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 302022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 302122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 302222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 302322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 302422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 302522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 302622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 302722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 302822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 302922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 303022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 303122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 303222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 303322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 303422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 303522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 303622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 303722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 303822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 303922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3040864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 3041864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 3042864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 3043864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 3044864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 3045864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 30462223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 3047864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3048864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3049864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 3050864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 3051864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 3052864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 3053d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner if (Regs.Regs.empty()) { 3054832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 3055832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 3056d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3057d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 30582cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 30592cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 3060864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 30612cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 30622cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3063864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 30642cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 306522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 306622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 30672cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 30682cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 30696656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 30706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 30716656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3072c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 30736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 30746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 30756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 307622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 30774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 30783d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 30792223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 30802223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 30812223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 30822223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 30833d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3084c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3085c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3086c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3087c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3088c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3089c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3090c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3091a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3092a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3093c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3094c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3095c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3096c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3097c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3098c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3099527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3100527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3101527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3102527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3103527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3104527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3105527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3106527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3107527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3108527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3109c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3110527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3111527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 3112527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner TLI.getPointerTy()); 3113527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3114527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3115527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3116527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3117527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3118c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 311987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 312087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 312187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 312287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 31234234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner CTy = TLI.getConstraintType(ConstraintCode); 31243d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 312587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 312653069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 312753069fbbae2558a3138df24776448791fea3aceeChris Lattner ConstraintCode[0], DAG); 312853069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 3129832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 3130832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 313153069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 313253069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 313487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 313587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 313687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 313787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 313887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 313987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 314087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 314187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 31426dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner // If the operand is a float, spill to a constant pool entry to get its 31436dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner // address. 31446dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner if (ConstantFP *Val = dyn_cast<ConstantFP>(I.getOperand(OpNum-1))) 31456dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner InOperandVal = DAG.getConstantPool(Val, TLI.getPointerTy()); 31466dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner 3147b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) { 31486dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner cerr << "Match failed, cannot handle this yet!\n"; 31496dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner InOperandVal.Val->dump(); 3150b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner exit(1); 3151b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner } 3152c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 315387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 315487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 315587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 315687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 315787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 315887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 315987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 316087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 316187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 316287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 316387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3164c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 31652223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 316687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 316787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 316887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 316987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 317087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 317187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 317287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 317387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 317487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 317587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3176a844126c43976387a66dafbe5137a762169f1f34Evan Cheng InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, TLI.getPointerTy()); 317787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 317887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 31796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 31806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3181c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3182c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 3183c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 3184c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 3185c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3186c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3187c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 3188c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 31896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 31906656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3191c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 31926656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3193ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3194ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3195ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3196ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3197ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3198f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3199f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3200bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3201ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3202ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 32036656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 32046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 3205864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 3206864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 32076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 32086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 32096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 32106656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 32116656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 32126656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3213864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 32146656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3215864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 3216864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 32176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3218ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 32196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3220bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 32216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 3222786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 32236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 32248b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 32256656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3226bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3227bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3228ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3229ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3230ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3231ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 32321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 32331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 32341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 323668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 323768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 323868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 323968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 324068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 32411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3243a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 32441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 32451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 32461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 324747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 324847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 324947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 325047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 325147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3252cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3253cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 325447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3255cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3256cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3257cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3258cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 32591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 326247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 326347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 326447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 326547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 326647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 32671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3268cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 326947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3270cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3271cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 32721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3274025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3275025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3276025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3277025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3278025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3279025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3280025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3281832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3282832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3283832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3284025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3285025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3286025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3287025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 328839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3289acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3290acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3291acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 329239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 329339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 32941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3295acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3296acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3297acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3298acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3299acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 33001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3303acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3304acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3305acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 33061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3309acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3310acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3311acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3312acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3313acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 33141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3316b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either 3317b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate. 3318b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg, 3319b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned &i, SelectionDAG &DAG, 3320b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 3321b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) 3322b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(Arg, i++); 3323b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3324b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3325b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3326b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3327b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BIT_CONVERT, VT, 3328b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI)); 3329b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3330b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3331b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3332b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3333b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 3334b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi); 3335b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3336b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3337b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3338b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3339b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(); 3340b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3341b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3342fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3343fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3344f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3345f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3346fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3347fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3348b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 3349fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3350fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 33518c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3352fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3353fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3354fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3355fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3356fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 33576aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3358ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3359ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3360fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3361d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 33627aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3363d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 33647aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3365ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3366ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 3367ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner if (FTy->paramHasAttr(j, FunctionType::ZExtAttribute)) 3368d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 3369ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner if (FTy->paramHasAttr(j, FunctionType::SExtAttribute)) 3370d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 33710db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (FTy->paramHasAttr(j, FunctionType::InRegAttribute)) 3372d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 33730db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (FTy->paramHasAttr(j, FunctionType::StructRetAttribute)) 3374d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3375d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3376ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3377fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3378fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3379fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3380fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3381b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3382fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3383fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3384fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3385b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3386fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3387fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3388fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3389fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 3390fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 3391fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 33929f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 33939f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3394b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov for (unsigned i = 0; i != NumVals; ++i) { 3395fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 3396cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 33970db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (i > 0) 3398d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3399d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3400b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3401b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov } 3402fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3403fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3404fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 34059d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(I->getType())->getNumElements(); 34069d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(I->getType())->getElementType(); 3407f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3408fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3409ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3410fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3411fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3412fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 3413b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3414fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3415fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3416fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3417fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3418fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3419fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3420fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 34213b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 34228c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3423fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3424fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3425f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3426f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3427bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 34288c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 34298c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 3430fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3431fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3432fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3433fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 343447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 343547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 343647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3437fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3438fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3439fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3440fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3441fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3442fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3443fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3444fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3445fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3446fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 3447f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner if (FTy->paramHasAttr(Idx, FunctionType::SExtAttribute)) 3448f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3449f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3450f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner else if (FTy->paramHasAttr(Idx, FunctionType::ZExtAttribute)) 3451f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3452f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3453fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3454fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3455fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3456fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3457fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3458fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3459fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3460fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3461fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3462fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3463b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // If this is a large integer or a floating point node that needs to be 3464b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // expanded, it needs to be reassembled from small integers. Figure out 3465b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // what the source elt type is and how many small integers it is. 3466b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this)); 3467fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3468fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3469fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 34709d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(I->getType()); 3471020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 3472020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 3473f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3474fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3475ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3476fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3477d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3478020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 3479020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 3480d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 3481d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3482d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3483d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 3484d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 3485fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3486da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3487fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3488fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3489fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3490fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3491fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3492fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3493fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3494fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3495f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3496b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarCallArgs - Recursively expand call argument node by 3497b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_converting it or extract a pair of elements from the larger node. 3498b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg, 34997aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned Flags, 3500b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SmallVector<SDOperand, 32> &Ops, 3501b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SelectionDAG &DAG, 35027aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio TargetLowering &TLI, 35037aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio bool isFirst = true) { 35047aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3505b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) { 3506cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 35077aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio if (!isFirst) 3508d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3509d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3510b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(Arg); 3511b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3512b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return; 3513b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3514b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3515b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3516b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3517b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3518b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg); 35197aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Arg, Flags, Ops, DAG, TLI, isFirst); 3520b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3521b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3522b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(0, TLI.getPointerTy())); 3523b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3524b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(1, TLI.getPointerTy())); 3525b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3526b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 35277aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Lo, Flags, Ops, DAG, TLI, isFirst); 35287aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Hi, Flags, Ops, DAG, TLI, false); 3529b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3530b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3531b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3532b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3533b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3534b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3535f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3536f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3537f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3538f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3539f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 354047857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 354147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3542f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3543f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3544f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3545be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3546f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3547f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3548f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3549f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3550f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3551f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3552f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3553f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 355447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 355547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 3556d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 35577aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3558d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 35590db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3560d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3561d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 3562d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 3563d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 35640db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 3565d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 35660db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 3567d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3568d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 35690db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3570f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3571f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 35727aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 3573f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3574b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3575f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3576f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3577f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3578d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 3579d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3580d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 3581d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 3582d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 3583d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 3584d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 3585f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 3586f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3587f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3588f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 3589f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3590f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3591b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3592f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3593f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3594f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3595f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 3596f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3597f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 3598b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov ExpandScalarCallArgs(VT, Op, Flags, Ops, DAG, *this); 3599f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3600da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3601da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 36029d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(Args[i].Ty); 3603da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3604da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3605da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3606da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3607ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3608da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 36091b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3610ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // Insert a VBIT_CONVERT of the MVT::Vector type to the vector type. 36111b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 36121b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 3613b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 36141b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 3615da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 3616da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3617da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3618f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3619f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3620f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3621f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3622f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3623f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 3624be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<MVT::ValueType, 4> RetTys; 3625f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3626f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 3627f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3628f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3629f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3630f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3631f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 3632f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3633f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3634f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 3635f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3636f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3637f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3638f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 3639f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3640f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 36419f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 36429f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3643f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 3644f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 3645f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3646da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3647da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 36489d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(RetTy); 3649da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3650da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3651da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3652da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3653ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3654da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3655da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3656da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 3657da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3658da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 3659da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3660da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3661f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3662f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3663f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3664f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3665f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 3666f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3667f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 3668be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 3669be384162c68641233deba8702666af51bdfd4b83Chris Lattner DAG.getVTList(&RetTys[0], RetTys.size()), 3670be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 3671f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3672f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 3673f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 3674f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 3675f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 3676f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 3677f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3678f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 3679f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 3680f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3681f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 3682f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 3683da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 36845df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner // Insert a VBIT_CONVERT to convert from the packed result type to the 3685da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 36869d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(RetTy)->getNumElements(); 36879d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(RetTy)->getElementType(); 3688da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3689da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3690ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3691fea997aac5773e936754de5436029c2a4fa1e930Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy),NumElems); 3692da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3693da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 3694da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 3695da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 3696d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3697d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3698da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3699da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3700da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3701da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 370247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned AssertOp = ISD::AssertSext; 370347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer if (!RetTyIsSigned) 370447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer AssertOp = ISD::AssertZext; 3705f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 3706f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 3707f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 3708f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3709f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 37101a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng if (getTypeAction(VT) == Expand) 37111a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::BIT_CONVERT, VT, ResVal); 37121a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng else 37131a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 3714f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3715f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3716f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 3717f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 3718f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 3719f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3720f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3721f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 3722f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3723f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3724f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3725f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 3726f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 3727f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 372850381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 3729171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 3730171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 3731d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 3732171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 3733171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 37340aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 37350aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 37360aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 37370aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 37380aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 37390aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 37400aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 374174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 37421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 37431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 3744a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 37451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 37461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 37471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 37481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 37491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 37501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 37511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 37521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 37531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 37541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 37551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 37561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 37571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 37581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 37591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 37601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 37611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 37621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 37631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 37641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 37651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 37661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 37671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 37681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 37691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 37701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 377174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 377274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 377374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 377474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 377574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 377674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 377774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 377874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 377974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 378074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 378174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 3782a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 378374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 378474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 378574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 378674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 378774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 37881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 37891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 37901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 37911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 37921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 37931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 37941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3795c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 379680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 379780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 3798c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 3799c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 3800c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 38011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 38021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 38031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 38041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 38051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 38061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 38071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 38081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 38091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 38101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 38111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 38121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 38131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 38141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 38151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 38161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 38171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 38181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 38191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 38201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 38211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 382280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 382380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 382480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 382580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 38261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 382780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 382880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 382980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 3830dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 38311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 38321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 38331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 38341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 38351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 38361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 383780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 383880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 383980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 384080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 38411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 38421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 38431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 384480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 384580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 38461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 38471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 38487041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 38491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 38501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 38511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 38521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 38531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 38541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 38551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 38561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 38571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 38581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 38591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 38601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 3861bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 38621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 3863ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 38641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 3865c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 3866c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 386780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 38681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 38691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 38701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 38711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 3872a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 3873786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 3874864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 38758b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 3876c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 3877c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 3878c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3879c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3880c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 3881c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3882c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 3883c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 3884c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 3885c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 3886cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 388774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 388874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 3889cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 389074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 389174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 389274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 389374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 389474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 389574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 389674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 3897cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 389874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 389974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 390074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 3901f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 39020937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 3903cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 3904cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 3905cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 3906cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 3907cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 390874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 390974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3910c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 3911c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 3912c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 391374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 391474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3915cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 391674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 391774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 391874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3919786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3920786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 39218b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 392274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 392374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 392474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 3925466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 392674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 392774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3928786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3929786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 39308b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 393174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 3932c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 393374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 393474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 39351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 39361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3937c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 39381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 39391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3940c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 3941c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 3942bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 3943bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 3944c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 3945c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 39461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 39471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3948bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 39491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39517041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 39527041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 39537041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 39541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 39561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 39571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3959495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 3960c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 3961c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 3962495a0b51915eb763576874f29192820b731edc22Chris Lattner} 39631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3964c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3965bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 39661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 39671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 39681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 3969832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 39701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 39721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 39741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3975edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3976ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 3977ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 3978ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 3979ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 3980ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 3981ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 3982ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 3983ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 39841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 39851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3987571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 3988571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 3989571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 399018c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3991d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 399218c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3993d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3994d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3995d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3996d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3997d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3998d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3999571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 40001c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 400170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 400270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 40039d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(cast<VectorType>(V->getType()), 400470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 40051c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 400670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 400770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 400870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 400970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 401070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 401170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 401270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 401370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 401470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 4015bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 4016571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Root = getRoot(); 401770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 401870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 4019a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(i, TLI.getPointerTy())); 402070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 402170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 402270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 402370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 402470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 402570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 402670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 402770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 402870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 402970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 403070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 403170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 403270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 403370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4034a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 403570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4036a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 403770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 403870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 403970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 40401c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 4041bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, 4042bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 40439f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) { 4044d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 4045fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 4046fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 4047fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 4048fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 4049571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 4050d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 40519f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DestVT = TLI.getTypeToExpandTo(SrcVT); 40529f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(SrcVT); 40539f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 40549f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng return DAG.getCopyToReg(getRoot(), Reg, 40559f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getNode(ISD::BIT_CONVERT, DestVT, Op)); 40569f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 4057d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 4058d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4059a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 4060d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4061a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 4062571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Op = DAG.getCopyToReg(getRoot(), Reg, Lo); 4063d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 4064d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 40651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 40661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4067068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 406815699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4069068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 40701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 407115699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 40720afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4073bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4074bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4075bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4076bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4077bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4078bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4079bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4080bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4081f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4082bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4083bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4084251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4085251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4086251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4087bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4088bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 40890afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4090bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4091bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4092966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4093bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4094068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4095068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4096068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4097068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4098f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4099068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 4100068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4101068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4102edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4103bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4104ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4105bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 41061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 41081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 41091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 41111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 41121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 41131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4114183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 4115183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Lower call part of invoke. 4116183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey InvokeInst *Invoke = dyn_cast<InvokeInst>(LLVMBB->getTerminator()); 4117183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (Invoke) SDL.visitInvoke(*Invoke, false); 4118f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 41201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 41211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4122f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 41239f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 41241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4125ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4126571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 41271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 41281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 41301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 41311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 41321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 41331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 41341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4135edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 41368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 41371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 41391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4140d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 41418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 41428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 41438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 41448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 41458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 41461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 41471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 41481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 41491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4150d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 41518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4152d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 41538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 41548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 41558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 41568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 41578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 41588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 41598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 41601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 41611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 41631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 41641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 41651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 41668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 41678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 41688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 41698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 41708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 41718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 41723f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 41738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 41748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 41758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 41768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 41778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 41788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 41791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 41808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 41818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 41828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 41838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 41848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 41858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 41868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 41878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 41888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 41898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 41907e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 41911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 41928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 41938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 41948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 41958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 41968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 41978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 41988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 41998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 42008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 42018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 42029d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 42038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 42048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 42058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 42068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 42078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 42081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 42091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 42101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4211ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 42125a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 42137436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 42147436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 42157436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 42167436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 42177436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 42187436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 42197436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 42207436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 42217436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 42227436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 42237436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 42247436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4225bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4226bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4227ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4228ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 42291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4230183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (Invoke) { 4231183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Just the branch part of invoke. 4232183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey SDL.visitInvoke(*Invoke, true); 4233183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } else { 4234183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey SDL.visit(*LLVMBB->getTerminator()); 4235183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } 4236a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4237f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 423837efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4239f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4240f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 42413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 42423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 4243f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4244a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4245a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 42461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4248f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4249c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4250c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4251c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4252af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4253c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 42542300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4255832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 42561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4257f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 42581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 42591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4260ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4261f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4262832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 42631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4264f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4265af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4266c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 42672300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4268a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4269552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4270a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4271a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 42721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4274832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 42751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4276f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4277f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4278f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4279f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4280f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4281f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 428244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4283f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4284f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4285f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4286f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4287f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 42881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4289f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4290f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4291f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4292f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4293a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 42941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 42953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty()) { 4296f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4297f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4298f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4299f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 430009e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4301f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4302f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4303f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 43041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4305f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 43069453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 43079453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 43089453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 43093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 43103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 43113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 43123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 43133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 43143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 43153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 43163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 43173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 43183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 43193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 43203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 43213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 43223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov } 43233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 43243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 43253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 43263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering JSDL(JSDAG, TLI, FuncInfo); 432737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 43283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 43293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 433037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 43313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 43323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 43333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 43343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 433537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 433637efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 433737efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 433837efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 433937efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 434037efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 43413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 434209e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 43433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4344f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 4345f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 434609e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4347f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 434837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 434937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 435037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 435137efe6764568a3829fee26aba532283131d1a104Nate Begeman 4352b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4353b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4354b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4355b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4356b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4357b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4358b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4359b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4360b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4361b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4362b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4363b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4364f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4366d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 436744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4370d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4374d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4379d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4380d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4381d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4382d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4383d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 438457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4385d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4386d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4387d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4388d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4389d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4390d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4391d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4392d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4393d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4394d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4395d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4397d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4398d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 439957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 440057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4401d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4402d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 44032452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 440457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 440657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4407a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 44081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4409a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 441013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4411a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4412a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4413a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4414a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4415a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 441613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4417eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 441813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 441913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4420eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 44219373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 44224ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 442313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 44249ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4425a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4426cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4427a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 44280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 442903fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 44309ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 44319ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 44329ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 44339ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4434755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4435755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4436755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4437755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4438755480681c795d585c73556c028b6143c46bda86Chris Lattner 4439755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4440755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4441755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4442755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4443755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4444755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4445755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4446755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4447755480681c795d585c73556c028b6143c46bda86Chris Lattner 4448755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4449755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4450755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4451755480681c795d585c73556c028b6143c46bda86Chris Lattner 4452755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4453755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4454755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4455755480681c795d585c73556c028b6143c46bda86Chris Lattner 4456755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4457755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4458755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4459755480681c795d585c73556c028b6143c46bda86Chris Lattner if (getTargetLowering().MaskedValueIsZero(LHS, NeededMask)) 4460755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4461755480681c795d585c73556c028b6143c46bda86Chris Lattner 4462755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4463755480681c795d585c73556c028b6143c46bda86Chris Lattner 4464755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4465755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4466755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4467755480681c795d585c73556c028b6143c46bda86Chris Lattner 4468755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4469755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4470755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4471755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4472755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4473755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4474755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4475755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4476755480681c795d585c73556c028b6143c46bda86Chris Lattner 4477755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4478755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4479755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4480755480681c795d585c73556c028b6143c46bda86Chris Lattner 4481755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4482755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4483755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4484755480681c795d585c73556c028b6143c46bda86Chris Lattner 4485755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4486755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4487755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4488755480681c795d585c73556c028b6143c46bda86Chris Lattner 4489755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4490755480681c795d585c73556c028b6143c46bda86Chris Lattner getTargetLowering().ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4491755480681c795d585c73556c028b6143c46bda86Chris Lattner 4492755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4493755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4494755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4495755480681c795d585c73556c028b6143c46bda86Chris Lattner 4496755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4497755480681c795d585c73556c028b6143c46bda86Chris Lattner 4498755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4499755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4500755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4501755480681c795d585c73556c028b6143c46bda86Chris Lattner 45029ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 45030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 45040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 45050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 45060e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 45070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 45080e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 45090e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 45100e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 45110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 45120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 45130e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 45140e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 45150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 45160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 45170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 45180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 45190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 45200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 45210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 45220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 45230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 45240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 45250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 45260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 45270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 4528832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 45290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 45300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 45310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 45320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 45334b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 453436d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 45354b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 45360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 45370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 45380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 45390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 45400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 45410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 45420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 45430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 45440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 4545