SelectionDAGISel.cpp revision 18da0720887527ed570e9703ae5f290beb491ee1
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" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 2944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey#include "llvm/CodeGen/MachineModuleInfo.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3237efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 34eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 37fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 43124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 46a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 477e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 517944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 52a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 53a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 55a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 56a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 577944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 585e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 61eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 62eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 63eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 734ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 7613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 773700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 7813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 7913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 809ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 819373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 829373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 834ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 85864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 86864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 87864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 88864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 89864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 909525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 91864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 92864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 93864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 94864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 95864635ad7b3046d3042311423071152c613961deChris Lattner 96864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 97864635ad7b3046d3042311423071152c613961deChris Lattner /// 98864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 99864635ad7b3046d3042311423071152c613961deChris Lattner 100864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 101864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 102864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 103864635ad7b3046d3042311423071152c613961deChris Lattner 104864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 105864635ad7b3046d3042311423071152c613961deChris Lattner 106864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 107864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 108864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 109864635ad7b3046d3042311423071152c613961deChris Lattner } 110864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 111864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 112864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 113864635ad7b3046d3042311423071152c613961deChris Lattner } 114864635ad7b3046d3042311423071152c613961deChris Lattner 115864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 116864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 117864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 118864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1199f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 120c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 121c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 124c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 125a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 126a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 127c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1329f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 133864635ad7b3046d3042311423071152c613961deChris Lattner }; 134864635ad7b3046d3042311423071152c613961deChris Lattner} 1354ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1389373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1399373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 158f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 159f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1739f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 189edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1903c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1913c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 201f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 202f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 207f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 208571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 209f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 214bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 215f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 216f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 217bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 218bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 219bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 220f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 222bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 226edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 229bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 230bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 23116ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 23216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 233bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 234bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 237bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2392aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 242b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 244a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 245ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 246d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 247ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 248a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 249b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 250d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 252f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2552aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2562aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2652aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 2788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 2798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 2808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 2818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 2828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 2839d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 2848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 285f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 288c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 2898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 290c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 2918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2953c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 305ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, figure out what type it will decompose into 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3089d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(V->getType()); 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3186cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3196cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3206cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3216cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3293c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3409f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng VT = TLI.getTypeToExpandTo(VT); 3419f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned R = MakeReg(VT); 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3439f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MakeReg(VT); 3443c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3453c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3560da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 358d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 359d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 360d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 361d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 362d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 363d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 409f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 410f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 411b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 412b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 4135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 416f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 4185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 423f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 432f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 439a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 441f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 442f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 443f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 448f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 454edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 459a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 460a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 461a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 462d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 463d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 464edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 465d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 466d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 467d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 468d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 469d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 470d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 471d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 472d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 473bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 474bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 475d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 476d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 477d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 478a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 479a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 480571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 481571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4851e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4861e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 500466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 50128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 507199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5090da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 5120da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 5131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5144e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 515864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 516864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 517864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 518864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 519864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 520f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 521571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 522571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 523571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 525571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5261da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 5271da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 5281da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, SDOperand Callee, unsigned OpIdx); 529735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 5301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 537dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 539b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 540b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 541dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 545dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 55837efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 561f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 563b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 564183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey void visitInvoke(InvokeInst &I, bool AsTerminator); 565b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 56724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitScalarBinary(User &I, unsigned OpCode); 56824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitVectorBinary(User &I, unsigned OpCode); 56924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitEitherBinary(User &I, unsigned ScalarOp, unsigned VectorOp); 570e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5715fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5729d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 57324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VADD); 57424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 57524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FADD); 5761628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 57724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::ADD); 57801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 579b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5801628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5819d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 58224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VMUL); 58324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 58424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FMUL); 5851628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 58624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::MUL); 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 58824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitURem(User &I) { visitScalarBinary(I, ISD::UREM); } 58924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSRem(User &I) { visitScalarBinary(I, ISD::SREM); } 59024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFRem(User &I) { visitScalarBinary(I, ISD::FREM); } 59124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitUDiv(User &I) { visitEitherBinary(I, ISD::UDIV, ISD::VUDIV); } 59224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSDiv(User &I) { visitEitherBinary(I, ISD::SDIV, ISD::VSDIV); } 59324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFDiv(User &I) { visitEitherBinary(I, ISD::FDIV, ISD::VSDIV); } 59424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitAnd (User &I) { visitEitherBinary(I, ISD::AND, ISD::VAND ); } 59524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitOr (User &I) { visitEitherBinary(I, ISD::OR, ISD::VOR ); } 59624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitXor (User &I) { visitEitherBinary(I, ISD::XOR, ISD::VXOR ); } 59724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5983822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5993822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 60045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 60145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 6023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 6033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 6043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 6053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 6063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 6073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 6083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 6093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 6103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 6113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 6123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 6133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 6143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6162bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 6172bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 6183e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 619c7029805ef35ce9805931067b841e6af11db382eChris Lattner 6201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 6211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 6221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 6241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 6251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 6261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 6271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 6281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 6291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 630ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 631c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6320eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6397041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 652199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 653199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 654199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 655199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 656199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 657199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 658199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 659199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 660199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 6610da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 6620da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 6630da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 665199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 666199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 667199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 668199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 6699d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 67023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 67123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 672b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 6739d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 67423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 67523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 67623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 677bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 67823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 67923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 68023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 68123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 68223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 683bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, 684bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 685199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 686199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 6879d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 688199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 689199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 690199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 691199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 692199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 693199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 694bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 6959d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 6962bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6972bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 698199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 699199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 700199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 701199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 702199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 703199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 706199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 707199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 708b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 70923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 71023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 7110da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return NodeMap[V] = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], 7120da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 713199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 714199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 7156b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 716199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 717199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 718199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 719199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 720199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 721199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 722199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 723199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 724199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 725199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 726251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 727251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 728199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 729199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 73070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 7319f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Expand) { 73270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 733251db1890c1fe03d02ee878ada8129537844d031Chris Lattner // register pair InReg and InReg+1. 7349f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToExpandTo(VT); 7359f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(VT); 7369f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7379f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 7389f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BIT_CONVERT, VT, N); 7399f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng else { 7409f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 7419f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 7429f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 7439f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } 7449f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else { 7459f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 7469f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7479f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Promote) // Promotion case 7489f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = MVT::isFloatingPoint(VT) 7499f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng ? DAG.getNode(ISD::FP_ROUND, VT, N) 7509f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng : DAG.getNode(ISD::TRUNCATE, VT, N); 751199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 75270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 75370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 75470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 75570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 7569d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 7579d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(PTy, PTyElementVT, 75870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 75970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 76070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 761bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 76270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 76370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 76470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 76570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 76670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 76770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 76870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 76970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 77070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 77170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 77270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 77370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 77470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 77570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 77670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 77770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 77870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 77970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 78070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 78170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 78270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 78370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 78470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 78570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 78670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 78770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 78870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 78970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 79070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 79170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 792bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size()); 7932e2ef9535070bb352601482cceac1140c1158cddChris Lattner 7942e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7952e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7962e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7972e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7982e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7992e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 800199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 801199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 802199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 803199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 804199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 805199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 8061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 8071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 808a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 8091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 8101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 811bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 812ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 813ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 814ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 815ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 816ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 817ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 818ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 8198e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 8208e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 821ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 822ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 823ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 824ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 825ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 826ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 827ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 82847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 8295694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 830bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 83118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt)) 8328c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 83318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt)) 83447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 835376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 836ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 837ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 83847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer NewValues.push_back(DAG.getConstant(false, MVT::i32)); 8391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 840bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 841bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 8421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 8431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 844571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 845571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 846571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 847571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 848571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 849571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 850571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 851571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 852571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 853571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 854571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 855571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 856571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 857571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 8598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 8608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 8618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 8628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 8638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 8648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 8658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 8688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 8728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 8738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 8748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 8758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 8788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 8828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 8848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8856a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 8866a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 8876a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 8886a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 8896a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 8906a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 891571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 892571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 893571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 894571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 895571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 896571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 897571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 898e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 899571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 900e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 901e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 9026a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 9036a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 9046a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 905571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 906571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 907e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 908e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 909e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 910e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 9115a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 9125a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 9135a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 9145a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 9155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 916e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 917e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 918e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 919e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 920e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 921e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 922e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 923e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 924e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 925e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 926e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 927e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 928e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 929e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 930e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 931e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 932e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 933e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 934e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 935e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 936e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 937e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 938e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 939e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 940e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 941e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 942e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 943e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 944e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 945e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 946e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 947e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 948e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 949e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 950e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 951e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 952e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 953e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 954e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 955e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 956e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 957e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 9580da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 959e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 960571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 961571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 962571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 9635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 965571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 966571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 967571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 968571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 9696b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 9705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 971571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 972571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 973571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 974571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 975d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 976d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 977571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 978571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 979571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 980571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 981d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 982d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 983d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 984d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 985d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 986d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 987d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 988d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 989571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 990d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 991d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 992d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 993d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 994d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 995d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 996d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 997d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 998d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 999d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1000d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1001d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1002d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1003d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1004d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1005d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1006d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1007d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1008d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1009d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1010d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1011d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1012571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1013571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1014df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1015df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1016df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1017df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1018df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1019df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1020df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10210ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 10220ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 10230ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 10240ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 10250ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 10260ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 10270ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 10280ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 10290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1030df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1031df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1032df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 10341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 10351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 10361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 10381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 10391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 10401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 10411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 10421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 10441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 10451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1046a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1047dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 104857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 104957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 105057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 105157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 105257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 105357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 105457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 105557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 105657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 105757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 105857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1059571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1060571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1061571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1062571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1063571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1064571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1065571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1066571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1067571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1068571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1069571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1070571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1071571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1072571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1073571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1074571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1075571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1077d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1078571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1079571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 10800ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 10810ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 10820ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 10830ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 10840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1085df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1086df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1087df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1088df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1089df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1090df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1091df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1092df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1093df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1094df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1095df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 10965a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 10975a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 10980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 10990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 11000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 11010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 11020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1103df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1104571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1105571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 11062452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 11072452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 11086b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 11095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 11102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 11112452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 11122452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 11131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1115f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1116f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1117f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 111857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 111957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 112057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 11215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 11225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 11235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 11245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 11255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 11265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 11275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 11285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 11295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 11305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 11315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 11325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 11345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 11365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 11375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 11395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 11403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 11425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 11435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 11455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 11465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 11475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1151f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1152f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1153f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1154f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1155f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1156f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1157f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 116057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 116157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1163f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1164f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1165f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 116657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 116757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1168f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1169f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 117157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 117357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 117457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1175f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1176f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 11773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 117837efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 117937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 11803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov assert(JT.Reg != -1UL && "Should lower JT Header first!"); 118137efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 11823d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 11833d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 11843d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 11853d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 11863d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 118737efe6764568a3829fee26aba532283131d1a104Nate Begeman} 118837efe6764568a3829fee26aba532283131d1a104Nate Begeman 11893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 11903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 11913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 11923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 11933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 11943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 11953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 11963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 11973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 11983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 11993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 12003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 12023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 12033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 12043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 12053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 12063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (VT > TLI.getPointerTy()) 12073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 12083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 12093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 12103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 12123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 12133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 12143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 12163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 12173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 12183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 12193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 12203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 12213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 12233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 12243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 12283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 12303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 12313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 12333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 12343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 12353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 12364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 12374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 12393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 12403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 12424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 12434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 12444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 12454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 12464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 12474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 12484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 12494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 12514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 12524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 12534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 12544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 12564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (VT > TLI.getShiftAmountTy()) 12574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 12584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 12594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 12604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 12624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 12634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 12644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 12654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 12674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 12684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 12694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 12714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 12724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 12744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 12754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 12794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 12814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 12824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 12834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 12844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 12854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 12864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 12884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 12894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 12914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 12924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 12944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 12954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 12964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 12974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 12984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 12994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 13014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 13024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 13034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 13044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 13054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 13064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 13074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 13084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 13094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 13164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 13184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 13194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 13214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 13224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 13244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 13254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 13283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1329b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1330183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey assert(0 && "Should never be visited directly"); 1331183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey} 1332183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I, bool AsTerminator) { 1333b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1334b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1335b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 1336b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1337183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (!AsTerminator) { 1338183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Mark landing pad so that it doesn't get deleted in branch folding. 1339183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey LandingPad->setIsLandingPad(); 1340183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1341183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Insert a label before the invoke call to mark the try range. 1342183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // This can be used to detect deletion of the invoke via the 1343183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // MachineModuleInfo. 1344183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 1345183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey unsigned BeginLabel = MMI->NextLabelID(); 1346183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 1347183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getConstant(BeginLabel, MVT::i32))); 1348183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1349183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 1350183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey I.getCallingConv(), 1351183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey false, 1352183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey getValue(I.getOperand(0)), 1353183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 3); 1354183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1355183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Insert a label before the invoke call to mark the try range. 1356183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // This can be used to detect deletion of the invoke via the 1357183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // MachineModuleInfo. 1358183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey unsigned EndLabel = MMI->NextLabelID(); 1359183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 1360183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getConstant(EndLabel, MVT::i32))); 1361183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1362183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Inform MachineModuleInfo of range. 1363183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 1364183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 1365183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Update successor info 1366183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey CurMBB->addSuccessor(Return); 1367183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey CurMBB->addSuccessor(LandingPad); 1368183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } else { 1369183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Drop into normal successor. 1370183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1371183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey DAG.getBasicBlock(Return))); 1372183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } 1373b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1374b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1375b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1376b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1377b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 13785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1379b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1380dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1381b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1382b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1383b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1384dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1385dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1386dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1387dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 13884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1389dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 13905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1391b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1392b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1393b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1394b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1395b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1396b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1397b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1398b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1399b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1400b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1401b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1402b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1403b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1404b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1405b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1406b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1407b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 14085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1409b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1410b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1411b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 14125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1413b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1414b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1415b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1416b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1417b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1418b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1419b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1420b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1421b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1422b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1423b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1424b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1425b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1426b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1427b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1428b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1429b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1430b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1431b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 14325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 14345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 14355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 14365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 14375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 14385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 14395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 14415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 14425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 14445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1445b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1446b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1447b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1448b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1449b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1450b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1451b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1452b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1453b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1454b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1455b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1456b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1457dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1458dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1459b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1460b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1461b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1462dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1463b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1464b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1465b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1466dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1467dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1468dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 14705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 14715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 14735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 14755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1476dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1477dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if ((!TLI.isOperationLegal(ISD::BR_JT, MVT::Other) && 1478dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov !TLI.isOperationLegal(ISD::BRIND, MVT::Other)) || 14794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TSize <= 3) 1480dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1481dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 14835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1484dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1485dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 14875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 14884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 14895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1491b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1492dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1494b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1495b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1496b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1497b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1502b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1504b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1506b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1507b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1508b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1509b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 15134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 15185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 15195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 15205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 15215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 15235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 15245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 15255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1527b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1528b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 15325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1533b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1534b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1535b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1539b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1540b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTable JT(-1UL, JTI, JumpTableBB, Default); 1548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1550b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1553b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1555dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1557b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1558b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1559b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1560dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1562b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1563b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1564b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1565b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1566b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1567b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1568b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1569b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1570b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1571b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1572b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1573b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1574b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1575b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1576b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1577b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1578b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1579b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1580b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1581b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 15835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 15855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1586b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1587b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1588b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 15895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 15925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 15935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 15955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 15974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 15984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1599b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 16015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 16025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 16034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1604b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1605b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 160654e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 16074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 16084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 16094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 16104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 16114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 16124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1613b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 16144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 16154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 16195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1620b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If our case is dense we *really* should handle it earlier! 162254e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 1623b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1624b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1625b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 16265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1627b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1628b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1629b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1630b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1631b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1634b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 16365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 16375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 16385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 16395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1643b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1644b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1645b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1646b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1649b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 16515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 16525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 16535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1654b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1655b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1656b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1658b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1659b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1662b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 16635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 16645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1666b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1667b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1668b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1669b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1670dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1671dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1672b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1673b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 16744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 16754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 16764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 16774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 16784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 16794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 16804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default) { 16814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned IntPtrBits = getSizeInBits(TLI.getPointerTy()); 16824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 16844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 16854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 16874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 16884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 16894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 16914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 16924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 16934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 16944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 16954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 16964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 16974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 16984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 17014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 17024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 17034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 17044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 17054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 17064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 17074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 17094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 17104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 17124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 17154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 17164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 17174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 17184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 17194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (range>IntPtrBits || 17214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 17224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 17234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 17244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 17254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 17274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 17284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 17304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 17314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 17324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() <= IntPtrBits) { 17344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 17354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 17364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 17374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 17404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 17414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 17434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 17444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 17454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 17474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 17504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 17514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 17524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 17554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 17564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 17584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Mask |= 1 << j; 17594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 17604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 17644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 17664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 17684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 17694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 17704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1786efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 17884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 17934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 17995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 18005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 18015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 18025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 18045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 18055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 18065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 18075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 18085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 18095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 18115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 18135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 18145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), J=++(Cases.begin()), E=Cases.end(); J!=E; ) { 18155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 18165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 18175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 18185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 18195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 18215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 18225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 18235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 18245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 18255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 18265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 18275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 18315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 18325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 18335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 18345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 18375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 18385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1840f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1841f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1842f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1843c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 18445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1845d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1846f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1847f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 18485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1849f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1850c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1851f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1852d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1853f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1854d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1855c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1856d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1857f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1858f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1859f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1862f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 18635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 18645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 18655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 18665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1867c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1869f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1870f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 18715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 187237efe6764568a3829fee26aba532283131d1a104Nate Begeman 18733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 18753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 18763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 18783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 18793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 18803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 18813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 18834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 18844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 18863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1887dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1888dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1889dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 18904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 18913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 18923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1893dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1894dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1895dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1896dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 1897dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 1898dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 1899f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1900f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1901f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 19023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1903b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1904b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 190524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 19069d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 190724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VSUB); 190824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer } else if (Ty->isFloatingPoint()) { 190901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 191001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 191101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 191201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 191301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 191401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 191524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FSUB); 19161628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else 191724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::SUB); 1918b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1919b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 192024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitScalarBinary(User &I, unsigned OpCode) { 19211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 19221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 192324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 192424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 19251628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 19261628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 192724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid 192824d6da5fedcf39891f7d8c5b031c01324b3db545Reid SpencerSelectionDAGLowering::visitVectorBinary(User &I, unsigned OpCode) { 19299d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer assert(isa<VectorType>(I.getType())); 19309d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *Ty = cast<VectorType>(I.getType()); 193124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer SDOperand Typ = DAG.getValueType(TLI.getValueType(Ty->getElementType())); 193224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 193324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, MVT::Vector, 193424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(0)), 193524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(1)), 193624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer DAG.getConstant(Ty->getNumElements(), MVT::i32), 193724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer Typ)); 193824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer} 19391628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 194024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitEitherBinary(User &I, unsigned ScalarOp, 194124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer unsigned VectorOp) { 19429d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 194324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, VectorOp); 194424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else 194524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ScalarOp); 1946e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 19472c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1948e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1949e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1950e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1951e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1952832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer if (TLI.getShiftAmountTy() < Op2.getValueType()) 1953832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 1954832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 1955832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1956e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 19571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 19581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 19591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 196045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 1961e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 1962e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 1963e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 1964e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 1965e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 1966e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1967e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 196845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 1969e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 197045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 197145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 197245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 197345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 197445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 197545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 197645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 197745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 197845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 197945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 198045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 198145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 198245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 198345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 198445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 198545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 198645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 198745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 198845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 1989e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 1990e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 1991e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 1992e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 1993e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 1994e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1995e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 1996e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 1997e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 1998e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1999e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2000e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2001e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2002e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2003e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2004e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2005e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2006e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2007e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2008e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2009e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2010e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2011e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2012e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2013e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 201445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 201545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2016e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 201745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 201845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2019e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2020e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2021e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2022e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2023e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 20241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 20271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 20281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 20291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 20309d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(I.getType())) { 2031b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 2032b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 2033b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 2034b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 2035b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 2036b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 2037b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 20381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 20423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 20433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 20463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 20493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 20503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 20513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 20543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 20573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 20583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 20593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 20623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 20653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 20663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 20693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 20723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 20733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 20763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 20793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 20803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 20833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 20863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 20873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 20903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 20933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 20943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 20973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 21003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 21043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 21073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 21083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 21091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2110e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 211128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 21133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 21143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 21153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 21173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 21183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 21193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 21223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 21233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 21243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 21263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 21283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 21293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 21313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 21323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 21353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 2137e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 21383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast to a vector from something else. 21393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the output vector. 21409d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 2141e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 2142e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 2143e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 2144e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 21453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 21463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer } 21473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 21483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (SrcVT == MVT::Vector) { 21493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast from a vctor to something else. 21503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the input vector. 2151e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 21523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 21531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 21563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 21573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 21583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 21593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 21611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21632bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2164c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2165c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2166c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2167c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2168c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21692332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 21702332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 21712332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 21722332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 2173c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2174c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21752bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2176384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2177384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2178384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 2179384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 2180384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 2181384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2182384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2183c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21843e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 21853e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 21863e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 21873e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 21883e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21893e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 21903e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 21913e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 21923e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 21933e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 21943e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21953e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 21971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 21981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 21991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 22011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 22021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2203c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2204b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 22051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 22061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2207b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 22081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2209dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 22101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 22121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 22131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 22147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22157c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 22167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2217b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 221847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 22190d630d220414b02fed6873555bb46795a682174bEvan Cheng TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 22207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 22217c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22227c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 22237c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22247c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2225a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 22267c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 22277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 22297c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 22307c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 223147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 22327c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 22337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 22347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22357c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 22367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 22377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 22387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 22397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 22406b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 22411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 22427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 22467c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 22477c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 22481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 22511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 22541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 22551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 22561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 22571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 22581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2260a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 226158092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2262d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 226358092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 22641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 226668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 226768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 226868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 226968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 227068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 22711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 227268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 22731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 22761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 22771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 22801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 22811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 22821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 22831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 22841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 22851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 22861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 22871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 22881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 22891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2291bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2292f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2293f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2294f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 22950da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 22960da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 22971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 22991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 23001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 23011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 23041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2305edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2306d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2307d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2308d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2309d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2310d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2311d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2312d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 231328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2314466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 231528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 231628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 231728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 231828b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2319466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 232028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 23215fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 23229d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) { 23234ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 2324466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, 2325466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng DAG.getSrcValue(SV)); 23265fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 23270b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, isVolatile); 23285fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 2329d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 233028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2331d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2332d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2333d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 233428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 233528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 23401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 23411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 23421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 23430b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 23448b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.isVolatile())); 23451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23470eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 23480eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 23490eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 23500eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 23510eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 23520eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 23530eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 23540eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 23550eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2356e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2357e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2358e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2359e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2360e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2361e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2362e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2363e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2364e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 23650eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 23660eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 23670eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 23680eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 23697255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2370e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 23710eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23720eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2373bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2374e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2375e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2376e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2377e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2378e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2379e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2380e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2381e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 23820eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23830eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 23840eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 23850eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23860eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 23870eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 23880eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 23890eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2390ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, force it to the right vector type. 23910eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 23929d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *OpTy = cast<VectorType>(I.getOperand(i)->getType()); 23930eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 23940eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23950eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 23960eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 23970eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 23980eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 23990eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24000eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 24010eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 24020eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 24030eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24040eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24050eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 24060eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24070eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 24080eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 24099d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 24100eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 24110eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24120eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 24130eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 24140eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24150eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24160eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 24170eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 24180eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24190eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 24200eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 24210eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2422f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2423f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 24240eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 242548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 242648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2427f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2428f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 242948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2430f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2431f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 243248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2433f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2434f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 243548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2436e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2437e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2438e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2439e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2440e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2441e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2442e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24430eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24449d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 24450eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 24460eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 24470eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 24480eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 24490eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24500eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 24510eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24520eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24530eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2454c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2455c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2456c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2457c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2458c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2459c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 24600eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 24610eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 24620eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 24630eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2464c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2465c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2466c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2467bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2468bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2469bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2470bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2471bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2472bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2473bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2474bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2475c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2476d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2477c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2478c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2479d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2480c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 248103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 248203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 248303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 248403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 248503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 248603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 248703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 248803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 248903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 249003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 249103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 249203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2493c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 249486cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 249544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 249643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 249744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2498bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 249936ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2500bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2501bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2502bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2503ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 250444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2505ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 250643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 250743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2508bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2509bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2510ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2511bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 251286cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 251343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2514b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 251536ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 251643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 251744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 251843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 251944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 252044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 25211ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2522bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 252343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 252443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2525b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 252643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 252743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 252844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 252943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 253044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 253144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 25321ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2533bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 253443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 253543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2536b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 253743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 253843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 253944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 254043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 254144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 254244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 254344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 25441ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2545bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 254643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 254743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2548b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 254943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 255043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 255144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 255243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 255344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 25540892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2555bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 255644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 255743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 255843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 255943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 256043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2561c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2562b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2563b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2564b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2565735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2566735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Add a label to mark the beginning of the landing pad. Deletion of the 2567735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // landing pad can thus be detected via the MachineModuleInfo. 2568735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned LabelID = MMI->addLandingPad(CurMBB); 2569735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 2570735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.getConstant(LabelID, MVT::i32))); 2571735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2572735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception register as live in. 2573735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionAddressRegister(); 2574735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 2575735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2576735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2577735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2578735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2579735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2580735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2581735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2582735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 25837a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 258464ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2585735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2586b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2587b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2588b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 25890b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_selector: 25900b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_filter:{ 2591b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2592b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2593735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2594735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Inform the MachineModuleInfo of the personality for this landing pad. 2595cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(2)); 2596cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CE && CE->getOpcode() == Instruction::BitCast && 2597cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<Function>(CE->getOperand(0)) && 2598cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "Personality should be a function"); 2599cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey MMI->addPersonality(CurMBB, cast<Function>(CE->getOperand(0))); 26000b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey if (Intrinsic == Intrinsic::eh_filter) 26010b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey MMI->setIsFilterLandingPad(CurMBB); 2602b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2603735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Gather all the type infos for this landing pad and pass them along to 2604735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // MachineModuleInfo. 2605735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::vector<GlobalVariable *> TyInfo; 2606735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = 3, N = I.getNumOperands(); i < N; ++i) { 2607cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(i)); 2608cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey if (CE && CE->getOpcode() == Instruction::BitCast && 2609cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<GlobalVariable>(CE->getOperand(0))) { 2610cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey TyInfo.push_back(cast<GlobalVariable>(CE->getOperand(0))); 2611cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey } else { 2612cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i)); 2613cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CI && CI->getZExtValue() == 0 && 2614cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "TypeInfo must be a global variable typeinfo or NULL"); 2615cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey TyInfo.push_back(NULL); 2616735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2617735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2618735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey MMI->addCatchTypeInfo(CurMBB, TyInfo); 2619735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2620735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception selector register as live in. 2621735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionSelectorRegister(); 2622735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 2623735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2624735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 262564ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey SDVTList VTs = DAG.getVTList(MVT::i32, MVT::Other); 2626735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2627735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2628735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2629735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2630735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2631735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 26327a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 263364ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2634b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2635b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2636b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2637b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2638b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2639b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_typeid_for: { 2640b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2641735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2642735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2643735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2644735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey GlobalVariable *GV = NULL; 2645cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(1)); 2646cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey if (CE && CE->getOpcode() == Instruction::BitCast && 2647cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<GlobalVariable>(CE->getOperand(0))) { 2648cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey GV = cast<GlobalVariable>(CE->getOperand(0)); 2649cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey } else { 2650cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(1)); 2651cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CI && CI->getZExtValue() == 0 && 2652cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "TypeInfo must be a global variable typeinfo or NULL"); 2653cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey GV = NULL; 2654b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2655735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2656735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 2657735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, DAG.getConstant(TypeID, MVT::i32)); 26587a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 26597a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2660b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2661b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2662b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2663b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2664b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 26650b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 26660b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2667c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2668c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2669c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2670c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 26716ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 26726ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 26736ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 26746ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 26756ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 26766ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 26776ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2678c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2679c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2680c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2681c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2682c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 26838b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2684bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2685f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2686f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2687f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 26888b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 26898b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 269051b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 26918b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2692c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 26933f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 26943f108cb5558a80a63711114d819358f19773c057Reid Spencer assert(0 && "bit_part_select intrinsic not implemented"); 26953f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 2696addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 2697a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 2698d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2699d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2700d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2701d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 2702a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 2703a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2704a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2705a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 2706a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2707a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2708a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2709a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2710a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2711c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2712a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2713a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 2714a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2715a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2716a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 2717a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2718a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2719a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2720a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2721a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2722c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2723a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2724a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 2725a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2726a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2727a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 2728a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2729a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2730a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2731a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2732a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2733c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2734a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2735140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2736bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2737f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2738f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2739140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2740140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2741140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2742140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 274339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 274439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 274539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2746140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 274739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2748ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2749ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2750ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 2751c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2752c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2753c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2754c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 27551da20a71d1bbabc472f281208be77475550be751Jim Laskeyvoid SelectionDAGLowering::LowerCallTo(Instruction &I, 27561da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, 27571da20a71d1bbabc472f281208be77475550be751Jim Laskey unsigned CallingConv, 27581da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2759735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Callee, unsigned OpIdx) { 27601da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2761735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 27625694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 2763735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2764735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2765735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2766735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2767735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2768735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2769735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2770735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 277118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Entry.isSExt = Attrs && Attrs->paramHasAttr(i, ParamAttr::SExt); 277218da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Entry.isZExt = Attrs && Attrs->paramHasAttr(i, ParamAttr::ZExt); 277318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Entry.isInReg = Attrs && Attrs->paramHasAttr(i, ParamAttr::InReg); 277418da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Entry.isSRet = Attrs && Attrs->paramHasAttr(i, ParamAttr::StructRet); 2775735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2776735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2777735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2778735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2779735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 278018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), 27811da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2782735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2783735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2784735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2785735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2786735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2787735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2788735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 27891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 279064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2791c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 27925cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (F->isDeclaration()) 2793c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2794c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2795c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2796c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2797c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2798c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2799a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2800a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2801a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2802a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2803a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2804a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2805a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2806a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2807a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2808a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2809a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2810a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2811c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2812c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2813c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2814c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2815c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2816c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2817c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2818c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2819f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2820f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 282106a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2822c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2823f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2824f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2825f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2826c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2827f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2828f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 282906a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2830c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2831f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2832f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2833f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2834f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2835c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2836ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2837ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2838ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2839c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2840edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 284164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 284264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 284364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 284464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 284564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 2846735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 28471da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 28481da20a71d1bbabc472f281208be77475550be751Jim Laskey I.getCallingConv(), 28491da20a71d1bbabc472f281208be77475550be751Jim Laskey I.isTailCall(), 28501da20a71d1bbabc472f281208be77475550be751Jim Laskey Callee, 28511da20a71d1bbabc472f281208be77475550be751Jim Laskey 1); 28521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2854735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2855864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 28569f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 2857864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 2858864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 2859864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 2860864635ad7b3046d3042311423071152c613961deChris Lattner 2861864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 2862864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 2863864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 2864864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 2865864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 2866693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Chain = Hi.getValue(1); 2867693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Flag = Hi.getValue(2); 28689f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 28699f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 28709f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 28719f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 2872864635ad7b3046d3042311423071152c613961deChris Lattner } 2873864635ad7b3046d3042311423071152c613961deChris Lattner 2874cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 2875864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 2876864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 2877864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 2878864635ad7b3046d3042311423071152c613961deChris Lattner 28795df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 28805df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(ValueVT == MVT::Vector && "Unknown vector conversion!"); 28815df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Val, 28825df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner DAG.getConstant(MVT::getVectorNumElements(RegVT), 28835df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner MVT::i32), 28845df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner DAG.getValueType(MVT::getVectorBaseType(RegVT))); 28855df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner } 28865df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 2887cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 2888cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 2889cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2890cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 2891cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2892cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 28935df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 28945df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(MVT::isFloatingPoint(RegVT) && MVT::isFloatingPoint(ValueVT)); 28955df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2896864635ad7b3046d3042311423071152c613961deChris Lattner} 2897864635ad7b3046d3042311423071152c613961deChris Lattner 2898c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2899c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 2900c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 2901c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2902a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 2903a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 2904c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 2905c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 2906c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2907c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 29085df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 29095df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(Val.getValueType() == MVT::Vector &&"Not a vector-vector cast?"); 29105df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner Val = DAG.getNode(ISD::VBIT_CONVERT, RegVT, Val); 29111a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isInteger(RegVT) && MVT::isInteger(Val.getValueType())) { 29120c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 29130c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 29140c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 29150c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 29161a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isFloatingPoint(RegVT) && 29171a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::isFloatingPoint(Val.getValueType())) { 2918c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 29191a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::getSizeInBits(RegVT) == 29201a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::getSizeInBits(Val.getValueType())) { 29211a6acc214dc066ea08365b605e109203e9164068Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, RegVT, Val); 29221a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else { 29231a6acc214dc066ea08365b605e109203e9164068Chris Lattner assert(0 && "Unknown mismatch!"); 29241a6acc214dc066ea08365b605e109203e9164068Chris Lattner } 2925c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2926c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 2927c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2928c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 29299f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 29309f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 29319f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 29329f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 29339f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 2934c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 2935a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 29369f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 2937c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2938c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2939c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2940c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2941864635ad7b3046d3042311423071152c613961deChris Lattner 2942c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2943c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2944c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2945c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 29469f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 29474b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 29484b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 2949c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 2950c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 2951c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2952864635ad7b3046d3042311423071152c613961deChris Lattner 2953864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 2954864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 2955864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 2956864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 29579b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 29589b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 2959f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 2960f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 29619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 29629b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 2963f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 2964f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 29659b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 29669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 29679b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 29689b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 29699b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 29709b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 2971f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 2972f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 2973f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 2974f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 2975f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 2976f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 2977f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2978f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 29799b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 29809b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 29819b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2982f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 29839b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2984864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 2985864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 2986864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 2987864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 29889b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 29899b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 2990f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 2991f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 2992f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 2993f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 2994f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 2995f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2996f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 2997864635ad7b3046d3042311423071152c613961deChris Lattner } 2998f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 2999864635ad7b3046d3042311423071152c613961deChris Lattner} 3000864635ad7b3046d3042311423071152c613961deChris Lattner 3001864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 3002864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 3003864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 3004864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 30054e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3006864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3007864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 3008864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3009864635ad7b3046d3042311423071152c613961deChris Lattner 3010864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 3011864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3012864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 3013864635ad7b3046d3042311423071152c613961deChris Lattner 30142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 30152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3016864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3017864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 3018864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3019cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3020cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3021cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3022cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3023cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3024864635ad7b3046d3042311423071152c613961deChris Lattner 3025864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3026864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3027864635ad7b3046d3042311423071152c613961deChris Lattner 3028864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3029864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3030864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3031864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3032864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3033864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3034864635ad7b3046d3042311423071152c613961deChris Lattner 3035864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3036864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3037864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3038864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3039864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3040864635ad7b3046d3042311423071152c613961deChris Lattner } 3041864635ad7b3046d3042311423071152c613961deChris Lattner } 3042864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 3043864635ad7b3046d3042311423071152c613961deChris Lattner } 3044864635ad7b3046d3042311423071152c613961deChris Lattner 30452a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 30462a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 30472a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 30482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (PhysReg.second) { 30492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 30502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 30512a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 30522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (!isOutReg || !isInReg) { 30532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (VT == MVT::Other) 30542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner ValueVT = *PhysReg.second->vt_begin(); 30552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 30562a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 30572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 30582a821601f1db665fbb825727aacf1a54d17b91efChris Lattner SSARegMap *RegMap = DAG.getMachineFunction().getSSARegMap(); 30592a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 30602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 30612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 30622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 30632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 30642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 30652a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 30662a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 30672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 30682a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 30692a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 30702a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 30712a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 30722a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 30732a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 30742a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3075864635ad7b3046d3042311423071152c613961deChris Lattner 30764e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 30774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 3078864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3079864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3080864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 30814e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3082864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3083864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3084864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3085864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3086864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3087864635ad7b3046d3042311423071152c613961deChris Lattner } 3088864635ad7b3046d3042311423071152c613961deChris Lattner 30894e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 30904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 30919b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 3092864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 3093864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3094864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3095864635ad7b3046d3042311423071152c613961deChris Lattner continue; 30964e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 30974e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3098864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3099864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3100864635ad7b3046d3042311423071152c613961deChris Lattner 3101e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3102864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3103864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3104864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3105864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3106864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 3107864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 3108864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 3109864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 3110864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 3111864635ad7b3046d3042311423071152c613961deChris Lattner } 3112864635ad7b3046d3042311423071152c613961deChris Lattner 3113864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 3114864635ad7b3046d3042311423071152c613961deChris Lattner } 31154e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3116864635ad7b3046d3042311423071152c613961deChris Lattner 3117864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3118864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 31194e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 31204e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3121367f109ba954239a348c624a3331422bfdb31d03Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 3122367f109ba954239a348c624a3331422bfdb31d03Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 3123367f109ba954239a348c624a3331422bfdb31d03Chris Lattner switch (CT) { 3124367f109ba954239a348c624a3331422bfdb31d03Chris Lattner default: assert(0 && "Unknown constraint type!"); 3125367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Other: 3126367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Unknown: 3127367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 0; 3128367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Register: 3129367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 1; 3130367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_RegisterClass: 3131367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 2; 3132367f109ba954239a348c624a3331422bfdb31d03Chris Lattner case TargetLowering::C_Memory: 3133367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return 3; 3134367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 3135367f109ba954239a348c624a3331422bfdb31d03Chris Lattner} 3136367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 3137367f109ba954239a348c624a3331422bfdb31d03Chris Lattnerstatic std::string GetMostGeneralConstraint(std::vector<std::string> &C, 3138367f109ba954239a348c624a3331422bfdb31d03Chris Lattner const TargetLowering &TLI) { 3139367f109ba954239a348c624a3331422bfdb31d03Chris Lattner assert(!C.empty() && "Must have at least one constraint"); 3140367f109ba954239a348c624a3331422bfdb31d03Chris Lattner if (C.size() == 1) return C[0]; 3141367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 3142367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string *Current = &C[0]; 3143367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 3144367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 31454234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner TargetLowering::ConstraintType Flavor = TLI.getConstraintType(Current[0]); 3146367f109ba954239a348c624a3331422bfdb31d03Chris Lattner for (unsigned j = 1, e = C.size(); j != e; ++j) { 31474234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner TargetLowering::ConstraintType ThisFlavor = TLI.getConstraintType(C[j]); 3148367f109ba954239a348c624a3331422bfdb31d03Chris Lattner if (getConstraintGenerality(ThisFlavor) > 3149367f109ba954239a348c624a3331422bfdb31d03Chris Lattner getConstraintGenerality(Flavor)) { 3150367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // This constraint letter is more general than the previous one, 3151367f109ba954239a348c624a3331422bfdb31d03Chris Lattner // use it. 3152367f109ba954239a348c624a3331422bfdb31d03Chris Lattner Flavor = ThisFlavor; 3153367f109ba954239a348c624a3331422bfdb31d03Chris Lattner Current = &C[j]; 3154367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 3155367f109ba954239a348c624a3331422bfdb31d03Chris Lattner } 3156367f109ba954239a348c624a3331422bfdb31d03Chris Lattner return *Current; 3157367f109ba954239a348c624a3331422bfdb31d03Chris Lattner} 3158367f109ba954239a348c624a3331422bfdb31d03Chris Lattner 3159864635ad7b3046d3042311423071152c613961deChris Lattner 3160ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3161ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3162ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 3163ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 3164ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3165ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 3166ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 3167ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 31682cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 31691efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 3170ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3171ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 3172ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 3173ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 3174ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 3175ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 3176ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 3177ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3178ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3179ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3180ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 31814e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 31824e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 31834e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 31844e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 31854e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 31861efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 31874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 3188367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string ConstraintCode = 3189367f109ba954239a348c624a3331422bfdb31d03Chris Lattner GetMostGeneralConstraint(Constraints[i].Codes, TLI); 31902223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 31911efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 31921efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 31931efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 31941efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 31951efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 31961efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 31971efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 31981efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 31991efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 320022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 32011efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 32021efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 32031efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 32041efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 32051efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 32061efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 32071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 32081efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 32091efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 32101efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 32111efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 32121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 32131efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 32141efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 32151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3216864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 3217864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 32181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3219864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 3220864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 3221864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 3222864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 3223864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 32244e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 32254e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 32264e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 32274e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 3228864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 32294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 32304e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 32312223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 3232864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 32334e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 32341efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 32351efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 3236864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 32371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 32384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 32394e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 3240864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 3241864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 32424e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 32434e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 32444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 32452cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 32460f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 32470f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3248864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 3249864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 32501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 32510f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 32526656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 3253367f109ba954239a348c624a3331422bfdb31d03Chris Lattner std::string ConstraintCode = 3254367f109ba954239a348c624a3331422bfdb31d03Chris Lattner GetMostGeneralConstraint(Constraints[i].Codes, TLI); 32551efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 32562cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 32572cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 325822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 325922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 32604234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner CTy = TLI.getConstraintType(ConstraintCode); 326122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 326222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 326322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 326422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 326522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 326622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 326722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 326822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 326922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 327022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 327122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 327222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 327322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 327422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 327522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 327622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 327722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 327822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 327922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 328022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 328122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 328222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 328322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 328422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 328522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 328622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 328722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 328822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 328922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 329022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 329122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3292864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 3293864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 3294864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 3295864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 3296864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 3297864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 32982223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 3299864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3300864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3301864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 3302864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 3303864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 3304864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 3305d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner if (Regs.Regs.empty()) { 3306832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 3307832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 3308d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3309d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 33102cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 33112cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 3312864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 33132cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 33142cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3315864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 33162cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 331722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 331822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 33192cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 33202cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 33216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 33226656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 33236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3324c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 33256656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 33266656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 33276656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 332822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 33294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 33303d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 33312223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 33322223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 33332223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 33342223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 33353d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3336c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3337c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3338c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3339c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3340c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3341c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3342c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3343a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3344a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3345c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3346c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3347c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3348c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3349c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3350c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3351527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3352527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3353527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3354527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3355527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3356527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3357527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3358527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3359527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3360527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3361c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3362527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3363527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 3364527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner TLI.getPointerTy()); 3365527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3366527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3367527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3368527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3369527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3370c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 337187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 337287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 337387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 337487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 33754234f57fa02b1f04a9f52a7b3c2aa22d32ac521cChris Lattner CTy = TLI.getConstraintType(ConstraintCode); 33763d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 337787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 337853069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 337953069fbbae2558a3138df24776448791fea3aceeChris Lattner ConstraintCode[0], DAG); 338053069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 3381832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 3382832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 338353069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 338453069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3385c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 338687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 338787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 338887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 338987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 339087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 339187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 339287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 339387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 33946dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner // If the operand is a float, spill to a constant pool entry to get its 33956dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner // address. 33966dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner if (ConstantFP *Val = dyn_cast<ConstantFP>(I.getOperand(OpNum-1))) 33976dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner InOperandVal = DAG.getConstantPool(Val, TLI.getPointerTy()); 33986dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner 3399b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) { 34006dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner cerr << "Match failed, cannot handle this yet!\n"; 34016dfc6806bf4091cc736312a3ceca6225f81ef63eChris Lattner InOperandVal.Val->dump(); 3402b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner exit(1); 3403b4ddac9bf7b9d4aa7267702f375647b370ad32f4Chris Lattner } 3404c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 340587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 340687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 340787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 340887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 340987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 341087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 341187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 341287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 341387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 341487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 341587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3416c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 34172223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 341887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 341987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 342087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 342187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 342287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 342387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 342487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 342587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 342687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 342787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3428a844126c43976387a66dafbe5137a762169f1f34Evan Cheng InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, TLI.getPointerTy()); 342987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 343087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 34316656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 34326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3433c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3434c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 3435c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 3436c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 3437c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3438c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3439c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 3440c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 34416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 34426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3443c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 34446656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3445ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3446ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3447ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3448ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3449ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3450f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3451f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3452bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3453ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3454ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 34566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 3457864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 3458864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 34596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 34606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 34616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 34626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 34636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 34646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3465864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 34666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3467864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 3468864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 34696656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3470ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34716656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3472bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 34736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 3474786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 34756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 34768b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 34776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3478bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3479bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3480ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3481ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3482ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3483ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 34851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 34861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 348868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 348968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 349068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 349168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 349268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 34931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3495a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 34961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 34971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 34981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 349947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 350047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 350147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 350247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 350347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3504cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3505cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 350647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3507cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3508cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3509cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3510cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 35111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 35131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 351447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 351547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 351647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 351747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 351847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 35191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3520cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 352147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3522cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3523cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 35241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3526025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3527025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3528025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3529025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3530025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3531025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3532025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3533832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3534832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3535832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3536025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3537025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3538025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3539025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 354039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3541acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3542acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3543acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 354439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 354539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 35461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3547acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3548acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3549acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3550acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3551acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 35521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 35541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3555acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3556acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3557acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 35581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 35601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3561acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3562acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3563acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3564acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3565acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 35661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3568b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either 3569b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate. 3570b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg, 3571b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned &i, SelectionDAG &DAG, 3572b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 3573b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) 3574b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(Arg, i++); 3575b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3576b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3577b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3578b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3579b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BIT_CONVERT, VT, 3580b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI)); 3581b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3582b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3583b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3584b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3585b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 3586b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi); 3587b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3588b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3589b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3590b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3591b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(); 3592b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3593b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3594fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3595fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3596f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3597f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3598fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3599fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3600b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 36015694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 3602fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3603fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 36048c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3605fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3606fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3607fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3608fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3609fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 36106aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3611ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3612ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3613fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3614d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 36157aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3616d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 36177aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3618ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3619ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 362018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt)) 3621d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 362218da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt)) 3623d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 362418da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg)) 3625d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 362618da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet)) 3627d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3628d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3629ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3630fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3631fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3632fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3633fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3634b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3635fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3636fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3637fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3638b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3639fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3640fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3641fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3642fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 3643fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 3644fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 36459f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 36469f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3647b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov for (unsigned i = 0; i != NumVals; ++i) { 3648fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 3649cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 36500db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (i > 0) 3651d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3652d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3653b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3654b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov } 3655fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3656fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3657fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 36589d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(I->getType())->getNumElements(); 36599d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(I->getType())->getElementType(); 3660f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3661fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3662ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3663fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3664fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3665fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 3666b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3667fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3668fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3669fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3670fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3671fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3672fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3673fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 36743b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 36758c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3676fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3677fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3678f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3679f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3680bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 36818c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 36828c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 3683fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3684fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3685fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3686fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 368747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 368847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 368947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3690fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3691fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3692fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3693fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3694fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3695fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3696fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3697fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3698fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3699fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 370018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt)) 3701f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3702f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 370318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt)) 3704f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3705f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3706fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3707fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3708fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3709fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3710fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3711fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3712fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3713fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3714fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3715fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3716b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // If this is a large integer or a floating point node that needs to be 3717b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // expanded, it needs to be reassembled from small integers. Figure out 3718b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // what the source elt type is and how many small integers it is. 3719b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this)); 3720fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3721fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3722fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 37239d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(I->getType()); 3724020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 3725020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 3726f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3727fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3728ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3729fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3730d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3731020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 3732020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 3733d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 3734d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3735d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3736d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 3737d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 3738fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3739da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3740fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3741fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3742fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3743fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3744fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3745fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3746fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3747fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3748f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3749b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarCallArgs - Recursively expand call argument node by 3750b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_converting it or extract a pair of elements from the larger node. 3751b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg, 37527aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned Flags, 3753b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SmallVector<SDOperand, 32> &Ops, 3754b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SelectionDAG &DAG, 37557aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio TargetLowering &TLI, 37567aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio bool isFirst = true) { 37577aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3758b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) { 3759cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 37607aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio if (!isFirst) 3761d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3762d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3763b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(Arg); 3764b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3765b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return; 3766b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3767b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3768b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3769b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3770b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3771b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg); 37727aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Arg, Flags, Ops, DAG, TLI, isFirst); 3773b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3774b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3775b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(0, TLI.getPointerTy())); 3776b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3777b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(1, TLI.getPointerTy())); 3778b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3779b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 37807aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Lo, Flags, Ops, DAG, TLI, isFirst); 37817aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Hi, Flags, Ops, DAG, TLI, false); 3782b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3783b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3784b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3785b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3786b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3787b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3788f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3789f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3790f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3791f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3792f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 379347857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 379447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3795f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3796f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3797f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3798be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3799f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3800f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3801f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3802f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3803f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3804f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3805f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3806f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 380747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 380847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 3809d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 38107aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3811d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 38120db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3813d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3814d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 3815d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 3816d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 38170db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 3818d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 38190db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 3820d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3821d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 38220db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3823f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3824f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 38257aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 3826f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3827b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3828f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3829f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3830f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3831d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 3832d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3833d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 3834d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 3835d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 3836d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 3837d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 3838f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 3839f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3840f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3841f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 3842f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3843f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3844b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3845f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3846f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3847f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3848f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 3849f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3850f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 3851b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov ExpandScalarCallArgs(VT, Op, Flags, Ops, DAG, *this); 3852f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3853da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3854da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 38559d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(Args[i].Ty); 3856da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3857da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3858da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3859da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3860ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3861da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 38621b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3863ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // Insert a VBIT_CONVERT of the MVT::Vector type to the vector type. 38641b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 38651b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 3866b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 38671b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 3868da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 3869da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3870da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3871f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3872f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3873f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3874f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3875f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3876f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 3877be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<MVT::ValueType, 4> RetTys; 3878f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3879f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 3880f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3881f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3882f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3883f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3884f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 3885f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3886f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3887f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 3888f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3889f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3890f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3891f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 3892f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3893f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 38949f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 38959f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3896f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 3897f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 3898f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3899da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3900da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 39019d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(RetTy); 3902da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3903da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3904da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3905da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3906ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3907da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3908da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3909da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 3910da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3911da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 3912da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3913da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3914f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3915f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3916f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3917f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3918f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 3919f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3920f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 3921be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 3922be384162c68641233deba8702666af51bdfd4b83Chris Lattner DAG.getVTList(&RetTys[0], RetTys.size()), 3923be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 3924f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3925f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 3926f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 3927f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 3928f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 3929f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 3930f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3931f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 3932f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 3933f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3934f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 3935f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 3936da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 39375df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner // Insert a VBIT_CONVERT to convert from the packed result type to the 3938da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 39399d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(RetTy)->getNumElements(); 39409d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(RetTy)->getElementType(); 3941da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3942da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3943ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3944fea997aac5773e936754de5436029c2a4fa1e930Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy),NumElems); 3945da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3946da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 3947da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 3948da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 3949d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3950d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3951da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3952da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3953da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3954da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 395547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned AssertOp = ISD::AssertSext; 395647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer if (!RetTyIsSigned) 395747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer AssertOp = ISD::AssertZext; 3958f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 3959f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 3960f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 3961f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3962f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 39631a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng if (getTypeAction(VT) == Expand) 39641a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::BIT_CONVERT, VT, ResVal); 39651a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng else 39661a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 3967f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3968f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3969f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 3970f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 3971f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 3972f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3973f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3974f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 3975f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3976f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3977f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3978f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 3979f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 3980f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 398150381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 3982171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 3983171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 3984d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 3985171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 3986171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 39870aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 39880aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 39890aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 39900aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 39910aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 39920aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 39930aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 399474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 39951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 39961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 3997a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 39981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 39991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 40001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 40011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 40021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 40031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 40041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 40051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 40061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 40071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 40081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 40091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 40101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 40111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 40121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 40131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 40141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 40151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 40161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 40171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 40181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 40191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 40201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 40211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 40221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 40231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 402474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 402574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 402674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 402774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 402874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 402974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 403074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 403174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 403274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 403374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 403474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4035a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 403674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 403774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 403874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 403974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 404074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 40411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 40421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 40431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 40441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 40451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 40461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 40471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4048c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 404980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 405080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4051c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4052c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4053c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 40541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 40551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 40561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 40571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 40581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 40591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 40601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 40611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 40621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 40631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 40641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 40651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 40661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 40671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 40681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 40691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 40701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 40711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 40721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 40731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 40741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 407580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 407680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 407780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 407880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 40791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 408080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 408180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 408280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4083dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 40841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 40851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 40861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 40871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 40881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 40891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 409080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 409180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 409280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 409380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 40941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 40951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 40961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 409780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 409880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 40991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41017041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 41021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 41031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 41041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 41051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 41061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 41071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 41081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 41101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 41111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 41131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4114bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 41151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4116ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 41171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4118c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4119c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 412080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 41211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 41221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 41231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 41241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 4125a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4126786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4127864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 41288b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4129c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4130c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4131c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4132c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4133c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4134c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4135c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4136c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4137c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4138c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4139cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 414074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 414174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4142cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 414374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 414474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 414574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 414674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 414774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 414874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 414974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4150cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 415174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 415274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 415374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4154f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 41550937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4156cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4157cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4158cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4159cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4160cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 416174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 416274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4163c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4164c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4165c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 416674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 416774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4168cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 416974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 417074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 417174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4172786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4173786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 41748b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 417574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 417674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 417774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4178466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 417974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 418074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4181786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4182786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 41838b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 418474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4185c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 418674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 418774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 41881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4190c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 41911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4193c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4194c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4195bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4196bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4197c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4198c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 41991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4201bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 42021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42047041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 42057041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 42067041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 42071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 42091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 42101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4212495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4213c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4214c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4215495a0b51915eb763576874f29192820b731edc22Chris Lattner} 42161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4217c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4218bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 42191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 42201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 42211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4222832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 42231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 42251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 42271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4228edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4229ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4230ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4231ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4232ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4233ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4234ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4235ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4236ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 42371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 42381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4240571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4241571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4242571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 424318c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4244d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 424518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4246d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4247d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 4248d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 4249d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4250d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 4251d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 4252571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 42531c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 425470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 425570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 42569d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(cast<VectorType>(V->getType()), 425770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 42581c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 425970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 426070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 426170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 426270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 426370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 426470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 426570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 426670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 426770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 4268bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 4269571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Root = getRoot(); 427070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 427170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 4272a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(i, TLI.getPointerTy())); 427370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 427470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 427570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 427670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 427770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 427870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 427970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 428070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 428170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 428270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 428370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 428470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 428570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 428670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4287a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 428870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4289a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 429070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 429170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 429270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 42931c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 4294bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, 4295bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 42969f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) { 4297d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 4298fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 4299fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 4300fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 4301fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 4302571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 4303d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 43049f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DestVT = TLI.getTypeToExpandTo(SrcVT); 43059f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(SrcVT); 43069f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 43079f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng return DAG.getCopyToReg(getRoot(), Reg, 43089f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getNode(ISD::BIT_CONVERT, DestVT, Op)); 43099f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 4310d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 4311d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4312a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 4313d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4314a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 4315571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Op = DAG.getCopyToReg(getRoot(), Reg, Lo); 4316d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 4317d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 43181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4320068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 432115699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4322068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 43231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 432415699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 43250afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4326bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4327bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4328bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4329bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4330bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4331bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4332bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4333bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4334f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4335bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4336bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4337251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4338251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4339251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4340bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4341bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 43420afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4343bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4344bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4345966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4346bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4347068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4348068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4349068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4350068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4351f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4352068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 4353068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4354068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4355edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4356bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4357ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4358bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 43591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 43611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 43621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 43641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 43651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 43661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4367183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey 4368183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Lower call part of invoke. 4369183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey InvokeInst *Invoke = dyn_cast<InvokeInst>(LLVMBB->getTerminator()); 4370183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (Invoke) SDL.visitInvoke(*Invoke, false); 4371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 43721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 43731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 43741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4375f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 43769f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 43771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4378ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4379571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 43801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 43811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 43831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 43841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 43851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 43861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 43871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4388edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 43898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 43901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 43921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4393d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 43948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 43958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 43968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 43978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 43988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 43991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 44001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 44011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 44021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4403d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 44048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4405d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 44068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 44078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 44088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 44098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 44108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 44118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 44128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 44131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 44141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 44161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 44171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 44181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 44198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 44208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 44218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 44228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 44238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 44248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 44253f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 44268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 44278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 44288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 44298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 44308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 44318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 44321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 44338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 44348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 44358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 44368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 44378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 44388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 44398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 44408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 44418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 44428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 44437e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 44441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 44458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 44468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 44478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 44488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 44498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 44508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 44518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 44528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 44538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 44548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 44559d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 44568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 44578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 44588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 44598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 44608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 44611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 44621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 44631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4464ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 44655a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 44667436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 44677436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 44687436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 44697436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 44707436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 44717436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 44727436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 44737436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 44747436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 44757436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 44767436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 44777436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4478bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4479bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4480ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4481ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 44821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4483183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey if (Invoke) { 4484183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey // Just the branch part of invoke. 4485183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey SDL.visitInvoke(*Invoke, true); 4486183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } else { 4487183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey SDL.visit(*LLVMBB->getTerminator()); 4488183f47fb1aa30ba9a56e645c35a7d798cf7e467cJim Laskey } 4489a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4490f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 449137efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4492f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4493f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 44943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 44953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 44964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 44974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 44984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4499a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4500a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 45011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4504c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4505c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4506c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4507af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4508c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 45092300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4510832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 45111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4512f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 45131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 45141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4515ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4516f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4517832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 45181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4519f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4520af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4521c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 45222300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4523a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4524552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4525a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4526a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4529832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 45301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4531f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4532f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4535f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4536f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 453744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4539f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4540f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4541f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4542f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 45431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4544f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4545f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4546f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 45474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 45484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 45494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 45504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 45514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 45524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4554a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 45551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 45564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4559f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4560f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 456109e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4562f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4563f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4564f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 45651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 45674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 45684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 45694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 45704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 45714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 45724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 45734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 45744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 45754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 45764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 45774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 45784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 45794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 45804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 45814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 45824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 45834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 45844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 45854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering BSDL(BSDAG, TLI, FuncInfo); 45864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 45874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 45884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 45894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 45904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 45914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 45924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 45934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 45944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 45954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 45964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 45974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 45984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 45994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 46014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 46024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 46054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 46064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 46074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 46084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 46094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 46104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 46114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 46124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 46134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 46144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent); 46154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB); 46164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 46184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 46194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 46204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 46214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 46224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 46234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(cBB); 46244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46299453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 46309453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 46319453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 46323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 46333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 46343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 46353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 46363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 46373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 46383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 46393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 46403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 46413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 46423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 46433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 46443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 46454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 46473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 46483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 46493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering JSDL(JSDAG, TLI, FuncInfo); 465037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 46513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 46523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 465337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 46543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 46553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 46563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 46573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 465837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 465937efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 466037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 466137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 466237efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 466337efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 46644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 46653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 466609e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 46673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4668f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 46694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4670f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 467109e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4672f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 467337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 467437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 467537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 467637efe6764568a3829fee26aba532283131d1a104Nate Begeman 4677b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4678b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4679b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4680b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4681b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4682b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4683b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4684b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4685b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4686b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4687b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4688b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4689f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4690f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4691d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 469244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4693f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4694f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4695d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4696f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4697f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4698f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4699d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4700f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4701f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4702f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4703f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4704d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4705d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4706d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4707d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4708d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 470957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4710d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4711d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4712d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4713d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4714d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4715d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4716d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4717d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4718d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4719d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4720d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4721f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4722d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4723d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 472457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 472557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4726d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4727d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 47282452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 472957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4730f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 473157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4732a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 47331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4734a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 473513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4736a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4737a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4738a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4739a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4740a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 474113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4742eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 474313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 474413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4745eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 47469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 47474ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 474813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 47499ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4750a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4751cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4752a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 47530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 475403fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 47559ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 47569ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 47579ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 47589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4759755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4760755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4761755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4762755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4763755480681c795d585c73556c028b6143c46bda86Chris Lattner 4764755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4765755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4766755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4767755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4768755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4769755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4770755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4771755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4772755480681c795d585c73556c028b6143c46bda86Chris Lattner 4773755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4774755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4775755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4776755480681c795d585c73556c028b6143c46bda86Chris Lattner 4777755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4778755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4779755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4780755480681c795d585c73556c028b6143c46bda86Chris Lattner 4781755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4782755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4783755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4784755480681c795d585c73556c028b6143c46bda86Chris Lattner if (getTargetLowering().MaskedValueIsZero(LHS, NeededMask)) 4785755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4786755480681c795d585c73556c028b6143c46bda86Chris Lattner 4787755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4788755480681c795d585c73556c028b6143c46bda86Chris Lattner 4789755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4790755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4791755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4792755480681c795d585c73556c028b6143c46bda86Chris Lattner 4793755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4794755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4795755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4796755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4797755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4798755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4799755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4800755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4801755480681c795d585c73556c028b6143c46bda86Chris Lattner 4802755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4803755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4804755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4805755480681c795d585c73556c028b6143c46bda86Chris Lattner 4806755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4807755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4808755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4809755480681c795d585c73556c028b6143c46bda86Chris Lattner 4810755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4811755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4812755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4813755480681c795d585c73556c028b6143c46bda86Chris Lattner 4814755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4815755480681c795d585c73556c028b6143c46bda86Chris Lattner getTargetLowering().ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4816755480681c795d585c73556c028b6143c46bda86Chris Lattner 4817755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4818755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4819755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4820755480681c795d585c73556c028b6143c46bda86Chris Lattner 4821755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4822755480681c795d585c73556c028b6143c46bda86Chris Lattner 4823755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4824755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4825755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4826755480681c795d585c73556c028b6143c46bda86Chris Lattner 48279ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 48280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 48290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 48300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 48310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 48320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 48330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 48340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 48350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 48360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 48370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 48380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 48390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 48400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 48410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 48420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 48430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 48440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 48450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 48460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 48470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 48480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 48490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 48500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 48510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 48520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 4853832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 48540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 48550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 48560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 48570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 48584b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 485936d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 48604b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 48610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 48620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 48630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 48640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 48650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 48660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 48670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 48680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 48690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 4870