SelectionDAGISel.cpp revision 51eaa86758338d5935c0eff0469c418b1256aba7
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 85bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { struct AsmOperandInfo; } 86bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 87864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 88864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 89864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 90864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 91864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 929525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 93864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 94864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 95864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 96864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 97864635ad7b3046d3042311423071152c613961deChris Lattner 98864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 99864635ad7b3046d3042311423071152c613961deChris Lattner /// 100864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 101864635ad7b3046d3042311423071152c613961deChris Lattner 102864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 103864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 104864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 105864635ad7b3046d3042311423071152c613961deChris Lattner 106864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 107864635ad7b3046d3042311423071152c613961deChris Lattner 108864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 109864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 110864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 111864635ad7b3046d3042311423071152c613961deChris Lattner } 112864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 113864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 114864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 115864635ad7b3046d3042311423071152c613961deChris Lattner } 116864635ad7b3046d3042311423071152c613961deChris Lattner 117864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 118864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 119864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 120864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1219f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 124c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 125c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 127a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 128a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 132c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1349f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 135864635ad7b3046d3042311423071152c613961deChris Lattner }; 136864635ad7b3046d3042311423071152c613961deChris Lattner} 1374ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 160f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 161f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1759f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 190571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 191edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1933c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 204f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 209f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 210571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 211f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 216bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 217f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 218f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 219bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 225bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 226bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 228edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 231bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 232bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 23316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 23416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 235bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 240bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2412aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 244b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 246a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 247ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 248d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 249ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 250a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 251b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 252d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 2546266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2572aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2582aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2672aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 2808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 2818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 2828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 2838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 2848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 2859d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 2868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 287f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 290c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 2918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 292c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 2941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 307ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, figure out what type it will decompose into 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3109d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(V->getType()); 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 313b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman MVT::ValueType VecTy = MVT::getVectorType(EltTy, NumElts); 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 31795b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling while (NumElts > 1 && !TLI.isTypeLegal(VecTy)) { 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 320b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman VecTy = MVT::getVectorType(EltTy, NumElts); 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 32295b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 32395b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling // Check that VecTy isn't a 1-element vector. 32495b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling if (NumElts == 1 && VecTy == MVT::Other) 3256cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3266cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 32795b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling VT = VecTy; 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 32995b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3433c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3443c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3453c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3469f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng VT = TLI.getTypeToExpandTo(VT); 3479f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned R = MakeReg(VT); 3483c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3499f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MakeReg(VT); 3503c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3513c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3620da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 364d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 365d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 366d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 367d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 368d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 369d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 409f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 410f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 411f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 412f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 413f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 414f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 415f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 416f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 417b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 418b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 4195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 4245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 429f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 438f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 445a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 447f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 448f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 449f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 454f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 460edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 465a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 466a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 467a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 468d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 469d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 470edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 471d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 472d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 473d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 474d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 475d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 476d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 477d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 478d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 479bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 480bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 481d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 482d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 483d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 484a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 485a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 486571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 487571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4911e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4921e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 5001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 506466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 50795c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 513199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5150da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 5171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 5180da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 5191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5204e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 521e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 522e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 523e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 524f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 525571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 526571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 527571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 529571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5301da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 5311da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 532070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov bool IsTailCall, SDOperand Callee, unsigned OpIdx, 533070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 534070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 5351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 542dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 546dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 550dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 553b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 56337efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 566f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 568b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 569b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 57124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitScalarBinary(User &I, unsigned OpCode); 57224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitVectorBinary(User &I, unsigned OpCode); 57324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitEitherBinary(User &I, unsigned ScalarOp, unsigned VectorOp); 574e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5755fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5769d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 57724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VADD); 57824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 57924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FADD); 5801628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 58124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::ADD); 58201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 583b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5841628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5859d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 58624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VMUL); 58724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else if (I.getType()->isFloatingPoint()) 58824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FMUL); 5891628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 59024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::MUL); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 59224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitURem(User &I) { visitScalarBinary(I, ISD::UREM); } 59324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSRem(User &I) { visitScalarBinary(I, ISD::SREM); } 59424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFRem(User &I) { visitScalarBinary(I, ISD::FREM); } 59524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitUDiv(User &I) { visitEitherBinary(I, ISD::UDIV, ISD::VUDIV); } 59624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitSDiv(User &I) { visitEitherBinary(I, ISD::SDIV, ISD::VSDIV); } 59724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitFDiv(User &I) { visitEitherBinary(I, ISD::FDIV, ISD::VSDIV); } 59824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitAnd (User &I) { visitEitherBinary(I, ISD::AND, ISD::VAND ); } 59924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitOr (User &I) { visitEitherBinary(I, ISD::OR, ISD::VOR ); } 60024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitXor (User &I) { visitEitherBinary(I, ISD::XOR, ISD::VXOR ); } 60124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 6023822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 6033822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 60445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 60545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 6063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 6073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 6083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 6093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 6103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 6113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 6123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 6133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 6143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 6153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 6163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 6173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 6183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6202bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 6212bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 6223e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 623c7029805ef35ce9805931067b841e6af11db382eChris Lattner 6241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 6251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 6261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 6281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 6291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 6301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 6311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 6321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 6331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 634ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 635c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6360eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6437041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 656199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 657199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 658199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 659199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 660199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 661199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 662199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 663199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 6650da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 6660da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 6670da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 668199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 669199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 670199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 671199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 672199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 6739d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 67423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 67523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 676b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 6779d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 67823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 67923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 68023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 681bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 68223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 68323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 68423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 68523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 68623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 687bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, 688bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 689199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 690199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 6919d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 692199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 693199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 694199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 695199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 696199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 697199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 698bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 6999d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 7002bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 7012bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 702199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 703199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 706199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 707199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 708199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 709199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 710199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 711199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 712b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 71323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 71423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 7150da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return NodeMap[V] = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], 7160da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 717199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 718199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 7196b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 720199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 721199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 722199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 723199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 724199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 725199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 726199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 727199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 728199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 729199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 730251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 731251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 732199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 733199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 73470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 7359f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Expand) { 73670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 737251db1890c1fe03d02ee878ada8129537844d031Chris Lattner // register pair InReg and InReg+1. 7389f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToExpandTo(VT); 7399f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(VT); 7409f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7419f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 7429f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BIT_CONVERT, VT, N); 7439f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng else { 7449f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 7459f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 7469f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 7479f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } 7489f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else { 7499f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 7509f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7519f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Promote) // Promotion case 7529f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = MVT::isFloatingPoint(VT) 7539f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng ? DAG.getNode(ISD::FP_ROUND, VT, N) 7549f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng : DAG.getNode(ISD::TRUNCATE, VT, N); 755199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 75670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 75770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 75870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 75970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 7609d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 7619d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(PTy, PTyElementVT, 76270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 76370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 7646595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman // Build a VBUILD_VECTOR or VCONCAT_VECTORS with the input registers. 765bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 76670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 76770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 76870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 76970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 77070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 77170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 772fa73ea2d9fd785a214256ca44488407b26c5a3dbDan Gohman // If the register was promoted, use TRUNCATE or FP_ROUND as appropriate. 77370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 77470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 7752046e12f022ad098fe84776d55f4ea1a5e342c85Dan Gohman PTyLegalElementVT); 77670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 77770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 77870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 77970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 78070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 78170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 78270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 78370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 78470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 7852046e12f022ad098fe84776d55f4ea1a5e342c85Dan Gohman for (unsigned i = 0; i != NE; ++i) { 78670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 7872046e12f022ad098fe84776d55f4ea1a5e342c85Dan Gohman PTyLegalElementVT); 78870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 7892046e12f022ad098fe84776d55f4ea1a5e342c85Dan Gohman PTyLegalElementVT); 7902046e12f022ad098fe84776d55f4ea1a5e342c85Dan Gohman Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, PTyElementVT, Op0, Op1)); 79170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 79270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 79370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 7946595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman if (MVT::isVector(PTyElementVT)) { 7956595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman Ops.push_back(DAG.getConstant(NE * MVT::getVectorNumElements(PTyElementVT), MVT::i32)); 79651eaa86758338d5935c0eff0469c418b1256aba7Dan Gohman Ops.push_back(DAG.getValueType(MVT::getVectorElementType(PTyElementVT))); 7976595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman N = DAG.getNode(ISD::VCONCAT_VECTORS, MVT::Vector, &Ops[0], Ops.size()); 7986595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman } else { 7996595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman Ops.push_back(DAG.getConstant(NE, MVT::i32)); 8006595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman Ops.push_back(DAG.getValueType(PTyElementVT)); 8016595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size()); 8026595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman } 803199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 804199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 805199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 806199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 807199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 808199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 8091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 8101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 811a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 8121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 8131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 814bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 815ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 816ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 817ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 818ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 819ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 820ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 821ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 8228e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 8238e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 824ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 825ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 826ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 827ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 828ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 829ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 830ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 83147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 8325694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 833bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 83418da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt)) 8358c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 83618da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt)) 83747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 838376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 839ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 840ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 84147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer NewValues.push_back(DAG.getConstant(false, MVT::i32)); 8421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 843bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 844bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 8451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 8461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 847571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 848571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 849571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 850571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 851571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 852571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 853571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 854571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 855571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 856571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 857571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 858571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 859571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 860571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 8628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 8638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 8648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 8658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 8668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 8678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 8688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 8718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 8758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 8768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 8778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 8788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 8818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 8858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 8878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8886a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 8896a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 8906a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 8916a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 8926a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 8936a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 894571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 895571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 896571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 897571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 898571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 899571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 900571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 901e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 902571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 903e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 904e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 9056a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 9066a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 9076a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 908571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 909571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 910e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 911e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 912e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 913e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 9145a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 9155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 9165a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 9175a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 9185a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 919e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 920e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 921e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 922e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 923e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 924e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 925e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 926e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 927e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 928e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 929e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 930e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 931e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 932e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 933e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 934e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 935e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 936e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 937e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 938e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 939e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 940e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 941e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 942e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 943e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 944e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 945e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 946e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 947e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 948e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 949e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 950e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 951e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 952e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 953e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 954e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 955e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 956e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 957e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 958e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 959e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 960e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 9610da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 962e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 963571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 965571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 9665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 967571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 968571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 969571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 970571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 971571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 9726b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 9735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 974571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 975571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 976571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 977571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 978d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 979d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 980571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 981571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 982571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 983571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 984d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 985d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 986d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 987d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 988d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 989d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 990d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 991d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 992571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 993d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 994d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 995d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 996d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 997d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 998d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 999d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1000d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1001d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1002d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1003d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1004d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1005d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1006d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1007d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1008d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1009d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1010d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1011d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1012d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1013d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1014d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1015571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1016571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1017df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1018df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1019df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1020df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1021df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1022df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1023df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10240ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 10250ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 10260ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 10270ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 10280ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 10290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 10300ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 10310ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 10320ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1033df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1034df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1035df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 10371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 10381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 10391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 10411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 10421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 10431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 10441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 10451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 10471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 10481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1049a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1050dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 105157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 105257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 105357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 105457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 105557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 105657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 105757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 105857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 105957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 106057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 106157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1062571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1063571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1064571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1065571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1066571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1067571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1068571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1069571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1070571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1071571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1072571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1073571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1074571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1075571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1077571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1078571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1079571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1080d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1081571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1082571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 10830ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 10840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 10850ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 10860ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 10870ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1088df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1089df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1090df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1091df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1092df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1093df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1094df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1095df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1096df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1097df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1098df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 10995a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 11005a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 11010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 11020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 11030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 11040ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 11050ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1106df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1107571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1108571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 11092452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 11102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 11116b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 11125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 11132452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 11142452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 11152452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 11161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1118f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1119f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1120f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 112157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 112257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 112357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 11245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 11255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 11265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 11275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 11285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 11295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 11305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 11315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 11325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 11335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 11345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 11355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 11375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 11395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 11405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 11425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 11433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 11455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 11465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 11475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 11485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 11495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 11505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 11525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 11535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1154f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1155f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1156f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1157f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 116357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 116457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1165f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1166f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1167f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1168f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 116957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 117057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1171f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1173f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 117457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1175f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 117657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 117757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1178f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1179f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 11803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 118137efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 118237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1183f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 118437efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 11853d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 11863d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 11873d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 11883d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 11893d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 119037efe6764568a3829fee26aba532283131d1a104Nate Begeman} 119137efe6764568a3829fee26aba532283131d1a104Nate Begeman 11923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 11933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 11943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 11953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 11963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 11973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 11983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 11993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 12003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 12013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 12023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 12033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 12053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 12063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 12073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 12083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 12093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (VT > TLI.getPointerTy()) 12103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 12113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 12123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 12133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 12153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 12163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 12173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 12193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 12203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 12213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 12223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 12233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 12243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 12263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 12273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 12313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 12333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 12343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 12363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 12373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 12383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 12394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 12404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 12423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 12433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 12454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 12464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 12474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 12484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 12494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 12504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 12514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 12524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 12544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 12554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 12564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 12574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 12594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (VT > TLI.getShiftAmountTy()) 12604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 12614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 12624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 12634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 12654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 12664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 12674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 12684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 12704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 12714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 12724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 12744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 12754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 12774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 12784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 12824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 12844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 12854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 12864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 12874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 12884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 12894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 12914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 12924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 12944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 12954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 12974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 12984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 12994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 13004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 13014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 13024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 13044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 13054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 13064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 13074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 13084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 13094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 13104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 13114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 13124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 13194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 13214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 13224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 13244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 13254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 13274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 13284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 13313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1332b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1333b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1334b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1335f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 13369fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1337f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands LowerCallTo(I, I.getCalledValue()->getType(), 1338f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands I.getCallingConv(), 1339f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands false, 1340f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands getValue(I.getOperand(0)), 1341f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 3, LandingPad); 1342f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1343f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1344f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1345f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1346f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1347f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 1348f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second)); 1349f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 13509fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1351f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 1352f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1353f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1354070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1355f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1356f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1357f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1358b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1359b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1360b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1361b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1362b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 13635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1364b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1365dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1366b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1367b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1368b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1369dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1370dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1371dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1372dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 13734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1374dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 13755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1376b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1377b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1378b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1379b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1380b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1381b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1382b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1383b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1384b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1385b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1386b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1387b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1388b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1389b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1390b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1391b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1392b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 13935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1394b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1395b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1396b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 13975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1398b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1399b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1400b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1401b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1402b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1403b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1404b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1405b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1406b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1407b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1408b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1409b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1410b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1411b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1412b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1413b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1414b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1415b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1416b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 14175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 14195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 14205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 14215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 14225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 14235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 14245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 14265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 14275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 14295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1430b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1431b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1432b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1433b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1434b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1435b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1436b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1437b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1438b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1439b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1440b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1441b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1442dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1443dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1444b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1445b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 14467294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 14477294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 14487294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 14497294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 14507294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1451b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1452dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1453b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1454b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1455b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1456dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1457dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1458dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 14605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 14615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 14635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 14645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 14655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1466dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14677294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1468dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1469dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 14715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1472dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1473dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 14755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 14764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 14775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1478b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1479b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1480dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1481b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1482b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1483b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1484b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1485b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1486b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1487b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1488b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1489b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1491b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1492b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1494b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1495b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1496b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1497b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 15014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1502b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1504b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 15065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 15075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 15085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 15095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 15115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 15125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 15135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 15205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1527b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1528b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1529b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1533b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1534b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1535f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1539b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1540b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1543dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1548dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1550b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1553b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1555b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1557b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1558b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1559b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1560b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1562b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1563b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1564b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1565b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1566b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1567b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1568b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1569b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 15715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 15724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 15735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1574b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1575b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1576b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 15775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 15785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 15805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 15815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 15835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 15854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 15864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1587b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 15885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 15895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 15914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1592b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1593b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 159454e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 15954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 15974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 15984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 15994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 16004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1601b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 16024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 16034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1604b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1608b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16097294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 16107294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 16117294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 16127294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 16137294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 16147294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1615b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1617b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 16185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1619b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1620b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1621b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1622b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1623b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1624b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1625b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1626b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1627b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 16285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 16295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 16305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 16315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1634b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1636b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1637b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1638b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1639b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 16435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 16445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 16455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1646b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1649b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1651b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1652b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1653b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1654b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 16555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 16565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1658b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1659b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1662dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1663dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1664b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 16664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 16674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 16684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 16694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 16704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 16714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 16723ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1673b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 16744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 16764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 16774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 16794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 16804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 16814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 16834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 16844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 16854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 16864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 16874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 16884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 16894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 16904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 16934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 16944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 16954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 16964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 16974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 16984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 16994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 17014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 17024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 17044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 17054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 17064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 17074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 17084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 17094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 17104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 17114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1712ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 17154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 17164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 17174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 17194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 17204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 17224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 17234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 17244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1725e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 17264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 17274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 17284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 17294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 17324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 17354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 17364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 17374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 17384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 17394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 17414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 17424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 17434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 17444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 17474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 1750e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 17514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 17524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 17564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 17584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 17604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 17614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 17624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 17644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 17664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 17674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 17684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 17694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1778efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 17915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 17925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 17935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 17945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 17965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 17975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 17985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 17995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 18005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 18015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 18035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 18055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 18065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), J=++(Cases.begin()), E=Cases.end(); J!=E; ) { 18075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 18085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 18095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 18105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 18115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 18135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 18145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 18155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 18165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 18175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 18185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 18195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 18235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 18245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 18255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 18265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 18295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 18305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1832f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1833f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1834f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1835c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 18365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1837d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1838f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1839f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 18405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1841f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1842c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1843f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1844d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1845f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1846d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1847c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1848d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1849f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1850f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1851f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1852f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1853f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1854f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 18555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 18565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 18575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 18585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1859c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1862f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 18635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 186437efe6764568a3829fee26aba532283131d1a104Nate Begeman 18653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 18673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 18683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 18703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 18713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 18723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 18733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 18754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 18764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 18783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1879dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1880dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1881dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 18833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 18843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1885dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1886dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1887dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1888dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 1889dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 1890dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 1891f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1892f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1893f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 18943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1895b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1896b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 189724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 18989d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 189924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, ISD::VSUB); 190024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer } else if (Ty->isFloatingPoint()) { 190101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 190201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 190301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 190401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 190501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 190601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 190724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::FSUB); 19081628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else 190924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ISD::SUB); 1910b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1911b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 191224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitScalarBinary(User &I, unsigned OpCode) { 19131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 19141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 191524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 191624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 19171628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 19181628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 191924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid 192024d6da5fedcf39891f7d8c5b031c01324b3db545Reid SpencerSelectionDAGLowering::visitVectorBinary(User &I, unsigned OpCode) { 19219d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer assert(isa<VectorType>(I.getType())); 19229d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *Ty = cast<VectorType>(I.getType()); 192324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer SDOperand Typ = DAG.getValueType(TLI.getValueType(Ty->getElementType())); 192424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 192524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, MVT::Vector, 192624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(0)), 192724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer getValue(I.getOperand(1)), 192824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer DAG.getConstant(Ty->getNumElements(), MVT::i32), 192924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer Typ)); 193024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer} 19311628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 193224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencervoid SelectionDAGLowering::visitEitherBinary(User &I, unsigned ScalarOp, 193324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer unsigned VectorOp) { 19349d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(I.getType())) 193524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitVectorBinary(I, VectorOp); 193624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer else 193724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer visitScalarBinary(I, ScalarOp); 1938e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 19392c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1940e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1941e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1942e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1943e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1944832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer if (TLI.getShiftAmountTy() < Op2.getValueType()) 1945832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 1946832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 1947832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1948e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 19491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 19501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 19511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 195245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 1953e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 1954e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 1955e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 1956e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 1957e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 1958e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1959e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 196045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 1961e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 196245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 196345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 196445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 196545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 196645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 196745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 196845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 196945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 197045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 197145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 197245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 197345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 197445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 197545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 197645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 197745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 197845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 197945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 198045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 1981e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 1982e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 1983e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 1984e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 1985e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 1986e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1987e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 1988e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 1989e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 1990e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1991e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1992e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1993e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1994e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1995e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1996e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1997e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1998e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1999e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2000e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2001e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2002e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2003e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2004e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2005e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 200645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 200745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2008e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 200945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 201045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2011e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2012e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2013e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2014e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2015e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 20161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 20191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 20201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 20211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 20229d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(I.getType())) { 2023b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 2024b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 2025b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 2026b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 2027b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 2028b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 2029b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 20301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 20343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 20353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 20383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 20413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 20423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 20433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 20463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 20493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 20503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt 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::SIGN_EXTEND, DestVT, N)); 20543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 20573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 20583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 20613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 20643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 20653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 20683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 20713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 20723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 20753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 20783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 20793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 20823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 20853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 20863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 20893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 20923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 20933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 20963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 20993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 21003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 21011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2102e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 210328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 21053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 21063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 21073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 21093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 21103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 21113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 21143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 21153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 21163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 21183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 21203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 21213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 21233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 21243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 21273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 2129e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 21303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast to a vector from something else. 21313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the output vector. 21329d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 2133e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 2134e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 2135e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 2136e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 21373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 21383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer } 21393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 21403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (SrcVT == MVT::Vector) { 21413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast from a vctor to something else. 21423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the input vector. 2143e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 21443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 21451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 21483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 21493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 21503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 21513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 21531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21552bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2156c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2157c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2158c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2159c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2160c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21612332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 21622332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 21632332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 21642332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 2165c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2166c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21672bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2168384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2169384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2170384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 2171384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 2172384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 2173384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2174384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2175c7029805ef35ce9805931067b841e6af11db382eChris Lattner 21763e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 21773e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 21783e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 21793e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 21803e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21813e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 21823e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 21833e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 21843e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 21853e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 21863e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21873e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 21881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 21891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 21901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 21911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 21931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 21941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2195c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2196b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 21971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 21981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2199b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 22001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2201dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 22021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 22041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 22051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 22067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 22087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2209b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 221047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 22110d630d220414b02fed6873555bb46795a682174bEvan Cheng TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 22127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 22137c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 22157c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2217a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 22187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 22197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 22217c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 22227c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 222347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 22247c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 22257c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 22267c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 22287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 22297c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 22307c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 22317c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 22326b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 22331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 22347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 22387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 22397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 22401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 22431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 22461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 22471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 22481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 22491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 22501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2252a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 225358092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2254d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 225558092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 22561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 225868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 225968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 226068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 226168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 226268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 22631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 226468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 22651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 22661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 22681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 22691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 22701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 22711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 22721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 22731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 22761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 22771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 22801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 22811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2283bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2284f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2285f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2286f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 22870da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 22880da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 22891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 22911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 22921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 22931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 22961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2297edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2298d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2299d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2300d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2301d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2302d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2303d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2304d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 230528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2306466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 230795c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 230828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 230928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 231028b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2311466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 231295c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 231395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 23145fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 23159d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(Ty)) { 23164ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 2317466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, 2318466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng DAG.getSrcValue(SV)); 23195fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 232095c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 232195c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb isVolatile, Alignment); 23225fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 2323d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 232428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2325d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2326d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2327d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 232828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 232928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 23301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 23341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 23351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 23370b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 233895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 23391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23410eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 23420eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 23430eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 23440eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 23450eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 23460eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 23470eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 23480eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 23490eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2350e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2351e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2352e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2353e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2354e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2355e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2356e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2357e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2358e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 23590eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 23600eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 23610eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 23620eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 23637255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2364e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 23650eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23660eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2367bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2368e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2369e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2370e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2371e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2372e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2373e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2374e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2375e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 23760eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23770eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 23780eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 23790eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23800eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 23810eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 23820eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 23830eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2384ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // If this is a vector type, force it to the right vector type. 23850eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 23869d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *OpTy = cast<VectorType>(I.getOperand(i)->getType()); 23870eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 23880eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23890eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 23900eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 23910eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 23920eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 23930eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23940eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 23950eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 23960eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 23970eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 23980eade319cdb72e24c11d068728a98083737c6435Chris Lattner 23990eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 24000eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24010eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 24020eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 24039d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 24040eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 24050eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24060eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 24070eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 24080eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24090eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24100eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 24110eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 24120eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24130eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 24140eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 24150eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2416f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2417f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 24180eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 241948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 242048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2421f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2422f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 242348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2424f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2425f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 242648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2427f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2428f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 242948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2430e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2431e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2432e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2433e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2434e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2435e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2436e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24370eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24389d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 24390eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 24400eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 24410eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 24420eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 24430eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24440eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 24450eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24460eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24470eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24483b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands/// ExtractGlobalVariable - If C is a global variable, or a bitcast of one 24493b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands/// (possibly constant folded), return it. Otherwise return NULL. 24503b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sandsstatic GlobalVariable *ExtractGlobalVariable (Constant *C) { 24513b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (GlobalVariable *GV = dyn_cast<GlobalVariable>(C)) 24523b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return GV; 24533b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 24543b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (CE->getOpcode() == Instruction::BitCast) 24553b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return dyn_cast<GlobalVariable>(CE->getOperand(0)); 24563b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands else if (CE->getOpcode() == Instruction::GetElementPtr) { 24573b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i) 24583b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (!CE->getOperand(i)->isNullValue()) 24593b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return NULL; 24603b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return dyn_cast<GlobalVariable>(CE->getOperand(0)); 24613b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands } 24623b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands } 24633b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return NULL; 24643b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands} 24653b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2466c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2467c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2468c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2469c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2470c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2471c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 24720eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 24730eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 24740eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 24750eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2476c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2477c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2478c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2479bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2480bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2481bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2482bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2483bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2484bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2485bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2486bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2487c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2488d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2489c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2490c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2491d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2492c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 249303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 249403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 249503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 249603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 249703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 249803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 249903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 250003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 250103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 250203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 250303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 250403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2505c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 250686cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 250744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 250843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 250944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2510bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 251136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2512bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2513bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2514bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2515ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 251644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2517ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 251843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 251943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2520bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2521bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2522ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2523bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 252486cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 252543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2526b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 252736ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 252843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 252944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 253043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 253144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 253244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 25331ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2534bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 253543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 253643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2537b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 253843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 253943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 254044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 254143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 254244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 254344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 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_func_start: { 255144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 255243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 255344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 255444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 255544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 25561ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2557bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 255843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 255943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2560b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 256143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 256243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 256344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 256443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 256544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 25660892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2567bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 256844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 256943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 257043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 257143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 257243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2573c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2574b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2575b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2576b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2577ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2578735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception register as live in. 2579735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionAddressRegister(); 2580735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 25819fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 2582735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2583735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2584735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2585735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2586735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2587735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2588735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 25897a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 259064ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2591735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2592b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2593b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2594b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 25950b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_selector: 25960b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_filter:{ 2597b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2598b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2599ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2600735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Inform the MachineModuleInfo of the personality for this landing pad. 2601cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey ConstantExpr *CE = dyn_cast<ConstantExpr>(I.getOperand(2)); 2602cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey assert(CE && CE->getOpcode() == Instruction::BitCast && 2603cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey isa<Function>(CE->getOperand(0)) && 2604cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey "Personality should be a function"); 2605cbfdb7b871ddb383c9b323d4b9fba112ad500214Jim Laskey MMI->addPersonality(CurMBB, cast<Function>(CE->getOperand(0))); 2606b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2607735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Gather all the type infos for this landing pad and pass them along to 2608735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // MachineModuleInfo. 2609735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::vector<GlobalVariable *> TyInfo; 2610735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = 3, N = I.getNumOperands(); i < N; ++i) { 2611b682448ebd8074dd63b40d41204fc69a417e0eacAnton Korobeynikov Constant *C = cast<Constant>(I.getOperand(i)); 26123b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands GlobalVariable *GV = ExtractGlobalVariable(C); 2613398898cc6a4cba85d908444a2bb42b1a9fc3df2aDuncan Sands assert (GV || isa<ConstantPointerNull>(C) && 26143b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands "TypeInfo must be a global variable or NULL"); 26153b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands TyInfo.push_back(GV); 2616735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 261773ef58ab92d5cd23b119b7f206e5f8a8c529098dDuncan Sands if (Intrinsic == Intrinsic::eh_filter) 261873ef58ab92d5cd23b119b7f206e5f8a8c529098dDuncan Sands MMI->addFilterTypeInfo(CurMBB, TyInfo); 261973ef58ab92d5cd23b119b7f206e5f8a8c529098dDuncan Sands else 262073ef58ab92d5cd23b119b7f206e5f8a8c529098dDuncan Sands MMI->addCatchTypeInfo(CurMBB, TyInfo); 26219fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 2622735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Mark exception selector register as live in. 2623735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned Reg = TLI.getExceptionSelectorRegister(); 2624735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (Reg) CurMBB->addLiveIn(Reg); 2625735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2626735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 26276ad8256d769f352103b6101c7090e4bfc0389330Anton Korobeynikov SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2628735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2629735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2630735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2631735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2632735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2633735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 26347a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 26356ad8256d769f352103b6101c7090e4bfc0389330Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2636b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2637b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2638b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2639b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2640b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2641b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_typeid_for: { 2642b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2643735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2644735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2645735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 26463b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands Constant *C = cast<Constant>(I.getOperand(1)); 26473b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands GlobalVariable *GV = ExtractGlobalVariable(C); 2648398898cc6a4cba85d908444a2bb42b1a9fc3df2aDuncan Sands assert (GV || isa<ConstantPointerNull>(C) && 26493b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands "TypeInfo must be a global variable or NULL"); 26503b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2651735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 2652735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, DAG.getConstant(TypeID, MVT::i32)); 26537a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 26547a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2655b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2656b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2657b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2658b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2659b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 26600b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 26610b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2662c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2663c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2664c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2665c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 26666ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 26676ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 26686ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 26696ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 26706ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 26716ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 26726ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2673c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2674c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2675c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2676c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2677c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 26788b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2679bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2680f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2681f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2682f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 26838b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 26848b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 268551b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 26868b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2687c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 26883f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 2689f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 2690f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 2691f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 2692f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 2693f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 2694f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set 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, 2759070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov SDOperand Callee, unsigned OpIdx, 2760070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 27611da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2762735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 27635694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 2764070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2765070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 2766070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2767735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2768735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2769735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2770735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2771735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2772735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2773735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 27744fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands 27754fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands unsigned attrInd = i - OpIdx + 1; 27764fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::SExt); 27774fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isZExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ZExt); 27784fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isInReg = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::InReg); 27794fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSRet = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::StructRet); 2780735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2781735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2782735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 27839fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (ExceptionHandling && MMI) { 2784070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 2785070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 2786070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 2787070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2788070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(BeginLabel, MVT::i32))); 2789070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2790070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2791735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2792735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 279318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), 27941da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2795735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2796735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2797735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2798735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2799070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 28009fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (ExceptionHandling && MMI) { 2801070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 2802070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 2803070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 2804070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2805070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(EndLabel, MVT::i32))); 2806070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2807070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Inform MachineModuleInfo of range. 2808070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 2809070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2810735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2811735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2812735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 28131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 281464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2815c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 28165cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (F->isDeclaration()) 2817c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2818c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2819c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2820c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2821c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2822c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2823a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2824a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2825a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2826a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2827a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2828a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2829a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2830a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2831a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2832a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2833a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2834a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2835c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2836c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2837c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2838c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2839c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2840c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2841c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2842c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2843f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2844f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 284506a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2846c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2847f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2848f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2849f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2850c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2851f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2852f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 285306a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2854c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2855f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2856f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2857f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2858f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2859c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2860ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2861ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2862ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2863c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2864edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 286564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 286664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 286764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 286864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 286964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 2870070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 28711da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 2872070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.getCallingConv(), 2873070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.isTailCall(), 2874070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov Callee, 2875070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1); 28761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2878735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2879864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 28809f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 2881864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 2882864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 2883864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 2884864635ad7b3046d3042311423071152c613961deChris Lattner 2885864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 2886864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 2887864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 2888864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 2889864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 2890693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Chain = Hi.getValue(1); 2891693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Flag = Hi.getValue(2); 28929f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 28939f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 28949f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 28959f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 2896864635ad7b3046d3042311423071152c613961deChris Lattner } 2897864635ad7b3046d3042311423071152c613961deChris Lattner 2898cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 2899864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 2900864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 2901864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 2902864635ad7b3046d3042311423071152c613961deChris Lattner 29035df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 29045df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(ValueVT == MVT::Vector && "Unknown vector conversion!"); 29055df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Val, 29065df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner DAG.getConstant(MVT::getVectorNumElements(RegVT), 29075df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner MVT::i32), 290851eaa86758338d5935c0eff0469c418b1256aba7Dan Gohman DAG.getValueType(MVT::getVectorElementType(RegVT))); 29095df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner } 29105df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 2911cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 2912cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 2913cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2914cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 2915cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2916cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 29175df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 29185df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(MVT::isFloatingPoint(RegVT) && MVT::isFloatingPoint(ValueVT)); 29195df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2920864635ad7b3046d3042311423071152c613961deChris Lattner} 2921864635ad7b3046d3042311423071152c613961deChris Lattner 2922c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2923c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 2924c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 2925c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2926a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 2927a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 2928c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 2929c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 2930c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2931c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 29325df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner if (MVT::isVector(RegVT)) { 29335df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner assert(Val.getValueType() == MVT::Vector &&"Not a vector-vector cast?"); 29345df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner Val = DAG.getNode(ISD::VBIT_CONVERT, RegVT, Val); 29351a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isInteger(RegVT) && MVT::isInteger(Val.getValueType())) { 29360c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 29370c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 29380c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 29390c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 29401a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::isFloatingPoint(RegVT) && 29411a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::isFloatingPoint(Val.getValueType())) { 2942c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 29431a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else if (MVT::getSizeInBits(RegVT) == 29441a6acc214dc066ea08365b605e109203e9164068Chris Lattner MVT::getSizeInBits(Val.getValueType())) { 29451a6acc214dc066ea08365b605e109203e9164068Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, RegVT, Val); 29461a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else { 29471a6acc214dc066ea08365b605e109203e9164068Chris Lattner assert(0 && "Unknown mismatch!"); 29481a6acc214dc066ea08365b605e109203e9164068Chris Lattner } 2949c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2950c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 2951c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2952c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 29539f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 29549f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 29559f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 29569f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 29579f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 2958c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 2959a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 29609f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 2961c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2962c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2963c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2964c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2965864635ad7b3046d3042311423071152c613961deChris Lattner 2966c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2967c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2968c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2969c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 29709f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 29714b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 29724b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 2973c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 2974c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 2975c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2976864635ad7b3046d3042311423071152c613961deChris Lattner 2977864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 2978864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 2979864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 2980864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 29819b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 29829b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 2983f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 2984f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 29859b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 29869b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 2987f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 2988f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 29899b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 29909b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 29919b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 29929b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 29939b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 29949b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 2995f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 2996f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 2997f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 2998f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 2999f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3000f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3001f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3002f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 30039b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 30049b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 30059b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3006f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 30079b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3008864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3009864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3010864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3011864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 30129b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 30139b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3014f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3015f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3016f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3017f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3018f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3019f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3020f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3021864635ad7b3046d3042311423071152c613961deChris Lattner } 3022f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3023864635ad7b3046d3042311423071152c613961deChris Lattner} 3024864635ad7b3046d3042311423071152c613961deChris Lattner 3025bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3026bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3027bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3028bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 3029bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstruct AsmOperandInfo : public InlineAsm::ConstraintInfo { 3030bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintCode - This contains the actual string for the code, like "m". 3031bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string ConstraintCode; 3032bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3033bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintType - Information about the constraint code, e.g. Register, 3034bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// RegisterClass, Memory, Other, Unknown. 3035bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ConstraintType; 3036bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3037bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallOperand/CallOperandval - If this is the result output operand or a 3038bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// clobber, this is null, otherwise it is the incoming operand to the 3039bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallInst. This gets modified as the asm is processed. 3040bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 3041bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Value *CallOperandVal; 3042bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3043bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintVT - The ValueType for the operand value. 3044bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ConstraintVT; 3045bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3046e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3047e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3048e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3049e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3050bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner AsmOperandInfo(const InlineAsm::ConstraintInfo &info) 3051bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner : InlineAsm::ConstraintInfo(info), 3052bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType(TargetLowering::C_Unknown), 3053bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CallOperand(0,0), CallOperandVal(0), ConstraintVT(MVT::Other) { 3054bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3055bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3056bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner void ComputeConstraintToUse(const TargetLowering &TLI); 3057e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3058e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3059e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3060e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3061e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 3062e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs) const { 3063e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isOutReg) 3064e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OutputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3065e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isInReg) 3066e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner InputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3067e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3068bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3069bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3070bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3071bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 3072bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 3073bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner switch (CT) { 3074bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner default: assert(0 && "Unknown constraint type!"); 3075bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Other: 3076bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Unknown: 3077bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 0; 3078bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Register: 3079bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 1; 3080bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_RegisterClass: 3081bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 2; 3082bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Memory: 3083bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 3; 3084bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3085bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3086bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3087bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnervoid AsmOperandInfo::ComputeConstraintToUse(const TargetLowering &TLI) { 3088bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner assert(!Codes.empty() && "Must have at least one constraint"); 3089bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3090bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string *Current = &Codes[0]; 3091bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current); 3092bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (Codes.size() == 1) { // Single-letter constraints ('r') are very common. 3093bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3094bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3095bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return; 3096bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3097bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3098bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned CurGenerality = getConstraintGenerality(CurType); 3099bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3100bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 3101bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 3102bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner for (unsigned j = 1, e = Codes.size(); j != e; ++j) { 3103bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]); 3104bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned ThisGenerality = getConstraintGenerality(ThisType); 3105bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (ThisGenerality > CurGenerality) { 3106bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // This constraint letter is more general than the previous one, 3107bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // use it. 3108bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurType = ThisType; 3109bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Current = &Codes[j]; 3110bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurGenerality = ThisGenerality; 3111bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3112bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3113bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3114bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3115bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3116bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3117bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3118bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3119e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 3120e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris LattnerGetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 3121864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 31224e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3123e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3124e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3125e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3126e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3127e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3128e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3129e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3130e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3131e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3132e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3133e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3134e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3135e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3136e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3137e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3138e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3139e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3140e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3141e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3142e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3143e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3144e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3145e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3146e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3147e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3148864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3149e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3150e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3151e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3152e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3153e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3154e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3155864635ad7b3046d3042311423071152c613961deChris Lattner 3156bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3157bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3158bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner NumRegs = TLI.getNumElements(OpInfo.ConstraintVT); 3159864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3160bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3161864635ad7b3046d3042311423071152c613961deChris Lattner 3162bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 31632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 31642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3165864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3166bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3167864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3168cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3169cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3170cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3171cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3172cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3173864635ad7b3046d3042311423071152c613961deChris Lattner 3174864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3175864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3176864635ad7b3046d3042311423071152c613961deChris Lattner 3177864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3178864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3179864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3180864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3181864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3182864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3183864635ad7b3046d3042311423071152c613961deChris Lattner 3184864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3185864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3186864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3187864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3188864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3189864635ad7b3046d3042311423071152c613961deChris Lattner } 3190864635ad7b3046d3042311423071152c613961deChris Lattner } 3191e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3192e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3193e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3194864635ad7b3046d3042311423071152c613961deChris Lattner } 3195864635ad7b3046d3042311423071152c613961deChris Lattner 31962a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 31972a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 31982a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 31992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (PhysReg.second) { 32002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 32012a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 32022a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3203e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3204e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3205e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3206e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3207e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 32082a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 32093a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3210bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 32113a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 32122a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32132a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 3214bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SSARegMap *RegMap = MF.getSSARegMap(); 32152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 32162a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 32172a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 3218e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3219e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3220e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 32212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 32222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32232a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 32242a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 32252a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 32262a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32272a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 32282a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 32292a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 32302a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3231bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3232bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 32332a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3234e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 32354e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 3236864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3237864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3238864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 32394e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3240864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3241864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3242864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3243864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3244864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3245864635ad7b3046d3042311423071152c613961deChris Lattner } 3246864635ad7b3046d3042311423071152c613961deChris Lattner 32474e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 32484e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 32499b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 3250864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 3251864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3252864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3253864635ad7b3046d3042311423071152c613961deChris Lattner continue; 32544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 32554e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3256864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3257864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3258864635ad7b3046d3042311423071152c613961deChris Lattner 3259e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3260864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3261864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3262864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3263864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3264e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3265e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3266864635ad7b3046d3042311423071152c613961deChris Lattner 3267e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(), 3268e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3269e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3270e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3271864635ad7b3046d3042311423071152c613961deChris Lattner } 32724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3273864635ad7b3046d3042311423071152c613961deChris Lattner 3274864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3275e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 32764e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 32774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 32783ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3279ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3280ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3281ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 3282ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 3283ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 32840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 32850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<AsmOperandInfo> ConstraintOperands; 3286ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3287ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3288ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3289ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 32904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 32910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 32920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 32930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 32940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 32950c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3296e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3297e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3298e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3299e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3300e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3301e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3302e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner unsigned OpNo = 1; // OpNo - The operand of the CallInst. 33030c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 33040c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i])); 33050c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands.back(); 33060c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 33070c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 33081efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 33090c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 33100c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 33111efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 33120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 33130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // The return value of the call is this value. As such, there is no 33140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // corresponding argument. 33151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 33161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 33171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 33180c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 33191efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 33201efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 33220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 33231efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33241efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 33250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 33261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33271efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 33280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 33290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 33300c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 33310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 33320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner const Type *OpTy = OpInfo.CallOperandVal->getType(); 33336995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If this is an indirect operand, the operand is a pointer to the 33346995cf6015580eeab07a1c671fca180084a1325eChris Lattner // accessed type. 33356995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (OpInfo.isIndirect) 33366995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = cast<PointerType>(OpTy)->getElementType(); 33376995cf6015580eeab07a1c671fca180084a1325eChris Lattner 33386995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If OpTy is not a first-class value, it may be a struct/union that we 33396995cf6015580eeab07a1c671fca180084a1325eChris Lattner // can tile with integers. 33406995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (!OpTy->isFirstClassType() && OpTy->isSized()) { 33416995cf6015580eeab07a1c671fca180084a1325eChris Lattner unsigned BitSize = TD->getTypeSizeInBits(OpTy); 33426995cf6015580eeab07a1c671fca180084a1325eChris Lattner switch (BitSize) { 33436995cf6015580eeab07a1c671fca180084a1325eChris Lattner default: break; 33446995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 1: 33456995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 8: 33466995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 16: 33476995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 32: 33486995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 64: 33496995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = IntegerType::get(BitSize); 33506995cf6015580eeab07a1c671fca180084a1325eChris Lattner break; 33516995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 33520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 33536995cf6015580eeab07a1c671fca180084a1325eChris Lattner 33546995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpVT = TLI.getValueType(OpTy, true); 33550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 33561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 33570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 33582a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 33593ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 33603ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 33611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3362e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3363e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 336409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 336509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 336609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 336709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 336809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 336909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 337009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 337109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 337209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 337309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 337409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 337509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 337609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 337709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 337809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 337909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 338009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 338109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 338209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 338309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 338409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 338509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 338609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 338709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 338809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 338909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 339009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 339109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 339209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 339309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 339409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 339509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 339609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 339709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 339809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 339909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 340009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 340109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3402e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3403e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3404e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3405e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 34060c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 34070c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 34080c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34090c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3410e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3411e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3412e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 3413e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 3414e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3415e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3416e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3417e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3418e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3419e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3420e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 34210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 34220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 34230c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 34240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 34250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 34260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34272cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 34280f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 34290f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3430864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 34310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3433864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 34340f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 34350c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 34360c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 34371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 34380c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 34392cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3440c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3441c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3442f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 344309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 344422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 344522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 344622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3447c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3448c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 344909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 345022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 345122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 345222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 34532a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 345422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3455864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3456864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3457e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3458832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 34590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3460d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3461d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 34622cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 34630c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 34640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3465864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 34662cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 34672cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3468e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 34692cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3470e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 34710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 34722cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 34736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 34746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 34756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3476e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3477e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 34786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 34796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 34806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 34810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 34823d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 34830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 34842223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 34852223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 34860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 34873d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3488c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3489c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3490c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3491c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3492c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3493c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3494c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3495a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3496a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3497c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3498c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3499c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3500c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3501c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3502c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3503527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3504527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3505527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3506527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3507527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3508527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3509527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3510527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3511527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3512527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3513c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3514527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3515527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 3516527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner TLI.getPointerTy()); 3517527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3518527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3519527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3520527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3521527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3522c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 352387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 352487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 35252a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 35260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 352744b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 352844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 352953069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 35300c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintCode[0], 35310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG); 353253069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 3533832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 35340c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 353553069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 353653069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3537c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 353887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 353987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 3540c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3541c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 354287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 354387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 35442a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 354509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 354644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 354744b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 354844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 354987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 355087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3551c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3552c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 355387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3554c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 35552223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 355687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 35572a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 35582a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 35592a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 35600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 356144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 356287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 356387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3564e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3565e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 356687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3567e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 3568e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getPointerTy()); 356987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3570e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3571e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 35726656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 35736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3574c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3575c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3576c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3577e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3578e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3579e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 35806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 35816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3582c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 35836656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3584ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3585ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3586ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3587ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3588ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3589f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3590f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3591bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3592ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3593ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 35946656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 35956656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 35963a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 35973a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, Flag); 35983a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 35993a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 36003a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 36013a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // vbit_convert. 36023a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (Val.getValueType() == MVT::Vector) { 36033a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner const VectorType *VTy = cast<VectorType>(I.getType()); 36043a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner unsigned DesiredNumElts = VTy->getNumElements(); 36053a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner MVT::ValueType DesiredEltVT = TLI.getValueType(VTy->getElementType()); 36063a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 36073a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner Val = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Val, 36083a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner DAG.getConstant(DesiredNumElts, MVT::i32), 36093a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner DAG.getValueType(DesiredEltVT)); 36103a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 36113a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 36123a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner setValue(&I, Val); 36133a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 36146656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36156656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 36166656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 36186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 36196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3620864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 36216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3622864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 3623864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 36246656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3625ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36266656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3627bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 36286656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 36290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 36306656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 36318b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 36326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3633bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3634bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3635ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3636ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3637ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3638ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 36401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 36411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 364368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 364468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 364568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 364668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 364768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 36481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3650a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 36511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 36521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 36531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 365447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 365547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 365647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 365747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 365847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3659cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3660cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 366147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3662cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3663cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3664cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3665cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 36661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 36671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 366947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 367047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 367147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 367247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 367347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 36741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3675cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 367647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3677cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3678cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 36791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 36801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3681025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3682025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3683025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3684025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3685025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3686025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3687025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3688832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3689832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3690832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3691025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3692025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3693025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3694025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 369539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3696acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3697acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3698acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 369939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 370039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 37011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3702acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3703acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3704acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3705acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3706acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 37071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3710acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3711acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3712acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 37131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3716acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3717acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3718acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3719acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3720acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 37211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3723b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either 3724b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate. 3725b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg, 3726b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned &i, SelectionDAG &DAG, 3727b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 3728b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) 3729b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(Arg, i++); 3730b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3731b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3732b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3733b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3734b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BIT_CONVERT, VT, 3735b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI)); 3736b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3737b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3738b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3739b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3740b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 3741b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi); 3742b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3743b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3744b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3745b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3746b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(); 3747b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3748b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3749fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3750fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3751f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3752f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3753fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3754fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3755b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 37565694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 3757fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3758fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 37598c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3760fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3761fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3762fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3763fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3764fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 37656aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3766ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3767ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3768fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3769d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 37707aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3771d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 37727aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3773ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3774ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 377518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt)) 3776d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 377718da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt)) 3778d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 377918da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg)) 3780d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 378118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet)) 3782d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3783d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3784ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3785fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3786fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3787fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3788fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3789b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3790fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3791fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3792fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3793b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3794fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3795fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3796fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3797fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 3798fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 3799fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 38009f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 38019f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3802b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov for (unsigned i = 0; i != NumVals; ++i) { 3803fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 3804cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 38050db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (i > 0) 3806d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3807d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3808b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3809b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov } 3810fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3811fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3812fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 38139d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(I->getType())->getNumElements(); 38149d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(I->getType())->getElementType(); 3815f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3816fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3817ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3818fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3819fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3820fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 3821b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3822fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3823fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3824fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3825fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3826fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3827fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3828fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 38293b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 38308c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3831fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3832fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3833f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3834f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3835bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 38368c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 38378c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 3838fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3839fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3840fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3841fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 384247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 384347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 384447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3845fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3846fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3847fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3848fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3849fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3850fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3851fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3852fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3853fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3854fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 385518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt)) 3856f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3857f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 385818da0720887527ed570e9703ae5f290beb491ee1Reid Spencer else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt)) 3859f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3860f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3861fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3862fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3863fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3864fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3865fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3866fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3867fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3868fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3869fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 3870fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 3871b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // If this is a large integer or a floating point node that needs to be 3872b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // expanded, it needs to be reassembled from small integers. Figure out 3873b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // what the source elt type is and how many small integers it is. 3874b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this)); 3875fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3876fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3877fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 38789d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(I->getType()); 3879020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 3880020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 3881f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3882fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3883ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 3884fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3885d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3886020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 3887020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 3888d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 3889d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3890d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3891d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 3892d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 3893fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3894da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3895fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3896fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3897fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3898fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3899fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3900fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3901fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3902fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3903f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3904b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarCallArgs - Recursively expand call argument node by 3905b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_converting it or extract a pair of elements from the larger node. 3906b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg, 39077aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned Flags, 3908b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SmallVector<SDOperand, 32> &Ops, 3909b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SelectionDAG &DAG, 39107aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio TargetLowering &TLI, 39117aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio bool isFirst = true) { 39127aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3913b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) { 3914cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 39157aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio if (!isFirst) 3916d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3917d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3918b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(Arg); 3919b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3920b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return; 3921b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3922b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3923b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3924b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3925b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3926b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg); 39277aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Arg, Flags, Ops, DAG, TLI, isFirst); 3928b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3929b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3930b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(0, TLI.getPointerTy())); 3931b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3932b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(1, TLI.getPointerTy())); 3933b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3934b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 39357aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Lo, Flags, Ops, DAG, TLI, isFirst); 39367aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Hi, Flags, Ops, DAG, TLI, false); 3937b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3938b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3939b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3940b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3941b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3942b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3943f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3944f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3945f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3946f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3947f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 394847857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 394947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3950f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3951f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3952f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3953be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3954f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3955f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3956f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3957f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3958f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3959f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3960f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3961f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 396247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 396347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 3964d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 39657aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3966d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 39670db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3968d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3969d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 3970d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 3971d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 39720db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 3973d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 39740db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 3975d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3976d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 39770db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3978f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3979f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 39807aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 3981f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3982b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3983f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3984f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3985f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3986d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 3987d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3988d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 3989d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 3990d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 3991d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 3992d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 3993f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 3994f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3995f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 399662000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // A true promotion would change the size of the argument. 399762000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // Instead, pretend this is an int. If FP objects are not 399862000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // passed the same as ints, the original type should be Legal 399962000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // and we should not get here. 400062000eee7de696cad5e3a307de395c77a61350eeDale Johannesen Op = DAG.getNode(ISD::BIT_CONVERT, 400162000eee7de696cad5e3a307de395c77a61350eeDale Johannesen VT==MVT::f32 ? MVT::i32 : 400262000eee7de696cad5e3a307de395c77a61350eeDale Johannesen (VT==MVT::f64 ? MVT::i64 : 400362000eee7de696cad5e3a307de395c77a61350eeDale Johannesen MVT::Other), 400462000eee7de696cad5e3a307de395c77a61350eeDale Johannesen Op); 4005f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4006f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4007b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4008f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4009f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 4010f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 4011f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 4012f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 4013f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 4014b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov ExpandScalarCallArgs(VT, Op, Flags, Ops, DAG, *this); 4015f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4016da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 4017da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 40189d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(Args[i].Ty); 4019da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 4020da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 4021da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 4022da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 4023ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 4024da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 40251b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 4026ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // Insert a VBIT_CONVERT of the MVT::Vector type to the vector type. 40271b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 40281b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 4029b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 40301b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 4031da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 4032da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 4033da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 4034f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4035f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4036f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4037f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4038f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4039f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 4040be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<MVT::ValueType, 4> RetTys; 4041f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4042f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 4043f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 4044f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 4045f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 4046f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 4047f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 4048f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4049f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 4050f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 4051f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4052f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 4053f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 4054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 4055f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 4056f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 40579f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 40589f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 4059f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 4060f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 4061f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4062da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 4063da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 40649d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(RetTy); 4065da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 4066da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 4067da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 4068da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 4069ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 4070da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 4071da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 4072da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 4073da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 4074da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 4075da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 4076da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 4077f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4078f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4079f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4080f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4081f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 4082f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4083f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 4084be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4085be384162c68641233deba8702666af51bdfd4b83Chris Lattner DAG.getVTList(&RetTys[0], RetTys.size()), 4086be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4087f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4088f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 4089f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 4090f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 4091f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 4092f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 4093f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 4094f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 4095f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 4096f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4097f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 4098f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 4099da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 41005df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner // Insert a VBIT_CONVERT to convert from the packed result type to the 4101da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 41029d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NumElems = cast<VectorType>(RetTy)->getNumElements(); 41039d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const Type *EltTy = cast<VectorType>(RetTy)->getElementType(); 4104da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 4105da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 4106ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 4107fea997aac5773e936754de5436029c2a4fa1e930Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy),NumElems); 4108da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 4109da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 4110da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 4111da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 4112d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 4113d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 4114da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 4115da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 4116da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 4117da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 411847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned AssertOp = ISD::AssertSext; 411947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer if (!RetTyIsSigned) 412047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer AssertOp = ISD::AssertZext; 4121f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 4122f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 4123f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 4124f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4125f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 41261a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng if (getTypeAction(VT) == Expand) 41271a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::BIT_CONVERT, VT, ResVal); 41281a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng else 41291a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 4130f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4131f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4132f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 4133f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 4134f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 4135f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4136f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4137f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 4138f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4139f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4140f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4141f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 4142f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4143f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 414450381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4145171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4146171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4147d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4148171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4149171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 41500aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 41510aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 41520aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 41530aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 41540aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 41550aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 41560aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 415774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 41581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 41591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 4160a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 41611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 41621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 41631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 41641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 41671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 41711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 41731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 41761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 41771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 41781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 41791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 41841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 418774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 418874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 418974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 419074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 419174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 419274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 419374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 4194b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned MSB = MVT::getSizeInBits(VT) / 8; 419574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 419674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 419774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4198a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 419974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 420074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 420174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 420274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 420374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 42041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 42051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 42061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 42071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 42081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 42091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4211c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 421280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 421380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4214c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4215c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4216c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 42171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 42181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 42201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 42211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 42221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 42231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 42241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 42251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 42271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 42281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 42301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 42311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 42331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 42341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 423880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 423980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 424080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 424180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 42421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 424380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 424480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 424580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4246dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 42471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 4248b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 42491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 42501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 42511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 42521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 425380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 425480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 425580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 425680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 42571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 42581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 42591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 426080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 426180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 42621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 42651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 42661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 42671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 42681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 42691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 42701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 42711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 42731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 42741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 42761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4277bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 42781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4279ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 42801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4281c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4282c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 428380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 42841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 42851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 42861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 4287b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 4288a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4289786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4290864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 42918b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4292c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4293c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4294c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4295c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4296c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4297c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4298c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4299c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4300c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4301c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4302cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 430374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 430474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4305cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 430674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 430774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 430874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 430974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 431074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 431174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 431274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4313cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 431474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 431574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 431674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4317f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 43180937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4319cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4320cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4321cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4322cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4323cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 432474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 432574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4326c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4327c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4328b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 432974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 433074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4331cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 433274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 433374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 433474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4335786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4336786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43378b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 433874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 433974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 434074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4341466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 434274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 434374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4344786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4345786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43468b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 434774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4348c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 434974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 435074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 43511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4353c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 43541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4356c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4357c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4358bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4359bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4360c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4361c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 43621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4364bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 43651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43677041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43687041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43697041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 43721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 43731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4375495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4376c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4377c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4378495a0b51915eb763576874f29192820b731edc22Chris Lattner} 43791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4380c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4381bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 43821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 43831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 43841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4385832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 43861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 43881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4389ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling) 4390ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 4391ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 4392ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands // Mark landing pad. 4393ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 43949fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 43959fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 43961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4397edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4398ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4399ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4400ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4401ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4402ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4403ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4404ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4405ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 44061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 44071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4409571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4410571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4411571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 441218c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4413d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 441418c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4415d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4416d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 4417d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 4418d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4419d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 4420d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 4421571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 44221c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 442370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 442470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 44259d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer unsigned NE = TLI.getVectorTypeBreakdown(cast<VectorType>(V->getType()), 442670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 44276595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman uint64_t SrcVL = cast<ConstantSDNode>(*(Op.Val->op_end()-2))->getValue(); 44281c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 442970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 44306595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman // VEXTRACT_VECTOR_ELT'ing or VEXTRACT_SUBVECTOR'ing them, converting them 44316595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman // to PTyLegalElementVT, then copying them into output registers. 4432bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 4433571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Root = getRoot(); 443470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 44356595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman SDOperand Elt = MVT::isVector(PTyElementVT) ? 44366595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman DAG.getNode(ISD::VEXTRACT_SUBVECTOR, PTyElementVT, 44376595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman Op, DAG.getConstant(i * (SrcVL / NE), TLI.getPointerTy())) : 44386595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 44396595635175764f402e7a5e53216c8d46bdce8c28Dan Gohman Op, DAG.getConstant(i, TLI.getPointerTy())); 444070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 444170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 444270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 444370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 444470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 444570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 444670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 444770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 444870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 444970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 445070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 445170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 445270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 445370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4454a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 445570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 4456a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 445770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 445870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 445970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 44601c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 4461bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, 4462bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 44639f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) { 4464d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 4465fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 4466fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 4467fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 4468fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 4469571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 4470d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 44719f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DestVT = TLI.getTypeToExpandTo(SrcVT); 44729f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(SrcVT); 44739f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 44749f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng return DAG.getCopyToReg(getRoot(), Reg, 44759f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getNode(ISD::BIT_CONVERT, DestVT, Op)); 44769f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 4477d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 4478d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4479a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 4480d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 4481a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 4482571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Op = DAG.getCopyToReg(getRoot(), Reg, Lo); 4483d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 4484d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 44851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4487068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 448815699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4489068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 44901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 449115699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 44920afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4493bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4494bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4495bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4496bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4497bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4498bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4499bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4500bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4501f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4502bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4503bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4504251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4505251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4506251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4507bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4508bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 45090afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4510bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4511bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4512966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4513bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4514068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4515068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4516068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4517068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4518f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4519068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 4520068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4521068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4522edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4523bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4524ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4525bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 45261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 45281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 45291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45309fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (ExceptionHandling && BB->isLandingPad()) { 45319fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 45329fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45339fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (MMI) { 45349fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 45359fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 45369fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 45379fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 45389fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands DAG.getConstant(LabelID, MVT::i32))); 45399fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45409fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45419fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 45431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 45441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 45451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4546f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 45471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4548f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 45491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4550f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 45519f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 45521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4553ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4554571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 45551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 45581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 45591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 45601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 45611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 45621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4563edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 45648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 45651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 45671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4568d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 45708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 45718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 45728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 45738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 45751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 45761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 45771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4578d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 45798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4580d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 45828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 45838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 45848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 45858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 45868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 45881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 45891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 45911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 45921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 45931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 45948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 45958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 45968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 45978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 45998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 46003f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 46018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 46028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 46038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 46048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 46058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 46071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 46098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 46108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 46118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 46128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 46138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 46148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 46158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 46168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 46187e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 46191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 46228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 46238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 46248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 46258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 46268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 46278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 46288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 46298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 46309d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer TLI.getVectorTypeBreakdown(cast<VectorType>(PN->getType()), 46318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 46328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 46338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 46348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 46358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 46361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 46381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4639ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 46405a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 46417436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 46427436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 46437436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 46447436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 46457436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 46467436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 46477436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 46487436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 46497436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 46507436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 46517436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 46527436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4653bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4654bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4655ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4656ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 46571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4658f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4659a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4660f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 466137efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4662f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4663f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 46643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 46653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 46664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 46674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 46684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4669a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4670a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 46711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4673f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4674c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4675c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4676c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4677af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4678c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 46792300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4680832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 46811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4682f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 46831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 46841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4685ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4686f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4687832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 46881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4689f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4690af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4691c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 46922300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4693a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4694552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4695a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4696a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 46971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4698f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4699832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 47001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4701f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4702f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4703f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4704f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4705f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4706f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 470744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4708f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4709f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4710f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4711f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4712f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 47131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4714f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4715f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4716f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 47174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 47194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 47204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 47214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 47224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4723f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4724a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 47251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 47264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4727f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4728f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4729f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4730f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 473109e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4732f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4733f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4734f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 47351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 47384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 47394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 47404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 47424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 47434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 47454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 47484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 47554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering BSDL(BSDAG, TLI, FuncInfo); 47564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 47584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 47594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 47614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 47624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 47654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 47664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 47714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 47724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 47754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 47764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 47774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 47784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 47794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 47804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 47814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 47824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 47834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent); 47858085bcfdca515a359c746ea475a3b8e9cac1c077Anton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB); 47874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 47894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 47914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 47924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 47934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(cBB); 47954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48009453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 48019453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 48029453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 48033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 48043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 48053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 48063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 48083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 48093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 48113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 48133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 48143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 48183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 48203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering JSDL(JSDAG, TLI, FuncInfo); 482137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 48223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 48233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 482437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 48253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 48263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 48273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 48283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 482937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 483037efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 483137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 483237efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 483337efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 483437efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 48354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 48363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 483709e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 48383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4839f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 48404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4841f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 484209e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4843f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 484437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 484537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 484637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 484737efe6764568a3829fee26aba532283131d1a104Nate Begeman 4848b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4849b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4850b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4851b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4852b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4853b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4854b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4855b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4856b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4857b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4858b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4859b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4862d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 486344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4864f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4865f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4866d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4867f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4869f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4870d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4871f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4872f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4873f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4875d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4876d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4877d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4878d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4879d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 488057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4881d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4882d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4883d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4884d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4885d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4886d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4887d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4888d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4889d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4890d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4891d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4892f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4893d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4894d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 489557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 489657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4897d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4898d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 48992452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 490057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4901f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 490257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4903a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 49041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4905a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 490613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4907a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4908a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4909a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4910a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4911a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 491213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4913eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 491413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 491513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4916eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 49179373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 49184ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 491913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 49209ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4921a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4922cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4923a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 49240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 492503fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 49269ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 49279ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 49289ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 49299ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4930755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4931755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4932755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4933755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4934755480681c795d585c73556c028b6143c46bda86Chris Lattner 4935755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4936755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4937755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4938755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4939755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4940755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4941755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4942755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4943755480681c795d585c73556c028b6143c46bda86Chris Lattner 4944755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4945755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4946755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4947755480681c795d585c73556c028b6143c46bda86Chris Lattner 4948755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4949755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4950755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4951755480681c795d585c73556c028b6143c46bda86Chris Lattner 4952755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4953755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4954755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4955755480681c795d585c73556c028b6143c46bda86Chris Lattner if (getTargetLowering().MaskedValueIsZero(LHS, NeededMask)) 4956755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4957755480681c795d585c73556c028b6143c46bda86Chris Lattner 4958755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4959755480681c795d585c73556c028b6143c46bda86Chris Lattner 4960755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4961755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4962755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4963755480681c795d585c73556c028b6143c46bda86Chris Lattner 4964755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4965755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4966755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4967755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4968755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4969755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4970755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4971755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4972755480681c795d585c73556c028b6143c46bda86Chris Lattner 4973755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4974755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4975755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4976755480681c795d585c73556c028b6143c46bda86Chris Lattner 4977755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4978755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4979755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4980755480681c795d585c73556c028b6143c46bda86Chris Lattner 4981755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4982755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4983755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4984755480681c795d585c73556c028b6143c46bda86Chris Lattner 4985755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4986755480681c795d585c73556c028b6143c46bda86Chris Lattner getTargetLowering().ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4987755480681c795d585c73556c028b6143c46bda86Chris Lattner 4988755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4989755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4990755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4991755480681c795d585c73556c028b6143c46bda86Chris Lattner 4992755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4993755480681c795d585c73556c028b6143c46bda86Chris Lattner 4994755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4995755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4996755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4997755480681c795d585c73556c028b6143c46bda86Chris Lattner 49989ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 49990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 50000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 50010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 50020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 50030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 50040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 50050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50060e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 50070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 50080e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50090e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 50100e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 50110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 50120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50130e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 50140e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 50150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 50160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 50170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 50180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 50190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 50200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 50210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 50220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 50230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5024832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 50250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 50260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 50294b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 503036d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 50314b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 50320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 50330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 50340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 50380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 50390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 50400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5041794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 50421997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5043