SelectionDAGISel.cpp revision 9f87788040786b1bc6530763e4cf7e105bfb2924
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" 15c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 17a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 18adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Constants.h" 201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2236ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 23ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 27b2efb853f00d45b1c8d57f92acd0028fbdeffda6Jim Laskey#include "llvm/CodeGen/MachineDebugInfo.h" 281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3037efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 32eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 35fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 363f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner#include "llvm/Target/TargetAsmInfo.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 42124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 43495a0b51915eb763576874f29192820b731edc22Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.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/// 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 744ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 76eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 7713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 783700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 7913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 8013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 819ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 829373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 839373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 854ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 86864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 87864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 88864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 89864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 90864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 919525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 92864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 93864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 94864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 95864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 96864635ad7b3046d3042311423071152c613961deChris Lattner 97864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 98864635ad7b3046d3042311423071152c613961deChris Lattner /// 99864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 100864635ad7b3046d3042311423071152c613961deChris Lattner 101864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 102864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 103864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 104864635ad7b3046d3042311423071152c613961deChris Lattner 105864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 106864635ad7b3046d3042311423071152c613961deChris Lattner 107864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 108864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 109864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 110864635ad7b3046d3042311423071152c613961deChris Lattner } 111864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 112864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 113864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 114864635ad7b3046d3042311423071152c613961deChris Lattner } 115864635ad7b3046d3042311423071152c613961deChris Lattner 116864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 117864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 118864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 119864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1209f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 121c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 124c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 125c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 126a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 127a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 132c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1339f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 134864635ad7b3046d3042311423071152c613961deChris Lattner }; 135864635ad7b3046d3042311423071152c613961deChris Lattner} 1364ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1399373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 159f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 160f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, unsigned> ValueMap; 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 190edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1913c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 202f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 208f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 209571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 210f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 215bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 216f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 217f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 218bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 219bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 221f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 222bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 225bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 227edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 230bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 231bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 23216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 23316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 234bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 235bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 237bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2402aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 243b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 245a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 246ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 247a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 248ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 249a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 250b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // If the alignment of the value is smaller than the size of the 251b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // value, and if the size of the value is particularly small 252b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // (<= 8 bytes), round up to the size of the value for potentially 253b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // better performance. 254a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // 255a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // FIXME: This could be made better with a preferred alignment hook in 256a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // TargetData. It serves primarily to 8-byte align doubles for X86. 257a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner if (Align < TySize && TySize <= 8) Align = TySize; 258b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 259d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 261f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2642aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2652aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2742aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 2878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 2888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 2898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 2908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 2918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 2928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 294f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 297c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 2988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 299c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a packed type, figure out what type it will decompose into 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner const PackedType *PTy = cast<PackedType>(V->getType()); 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3276cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3286cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3296cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3306cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3433c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3443c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3453c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3463c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3473c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3483c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3499f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng VT = TLI.getTypeToExpandTo(VT); 3509f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned R = MakeReg(VT); 3513c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3529f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MakeReg(VT); 3533c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3543c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, SDOperand> NodeMap; 3661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 367d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 368d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 369d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 370d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 371d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 372d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Case - A pair of values to record the Value for a switch case, and the 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// case's target basic block. 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<Constant*, MachineBasicBlock*> Case; 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::vector<Case>::iterator CaseItr; 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<CaseItr, CaseItr> CaseRange; 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// The comparison function for sorting Case values. 397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman bool operator () (const Case& C1, const Case& C2) { 399b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (const ConstantInt* I1 = dyn_cast<const ConstantInt>(C1.first)) 400b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (I1->getType()->isUnsigned()) 401b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return I1->getZExtValue() < 402b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<const ConstantInt>(C2.first)->getZExtValue(); 403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 404b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return cast<const ConstantInt>(C1.first)->getSExtValue() < 405b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<const ConstantInt>(C2.first)->getSExtValue(); 406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 415a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 417f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 418f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 419f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 42037efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGISel::JumpTable JT; 421f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 427edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4299453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT(0,0,0,0), FuncInfo(funcinfo) { 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 432a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 433a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 434a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 435d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 436d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 437edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 438d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 439d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 440d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 441d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 442d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 443d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 444d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 445d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 446bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 447bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 448d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 450d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 451a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 452a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 453571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 454571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4581e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4591e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 473466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 47428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 480199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const SDOperand &setValue(const Value *V, SDOperand NewN) { 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return N = NewN; 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 488864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 489864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 490864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 491864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 492864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 493f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 494571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 495571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 496571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 4978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 498571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 499571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 5001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 506f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Helper for visitSwitch 507f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 50837efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 509f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); } 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); } 5131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5141628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitIntBinary(User &I, unsigned IntOp, unsigned VecOp); 5151628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitFPBinary(User &I, unsigned FPOp, unsigned VecOp); 516e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5175fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5181628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (I.getType()->isFloatingPoint()) 5191628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FADD, ISD::VADD); 5201628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5211628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::ADD, ISD::VADD); 52201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 523b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5241628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5251628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (I.getType()->isFloatingPoint()) 5261628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FMUL, ISD::VMUL); 5271628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5281628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::MUL, ISD::VMUL); 5291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5300a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitURem(User &I) { visitIntBinary(I, ISD::UREM, 0); } 5310a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitSRem(User &I) { visitIntBinary(I, ISD::SREM, 0); } 5320a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitFRem(User &I) { visitFPBinary (I, ISD::FREM, 0); } 5331628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitUDiv(User &I) { visitIntBinary(I, ISD::UDIV, ISD::VUDIV); } 5341628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitSDiv(User &I) { visitIntBinary(I, ISD::SDIV, ISD::VSDIV); } 5350a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitFDiv(User &I) { visitFPBinary (I, ISD::FDIV, ISD::VSDIV); } 5361628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitAnd(User &I) { visitIntBinary(I, ISD::AND, ISD::VAND); } 5371628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitOr (User &I) { visitIntBinary(I, ISD::OR, ISD::VOR); } 5381628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitXor(User &I) { visitIntBinary(I, ISD::XOR, ISD::VXOR); } 539e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShl(User &I) { visitShift(I, ISD::SHL); } 5403822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5413822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 54245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 54345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 544f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc, 545f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpc); 546f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ, 547f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOEQ); } 548f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE, 549f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETUNE); } 550f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE, 551f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLE); } 552f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE, 553f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGE); } 554f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT, 555f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLT); } 556f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT, 557f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGT); } 5583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5722bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5732bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5743e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 575c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 586ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 587c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5880eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 59439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner void visitFrameReturnAddress(CallInst &I, bool isFrameAddress); 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5967041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 609199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 610199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 611199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 612199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 613199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 614199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 615199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 616199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 617199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 618199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(N.Val && "visit didn't populate the ValueMap!"); 619199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 620199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 621199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 623199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 624199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 62523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner if (!isa<PackedType>(VTy)) 62623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 62723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 628b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 62923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner const PackedType *PTy = cast<PackedType>(VTy); 63023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 63123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 63223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 633bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 63423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 63523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 63623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 63723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 63823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 639bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, 640bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 641199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 642199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 643199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) { 644199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 645199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 646199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 647199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 648199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 649199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 650bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 651199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) { 6522bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6532bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 654199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 655199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 656199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 657199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 658199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 659199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 660199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 661199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 662199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 663199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 664b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 66523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 66623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 667bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR,MVT::Vector,&Ops[0],Ops.size()); 668199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 669199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 670b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return N = DAG.getConstant(cast<ConstantIntegral>(C)->getZExtValue(),VT); 671199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 672199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 673199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 674199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 675199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 676199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 677199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 678199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 679199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 680199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 681199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const Value*, unsigned>::const_iterator VMI = 682199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.ValueMap.find(V); 683199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!"); 684199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 685199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned InReg = VMI->second; 686199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 687199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 68870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 6899f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Expand) { 69070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 69170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // register pair VMI->second and VMI->second+1. 6929f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToExpandTo(VT); 6939f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(VT); 6949f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 6959f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 6969f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BIT_CONVERT, VT, N); 6979f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng else { 6989f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 6999f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 7009f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 7019f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } 7029f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else { 7039f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 7049f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 7059f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (TLI.getTypeAction(VT) == TargetLowering::Promote) // Promotion case 7069f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng N = MVT::isFloatingPoint(VT) 7079f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng ? DAG.getNode(ISD::FP_ROUND, VT, N) 7089f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng : DAG.getNode(ISD::TRUNCATE, VT, N); 709199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 71070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 71170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 71270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 71370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 7142e2ef9535070bb352601482cceac1140c1158cddChris Lattner const PackedType *PTy = cast<PackedType>(VTy); 7152e2ef9535070bb352601482cceac1140c1158cddChris Lattner unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT, 71670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 71770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 71870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 719bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 72070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 72170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 72270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 72370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 72470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 72570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 72670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 72770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 72870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 72970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 73070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 73170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 73270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 73370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 73470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 73570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 73670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 73770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 73870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 73970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 74070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 74170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 74270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 74370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 74470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 74570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 74670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 74770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 74870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 74970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 750bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size()); 7512e2ef9535070bb352601482cceac1140c1158cddChris Lattner 7522e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7532e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7542e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7552e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7562e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7572e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 758199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 759199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 760199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 761199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 762199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 763199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 766a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 769bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 770ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 771ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 772ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 7738e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng bool isSigned = I.getOperand(i)->getType()->isSigned(); 774ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 775ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 776ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 777ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7788e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7798e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 780ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 781ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 782ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 783ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 784ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 785ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 786ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 7871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7888e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng if (isSigned) 789ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp); 790ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 791ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp); 792ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 793ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 7948e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng NewValues.push_back(DAG.getConstant(isSigned, MVT::i32)); 7951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 796bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 797bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 7981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 800571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 801571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 802571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 803571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 804571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 805571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 806571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 807571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 808571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 809571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 810571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 811571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 812571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 813571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 8158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 8168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 8178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 8188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 8198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 8208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 8218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 8248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 8288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 8298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 8308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 8318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 8348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 8388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 8408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8416a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 8426a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 8436a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 8446a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 8456a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 8466a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 847571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 848571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 849571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 850571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 851571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 852571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 853571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 854571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BinaryOperator *BOp = dyn_cast<BinaryOperator>(Cond); 855571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 856571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!BOp || (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 8576a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 8586a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 8596a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 860571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 861571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 862df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Cond)) 863df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if ((II->getIntrinsicID() == Intrinsic::isunordered_f32 || 864df19f27d039fd791c73e39f4134319debc75db4fChris Lattner II->getIntrinsicID() == Intrinsic::isunordered_f64) && 865df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // The operands of the setcc have to be in this block. We don't know 866df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // how to export them from some other block. If this is the first 867df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // block of the sequence, no exporting is needed. 868df19f27d039fd791c73e39f4134319debc75db4fChris Lattner (CurBB == CurMBB || 869df19f27d039fd791c73e39f4134319debc75db4fChris Lattner (isExportableFromCurrentBlock(II->getOperand(1), BB) && 870df19f27d039fd791c73e39f4134319debc75db4fChris Lattner isExportableFromCurrentBlock(II->getOperand(2), BB)))) { 871df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETUO, II->getOperand(1), 872df19f27d039fd791c73e39f4134319debc75db4fChris Lattner II->getOperand(2), TBB, FBB, CurBB); 873df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.push_back(CB); 874df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 875df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 876df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 877df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 878571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If the leaf of the tree is a setcond inst, merge the condition into the 879571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // caseblock. 880571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp && isa<SetCondInst>(BOp) && 881571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // The operands of the setcc have to be in this block. We don't know 8825a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 8835a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 8845a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 8855a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 8865a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 887571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner ISD::CondCode SignCond, UnsCond, FPCond, Condition; 888571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner switch (BOp->getOpcode()) { 889571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner default: assert(0 && "Unknown setcc opcode!"); 890571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetEQ: 891571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETEQ; 892571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETEQ; 893571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOEQ; 894571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 895571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetNE: 896571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETNE; 897571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETNE; 898571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETUNE; 899571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 900571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetLE: 901571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETLE; 902571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETULE; 903571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOLE; 904571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 905571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetGE: 906571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETGE; 907571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETUGE; 908571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOGE; 909571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 910571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetLT: 911571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETLT; 912571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETULT; 913571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOLT; 914571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 915571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetGT: 916571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETGT; 917571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETUGT; 918571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOGT; 919571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 920571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 921571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 922571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const Type *OpType = BOp->getOperand(0)->getType(); 923571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(OpType)) 924571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner OpType = PTy->getElementType(); 925571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 926571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!FiniteOnlyFPMath() && OpType->isFloatingPoint()) 927571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = FPCond; 928571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else if (OpType->isUnsigned()) 929571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = UnsCond; 930571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else 931571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = SignCond; 932571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 933571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 934571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOperand(1), TBB, FBB, CurBB); 935571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 936571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 937571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 938571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 939571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 940571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantBool::getTrue(), 941571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner TBB, FBB, CurBB); 942571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 943571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 944571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 945571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 946d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 947d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 948571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 949571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 950571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 951571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 952d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 953d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 954d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 955d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 956d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 957d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 958d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 959d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 960571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 961d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 962d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 963d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 964d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 965d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 966d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 967d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 968d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 969d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 970d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 971d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 972d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 973d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 974d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 975d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 976d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 977d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 978d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 979d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 980d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 981d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 982d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 983571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 984571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 985df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 986df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 987df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 988df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 989df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 990df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 991df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 9920ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 9930ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 9940ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 9950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 9960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 9970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 9980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 9990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 10000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1001df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1002df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1003df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 10051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 10061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 10071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 10091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 10101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 10111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 10121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 10131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 10151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 10161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1017a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1018dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 101957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 102157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 102257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 102457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 102557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 102757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 102857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 102957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1030571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1031571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1032571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1033571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1034571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1035571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1036571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1037571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1038571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1039571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1040571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1041571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1042571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1043571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1044571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1045571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1046571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1047571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1048d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1049571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1050571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 10510ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 10520ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 10530ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 10540ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 10550ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1056df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1057df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1058df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1059df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1060df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1061df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1062df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1063df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1064df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1065df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1066df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 10675a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 10685a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 10690ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 10700ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 10710ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 10720ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 10730ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1074df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1075571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 10772452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 10782452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 1079571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantBool::getTrue(), 10802452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner Succ0MBB, Succ1MBB, CurMBB); 10812452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 10822452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 10832452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 10841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 10851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1086f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1087f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1088f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 108957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 109057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 109157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 1092571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Build the setcc now, fold "(X == true)" to X and "(X == false)" to !X to 1093571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // handle common cases produced by branch lowering. 1094571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (CB.CmpRHS == ConstantBool::getTrue() && CB.CC == ISD::SETEQ) 109557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Cond = CondLHS; 1096571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else if (CB.CmpRHS == ConstantBool::getFalse() && CB.CC == ISD::SETEQ) { 1097571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 1098571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 1099571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } else 1100571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 1101f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1102f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1103f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1104f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1105f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1106f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1107f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1108f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1109f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1110f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 111157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 111257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1113f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1114f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1115f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1116f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 111757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 111857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1119f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1120f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1121f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 112257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1123f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 112457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 112557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1126f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1127f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 112837efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 112937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 113037efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 11313d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 11323d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 11333d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 11343d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 11353d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 113637efe6764568a3829fee26aba532283131d1a104Nate Begeman} 113737efe6764568a3829fee26aba532283131d1a104Nate Begeman 1138f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitch(SwitchInst &I) { 1139f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1140f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1141f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1142c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1143f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1144f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1145f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1146d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()]; 1147d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1148f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1149f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 1150f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (I.getNumOperands() == 2) { 1151f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1152c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1153f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1154d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1155f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1156d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1157c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1158d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1163f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1164f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 1165f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<Case> Cases; 1166c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1167f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 1; i < I.getNumSuccessors(); ++i) { 1168f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)]; 1169f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cases.push_back(Case(I.getSuccessorValue(i), SMBB)); 1170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1171c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 1173f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1174f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1175f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1176f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 1177f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Value *SV = I.getOperand(0); 117837efe6764568a3829fee26aba532283131d1a104Nate Begeman 117937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Get the MachineFunction which holds the current MBB. This is used during 118037efe6764568a3829fee26aba532283131d1a104Nate Begeman // emission of jump tables, and when inserting any additional MBBs necessary 118137efe6764568a3829fee26aba532283131d1a104Nate Begeman // to represent the switch. 1182f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction *CurMF = CurMBB->getParent(); 1183f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const BasicBlock *LLVMBB = CurMBB->getBasicBlock(); 1184d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1185d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If the switch has few cases (two or less) emit a series of specific 1186d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // tests. 1187b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (Cases.size() < 3) { 1188d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // TODO: If any two of the cases has the same destination, and if one value 1189d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // is the same as the other, but has one bit unset that the other has set, 1190d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // use bit manipulation to do two compares at once. For example: 1191d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1192d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1193b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // Rearrange the case blocks so that the last one falls through if possible. 1194b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner if (NextBlock && Default != NextBlock && Cases.back().second != NextBlock) { 1195b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // The last case block won't fall through into 'NextBlock' if we emit the 1196b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // branches in this order. See if rearranging a case value would help. 1197b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner for (unsigned i = 0, e = Cases.size()-1; i != e; ++i) { 1198b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner if (Cases[i].second == NextBlock) { 1199b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner std::swap(Cases[i], Cases.back()); 1200b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner break; 1201b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1202b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1203b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1204b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner 1205d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // Create a CaseBlock record representing a conditional branch to 1206d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // the Case's target mbb if the value being switched on SV is equal 1207d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // to C. 1208d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *CurBlock = CurMBB; 1209d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner for (unsigned i = 0, e = Cases.size(); i != e; ++i) { 1210d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *FallThrough; 1211d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (i != e-1) { 1212d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner FallThrough = new MachineBasicBlock(CurMBB->getBasicBlock()); 1213d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMF->getBasicBlockList().insert(BBI, FallThrough); 1214d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } else { 1215d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If the last case doesn't match, go to the default block. 1216d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner FallThrough = Default; 1217d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 1218d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1219d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, Cases[i].first, 1220d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner Cases[i].second, FallThrough, CurBlock); 1221d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1222d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If emitting the first comparison, just call visitSwitchCase to emit the 1223d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // code into the current block. Otherwise, push the CaseBlock onto the 1224d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // vector to be later processed by SDISel, and insert the node's MBB 1225d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // before the next MBB. 1226d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (CurBlock == CurMBB) 1227d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner visitSwitchCase(CB); 1228d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner else 1229d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner SwitchCases.push_back(CB); 1230d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1231d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurBlock = FallThrough; 1232d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 1233d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner return; 1234d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 123537efe6764568a3829fee26aba532283131d1a104Nate Begeman 123617c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // If the switch has more than 5 blocks, and at least 31.25% dense, and the 123717c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // target supports indirect branches, then emit a jump table rather than 123817c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // lowering the switch to a binary tree of conditional branches. 12393d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng if ((TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 12403d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng TLI.isOperationLegal(ISD::BRIND, MVT::Other)) && 1241f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman Cases.size() > 5) { 1242b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer uint64_t First =cast<ConstantIntegral>(Cases.front().first)->getZExtValue(); 1243b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getZExtValue(); 1244f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman double Density = (double)Cases.size() / (double)((Last - First) + 1ULL); 1245f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 124617c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman if (Density >= 0.3125) { 124737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Create a new basic block to hold the code for loading the address 124837efe6764568a3829fee26aba532283131d1a104Nate Begeman // of the jump table, and jumping to it. Update successor information; 124937efe6764568a3829fee26aba532283131d1a104Nate Begeman // we will either branch to the default case for the switch, or the jump 125037efe6764568a3829fee26aba532283131d1a104Nate Begeman // table. 125137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 125237efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 125337efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(Default); 125437efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(JumpTableBB); 125537efe6764568a3829fee26aba532283131d1a104Nate Begeman 125637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Subtract the lowest switch case value from the value being switched on 125737efe6764568a3829fee26aba532283131d1a104Nate Begeman // and conditional branch to default mbb if the result is greater than the 125837efe6764568a3829fee26aba532283131d1a104Nate Begeman // difference between smallest and largest cases. 125937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SwitchOp = getValue(SV); 126037efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType VT = SwitchOp.getValueType(); 126137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 126237efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(First, VT)); 126337efe6764568a3829fee26aba532283131d1a104Nate Begeman 126437efe6764568a3829fee26aba532283131d1a104Nate Begeman // The SDNode we just created, which holds the value being switched on 126537efe6764568a3829fee26aba532283131d1a104Nate Begeman // minus the the smallest case value, needs to be copied to a virtual 126637efe6764568a3829fee26aba532283131d1a104Nate Begeman // register so it can be used as an index into the jump table in a 126737efe6764568a3829fee26aba532283131d1a104Nate Begeman // subsequent basic block. This value may be smaller or larger than the 126837efe6764568a3829fee26aba532283131d1a104Nate Begeman // target's pointer type, and therefore require extension or truncating. 126937efe6764568a3829fee26aba532283131d1a104Nate Begeman if (VT > TLI.getPointerTy()) 127037efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 127137efe6764568a3829fee26aba532283131d1a104Nate Begeman else 127237efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 1273c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 127437efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 127537efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 127637efe6764568a3829fee26aba532283131d1a104Nate Begeman 127737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the range check for the jump table, and branch to the default 127837efe6764568a3829fee26aba532283131d1a104Nate Begeman // block for the switch statement if the value being switched on exceeds 127937efe6764568a3829fee26aba532283131d1a104Nate Begeman // the largest case in the switch. 128037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 128137efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(Last-First,VT), ISD::SETUGT); 128237efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 128337efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getBasicBlock(Default))); 128437efe6764568a3829fee26aba532283131d1a104Nate Begeman 1285f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Build a vector of destination BBs, corresponding to each target 1286f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // of the jump table. If the value of the jump table slot corresponds to 1287f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // a case statement, push the case's BB onto the vector, otherwise, push 1288f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // the default BB. 128937efe6764568a3829fee26aba532283131d1a104Nate Begeman std::vector<MachineBasicBlock*> DestBBs; 1290f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman uint64_t TEI = First; 1291c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) 1292b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (cast<ConstantIntegral>(ii->first)->getZExtValue() == TEI) { 1293f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(ii->second); 1294f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ++ii; 1295f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } else { 1296f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(Default); 1297f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 1298f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 12998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Update successor info. Add one edge to each unique successor. 13008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 13018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 13028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(CurMBB->getParent()->getNumBlockIDs()); 13038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 1304c66764c00756d800aede2fd32d55658a236b1912Chris Lattner for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 13058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner E = DestBBs.end(); I != E; ++I) { 13068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (!SuccsHandled[(*I)->getNumber()]) { 13078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[(*I)->getNumber()] = true; 13088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner JumpTableBB->addSuccessor(*I); 13098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 1311f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 1312f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Create a jump table index for this jump table, or return an existing 1313f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // one. 131437efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 131537efe6764568a3829fee26aba532283131d1a104Nate Begeman 131637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the jump table information so that we can codegen it as a second 131737efe6764568a3829fee26aba532283131d1a104Nate Begeman // MachineBasicBlock 131837efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.Reg = JumpTableReg; 131937efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.JTI = JTI; 132037efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.MBB = JumpTableBB; 13219453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT.Default = Default; 132237efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 132337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 132437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 1325f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1326f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Push the initial CaseRec onto the worklist 1327f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<CaseRec> CaseVec; 1328f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 1329f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1330f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman while (!CaseVec.empty()) { 1331f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Grab a record representing a case range to process off the worklist 1332f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec CR = CaseVec.back(); 1333f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.pop_back(); 1334f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1335f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Size is the number of Cases represented by this range. If Size is 1, 1336f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // then we are processing a leaf of the binary search tree. Otherwise, 1337f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // we need to pick a pivot, and push left and right ranges onto the 1338f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // worklist. 1339f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman unsigned Size = CR.Range.second - CR.Range.first; 1340f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1341f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (Size == 1) { 1342f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1343f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the Case's target mbb if the value being switched on SV is equal 1344f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // to C. Otherwise, branch to default. 1345f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = CR.Range.first->first; 1346f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Target = CR.Range.first->second; 1347f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default, 1348f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CR.CaseBB); 1349c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1350f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the MBB representing the leaf node is the current MBB, then just 1351f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // call visitSwitchCase to emit the code into the current block. 1352f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, push the CaseBlock onto the vector to be later processed 1353f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // by SDISel, and insert the node's MBB before the next MBB. 1354f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1355f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1356c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling else 1357f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1358f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1359f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // split case range at pivot 1360f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseItr Pivot = CR.Range.first + (Size / 2); 1361f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange LHSR(CR.Range.first, Pivot); 1362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange RHSR(Pivot, CR.Range.second); 1363f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = Pivot->first; 136457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1365c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1366f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // We know that we branch to the LHS if the Value being switched on is 1367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // less than the Pivot value, C. We use this to optimize our binary 1368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // tree a bit, by recognizing that if SV is greater than or equal to the 1369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // LHS's Case Value, and that Case Value is exactly one less than the 1370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Pivot's Value, then we can branch directly to the LHS's Target, 1371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // rather than creating a leaf node for it. 1372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((LHSR.second - LHSR.first) == 1 && 1373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSR.first->first == CR.GE && 1374b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<ConstantIntegral>(C)->getZExtValue() == 1375b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer (cast<ConstantIntegral>(CR.GE)->getZExtValue() + 1ULL)) { 137657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner TrueBB = LHSR.first->second; 1377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 137857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner TrueBB = new MachineBasicBlock(LLVMBB); 137957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMF->getBasicBlockList().insert(BBI, TrueBB); 138057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CaseVec.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1382c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Similar to the optimization above, if the Value being switched on is 1384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // known to be less than the Constant CR.LT, and the current Case Value 1385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // is CR.LT - 1, then we can branch directly to the target block for 1386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the current Case Value, rather than emitting a RHS leaf node for it. 1387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1388b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<ConstantIntegral>(RHSR.first->first)->getZExtValue() == 1389b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer (cast<ConstantIntegral>(CR.LT)->getZExtValue() - 1ULL)) { 139057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner FalseBB = RHSR.first->second; 1391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 139257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner FalseBB = new MachineBasicBlock(LLVMBB); 139357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMF->getBasicBlockList().insert(BBI, FalseBB); 139457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CaseVec.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1396c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the LHS node if the value being switched on SV is less than C. 1399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, branch to LHS. 1400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT; 140157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SelectionDAGISel::CaseBlock CB(CC, SV, C, TrueBB, FalseBB, CR.CaseBB); 1402c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1405c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling else 1406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1409f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1410f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1411b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1412b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 141301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (I.getType()->isFloatingPoint()) { 141401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 141501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 141601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 141701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 141801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 141901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 14201628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FSUB, ISD::VSUB); 14211628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else 14221628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::SUB, ISD::VSUB); 1423b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1424b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 14251628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencervoid 14261628cec4d7fce310d9cde0bcc73997e5a71692c4Reid SpencerSelectionDAGLowering::visitIntBinary(User &I, unsigned IntOp, unsigned VecOp) { 14275fbb5d2459a5410590f285250faa604576308a93Nate Begeman const Type *Ty = I.getType(); 14281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 14291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 14302c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 14311628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 14321628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 14331628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 14341628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 14355fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 14361628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2)); 14371628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } 14381628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 14391628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 14401628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencervoid 14411628cec4d7fce310d9cde0bcc73997e5a71692c4Reid SpencerSelectionDAGLowering::visitFPBinary(User &I, unsigned FPOp, unsigned VecOp) { 14421628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer const Type *Ty = I.getType(); 14431628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 14441628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 14451628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 14461628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 1447c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 1448c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 1449c7029805ef35ce9805931067b841e6af11db382eChris Lattner setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 14501628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else { 14511628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2)); 14525fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1453e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 14542c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1455e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1456e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1457e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1458e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1459e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1460e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 14611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 14621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 14631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 146445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 146545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ICmpInst *IC = cast<ICmpInst>(&I); 146645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op1 = getValue(IC->getOperand(0)); 146745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op2 = getValue(IC->getOperand(1)); 146845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 146945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer switch (IC->getPredicate()) { 147045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 147145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 147245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 147345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 147445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 147545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 147645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 147745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 147845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 147945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 148045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 148145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 148245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 148345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 148445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 148545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 148645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 148745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 148845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 148945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer FCmpInst *FC = cast<FCmpInst>(&I); 149045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op1 = getValue(FC->getOperand(0)); 149145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op2 = getValue(FC->getOperand(1)); 149245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 149345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer switch (FC->getPredicate()) { 149445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_FALSE : Opcode = ISD::SETFALSE; 149545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OEQ : Opcode = ISD::SETOEQ; 149645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OGT : Opcode = ISD::SETOGT; 149745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OGE : Opcode = ISD::SETOGE; 149845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OLT : Opcode = ISD::SETOLT; 149945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OLE : Opcode = ISD::SETOLE; 150045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ONE : Opcode = ISD::SETONE; 150145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ORD : Opcode = ISD::SETO; 150245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UNO : Opcode = ISD::SETUO; 150345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UEQ : Opcode = ISD::SETUEQ; 150445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UGT : Opcode = ISD::SETUGT; 150545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UGE : Opcode = ISD::SETUGE; 150645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ULT : Opcode = ISD::SETULT; 150745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ULE : Opcode = ISD::SETULE; 150845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UNE : Opcode = ISD::SETUNE; 150945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_TRUE : Opcode = ISD::SETTRUE; 151045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 151145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 151245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETFALSE; 151345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 151445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 151545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 151645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 151745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 15181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode, 1519f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode UnsignedOpcode, 1520f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpcode) { 15211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 15221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 15231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode Opcode = SignedOpcode; 152480235d508e5f7a9603ef43ba6625984173ff0323Evan Cheng if (!FiniteOnlyFPMath() && I.getOperand(0)->getType()->isFloatingPoint()) 1525f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng Opcode = FPOpcode; 1526f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng else if (I.getOperand(0)->getType()->isUnsigned()) 15271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Opcode = UnsignedOpcode; 15287cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 15291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 15321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 15331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 15341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 1535b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner if (!isa<PackedType>(I.getType())) { 1536b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1537b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1538b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1539b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1540b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1541b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1542b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 15431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 15473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 15483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 15513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 15543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 15553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 15563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 15593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 15623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 15633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 15643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 15673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 15703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 15713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 15743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 15773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 15783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 15813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 15843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 15853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 15883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 15913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 15923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 15953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 15983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 15993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 16023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 16053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 16063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 16093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 16123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 16133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 16141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1615e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 161628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 16183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 16193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 16203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 16223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 16233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 16243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 16273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 16283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 16293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 16313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 16333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 16343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 16363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 16373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 16403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 1642e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 16433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast to a vector from something else. 16443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the output vector. 1645e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 1646e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1647e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1648e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1649e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 16503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 16513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer } 16523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 16533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (SrcVT == MVT::Vector) { 16543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast from a vctor to something else. 16553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the input vector. 1656e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 16573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 16581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 16593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 16613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 16623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 16633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 16643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 16661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 16671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16682bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1669c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1670c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1671c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1672c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1673c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16742332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 16752332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 16762332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 16772332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1678c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1679c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16802bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1681384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1682384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1683384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1684384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1685384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1686384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1687384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1688c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16893e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 16903e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 16913e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 16923e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 16933e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 16943e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 16953e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 16963e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 16973e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 16983e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 16993e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 17003e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 17011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 17021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 17031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 17041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 17061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 17071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1708c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 1709b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 17101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 17111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1712a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field]; 17131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1714dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 17151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 17171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 17181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 17197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 17217c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 1722b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 17237c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner uint64_t Offs; 1724b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getType()->isSigned()) 1725b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Offs = (int64_t) 1726b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 17277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 1728b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Offs = 1729b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getZExtValue(); 17307c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 17317c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 17327c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 17337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1735a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 17367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 17377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 17397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 17407c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 17417c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (Idx->getType()->isSigned()) 17427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 17437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 17447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN); 17457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 17467c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 17477c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17487c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 17497c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 17507c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 17517c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 17527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 17536b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 17541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 17557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 17561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17577c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17587c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 17597c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 17607c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 17611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 17641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 17671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 17681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 17691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 17701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 17711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 1773a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 1774a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 1775ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman I.getAlignment()); 17761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 177868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 177968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 178068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 178168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 178268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 17831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 178468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 17851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 17861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 17881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 17891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 17901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 17911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 17921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 17931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 17941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 17951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 17961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 17971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 17981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 17991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 18001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 18011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 18021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1803bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 1804f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 1805f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 1806f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 18071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DAG.setRoot(setValue(&I, DSA).getValue(1)); 18081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 18101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 18111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 18121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 18151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 1816edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1817d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 1818d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 1819d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 1820d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 1821d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 1822d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 1823d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 182428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 1825466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 182628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 182728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 182828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 182928b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 1830466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 183128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 18325fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 18338cfa57b1b4eade4e0101195b2f94ab288cd03563Nate Begeman if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 18344ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1835466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, 1836466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng DAG.getSrcValue(SV)); 18375fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 1838466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, isVolatile); 18395fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1840d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 184128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 1842d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 1843d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 1844d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 184528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 184628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 18471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 18511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 18521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 18531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 18548b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 18558b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.isVolatile())); 18561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18580eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 18590eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 18600eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 18610eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 18620eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 18630eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 18640eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 18650eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 18660eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1867e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 1868e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 1869e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 1870e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 1871e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 1872e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 1873e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 1874e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 1875e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 18760eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 18770eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 18780eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 18790eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 18807255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 1881e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 18820eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18830eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 1884bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 1885e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 1886e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 1887e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 1888e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 1889e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 1890e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 1891e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 1892e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 18930eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18940eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 18950eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 18960eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18970eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 18980eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 18990eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 19000eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19010eade319cdb72e24c11d068728a98083737c6435Chris Lattner // If this is a vector type, force it to the right packed type. 19020eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 19030eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType()); 19040eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 19050eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19060eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 19070eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 19080eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 19090eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19100eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19110eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 19120eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 19130eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 19140eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19150eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19160eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 19170eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 19180eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 19190eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 19200eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 19210eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 19220eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19230eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 19240eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 19250eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19260eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19270eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 19280eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 19290eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19300eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 19310eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 19320eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1933f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 1934f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 19350eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 193648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 193748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 1938f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 1939f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 194048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 1941f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 1942f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 194348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 1944f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 1945f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 194648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 1947e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 1948e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 1949e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 1950e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 1951e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 1952e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 1953e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 19540eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 19550eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) { 19560eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 19570eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 19580eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 19590eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 19600eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19610eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 19620eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19630eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 19640eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1965c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 1966c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 1967c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 1968c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 1969c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 1970c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 19710eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 19720eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 19730eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 19740eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 1975c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 1976c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 1977c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 1978c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0; 1979c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0; 1980c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 1981d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 1982c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 1983c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 1984d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 1985c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 198603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 198703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 198803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 198903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 199003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 199103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 199203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 199303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 199403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 199503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 199603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 199703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 1998c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 199986cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 2000ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 200143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 2002fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) { 2003bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 200436ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2005bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2006bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2007bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2008ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 200943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext()); 2010ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 201143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 201243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2013bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2014bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2015ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2016bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 201786cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 201843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2019b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 202036ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 202143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 202243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 202343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 2024fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) { 202543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext()); 2026bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, getRoot(), 2027bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 202843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 202943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2030b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 203143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 203243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 203343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 203443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 2035fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) { 203643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext()); 2037bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, 2038bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 203943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 204043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2041b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 204243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 204343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 204443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 204543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 2046fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && FSI.getSubprogram() && 2047fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey DebugInfo->Verify(FSI.getSubprogram())) { 204843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram()); 2049bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, 2050bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 205143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 205243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2053b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 205443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 205543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 205643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 205743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 2058bf7637d59028a5d9911769810f537c499e23bb8eJim Laskey if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) { 20590892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2060bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 206143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex()); 206243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 206343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 206443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 206543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2066c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 20670b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f32: 20680b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f64: 2069c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)), 2070c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(2)), ISD::SETUO)); 2071c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2072c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 20730b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 20740b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2075c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2076c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2077c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2078c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 20796ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 20806ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 20816ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 20826ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 20836ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 20846ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 20856ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2086c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2087c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2088c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2089c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2090c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 20918b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2092bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2093f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2094f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2095f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 20968b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 20978b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 209851b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 20998b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2100d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i16: 2101d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i32: 2102d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i64: 2103d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2104d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2105d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2106d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 21070b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i8: 21080b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i16: 21090b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i32: 21100b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i64: 2111c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTTZ, 2112c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2113c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2114c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 21150b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i8: 21160b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i16: 21170b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i32: 21180b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i64: 2119c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTLZ, 2120c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2121c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2122c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 21230b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i8: 21240b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i16: 21250b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i32: 21260b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i64: 2127c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTPOP, 2128c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2129c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2130c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2131140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2132bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2133f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2134f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2135140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2136140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2137140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2138140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 213939a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 214039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 214139a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2142140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 214339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2144ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2145ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2146ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 2147c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2148c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2149c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2150c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 21511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 215264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2153c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 2154c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (F->isExternal()) 2155c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2156c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2157c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2158c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2159c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2160c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2161a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2162a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2163a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2164a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2165a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2166a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2167a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2168a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2169a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2170a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2171a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2172a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2173c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2174c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2175c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2176c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2177c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2178c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2179c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2180c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2181f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2182f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 218306a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2184c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2185f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2186f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2187f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2188c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2189f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2190f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 219106a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2192c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2193f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2194f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2195f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2196f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2197c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2198ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2199ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2200ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2201c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2202edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 220364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 220464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 220564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 220664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 220764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 22081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2209c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner Args.reserve(I.getNumOperands()); 22101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 22111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Arg = I.getOperand(i); 22121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand ArgNode = getValue(Arg); 22131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(ArgNode, Arg->getType())); 22141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2215edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 22168e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType()); 22178e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 2218edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2219cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 22209092fa310c8b2b1645b0d448c4c34b1e8ddc131dChris Lattner TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(), 2221adf6a965a321372c640845407195594835921eb4Chris Lattner I.isTailCall(), Callee, Args, DAG); 22221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getType() != Type::VoidTy) 2223cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); 2224cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 22251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2227864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 22289f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 2229864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 2230864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 2231864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 2232864635ad7b3046d3042311423071152c613961deChris Lattner 2233864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 2234864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 2235864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 2236864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 2237864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 2238693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Chain = Hi.getValue(1); 2239693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Flag = Hi.getValue(2); 22409f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 22419f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 22429f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 22439f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 2244864635ad7b3046d3042311423071152c613961deChris Lattner } 2245864635ad7b3046d3042311423071152c613961deChris Lattner 2246cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 2247864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 2248864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 2249864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 2250864635ad7b3046d3042311423071152c613961deChris Lattner 2251cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 2252cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 2253cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2254cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 2255cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2256cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } else { 2257864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2258cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 2259864635ad7b3046d3042311423071152c613961deChris Lattner} 2260864635ad7b3046d3042311423071152c613961deChris Lattner 2261c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2262c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 2263c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 2264c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2265a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 2266a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 2267c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 2268c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 2269c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2270c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 22710c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (MVT::isInteger(RegVT)) { 22720c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 22730c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 22740c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 22750c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 22760c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner } else 2277c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 2278c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2279c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 2280c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2281c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 22829f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 22839f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 22849f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 22859f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 22869f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 2287c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 2288a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 22899f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 2290c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2291c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2292c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2293c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2294864635ad7b3046d3042311423071152c613961deChris Lattner 2295c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2296c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2297c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2298c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 22999f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 2300c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32)); 2301c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 2302c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 2303c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2304864635ad7b3046d3042311423071152c613961deChris Lattner 2305864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 2306864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 2307864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 2308864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 23099b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 23109b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 2311f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 2312f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 23139b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 23149b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 2315f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 2316f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 23179b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 23189b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 23199b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 23209b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 23219b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 23229b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 2323f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 2324f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 2325f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 2326f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 2327f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 2328f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 2329f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2330f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 23319b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 23329b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 23339b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2334f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 23359b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2336864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 2337864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 2338864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 2339864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 23409b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 23419b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 2342f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 2343f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 2344f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 2345f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 2346f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 2347f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2348f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 2349864635ad7b3046d3042311423071152c613961deChris Lattner } 2350f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 2351864635ad7b3046d3042311423071152c613961deChris Lattner} 2352864635ad7b3046d3042311423071152c613961deChris Lattner 2353864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 2354864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 2355864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 2356864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 23574e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 2358864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 2359864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 2360864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 2361864635ad7b3046d3042311423071152c613961deChris Lattner 2362864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 2363864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 2364864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 2365864635ad7b3046d3042311423071152c613961deChris Lattner 23662a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 23672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 2368864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 2369864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 2370864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 2371cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 2372cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 2373cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 2374cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 2375cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 2376864635ad7b3046d3042311423071152c613961deChris Lattner 2377864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 2378864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 2379864635ad7b3046d3042311423071152c613961deChris Lattner 2380864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 2381864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 2382864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 2383864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 2384864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 2385864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 2386864635ad7b3046d3042311423071152c613961deChris Lattner 2387864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 2388864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 2389864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 2390864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 2391864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 2392864635ad7b3046d3042311423071152c613961deChris Lattner } 2393864635ad7b3046d3042311423071152c613961deChris Lattner } 2394864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 2395864635ad7b3046d3042311423071152c613961deChris Lattner } 2396864635ad7b3046d3042311423071152c613961deChris Lattner 23972a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 23982a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 23992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 24002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (PhysReg.second) { 24012a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 24022a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 24032a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 24042a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (!isOutReg || !isInReg) { 24052a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (VT == MVT::Other) 24062a821601f1db665fbb825727aacf1a54d17b91efChris Lattner ValueVT = *PhysReg.second->vt_begin(); 24072a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 24082a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24092a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 24102a821601f1db665fbb825727aacf1a54d17b91efChris Lattner SSARegMap *RegMap = DAG.getMachineFunction().getSSARegMap(); 24112a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 24122a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 24132a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 24152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 24162a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24172a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 24182a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 24192a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 24202a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 24222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 24232a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 24242a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 24252a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 24262a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 2427864635ad7b3046d3042311423071152c613961deChris Lattner 24284e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 24294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 2430864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 2431864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 2432864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 24334e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 2434864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 2435864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 2436864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2437864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2438864635ad7b3046d3042311423071152c613961deChris Lattner continue; 2439864635ad7b3046d3042311423071152c613961deChris Lattner } 2440864635ad7b3046d3042311423071152c613961deChris Lattner 24414e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 24424e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 24439b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 2444864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 2445864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2446864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2447864635ad7b3046d3042311423071152c613961deChris Lattner continue; 24484e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 24494e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2450864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 2451864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 2452864635ad7b3046d3042311423071152c613961deChris Lattner 2453864635ad7b3046d3042311423071152c613961deChris Lattner // If we allocated enough consecutive 2454864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 2455864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 2456864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 2457864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 2458864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 2459864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 2460864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 2461864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 2462864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 2463864635ad7b3046d3042311423071152c613961deChris Lattner } 2464864635ad7b3046d3042311423071152c613961deChris Lattner 2465864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 2466864635ad7b3046d3042311423071152c613961deChris Lattner } 24674e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 2468864635ad7b3046d3042311423071152c613961deChris Lattner 2469864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 2470864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 24714e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 24724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2473864635ad7b3046d3042311423071152c613961deChris Lattner 2474ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 2475ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 2476ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 2477ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 2478ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2479ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 2480ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 2481ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 24822cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 24831efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 2484ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2485ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 2486ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 2487ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 2488ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 2489ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 2490ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 2491ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2492ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 2493ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 2494ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 24954e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 24964e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 24974e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 24984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 24994e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 25001efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 25014e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 25024e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 25034e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 25042223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 25051efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 25061efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 25081efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 25091efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 25101efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 25111efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 25121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 25131efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 251422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 25151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 25161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 25171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 25181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25191efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 25201efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 25211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 25221efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25231efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 25241efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 25251efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 25271efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25281efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 25291efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2530864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2531864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 25321efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2533864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2534864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2535864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2536864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2537864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 25384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 25394e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 25404e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 25414e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2542864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25434e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 25444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 25452223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2546864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25474e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 25481efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 25491efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2550864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25511efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25524e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 25534e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2554864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2555864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25564e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 25574e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 25584e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 25592cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 25600f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 25610f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2562864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2563864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 25641efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 25650f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 25666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 25672cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 25682cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 25691efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25702cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 25712cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 257222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 257322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 257422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 257522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 257622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 257722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 257822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 257922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 258122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 258222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 258322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 258522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 258622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 258822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 259022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 259122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 259222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 259322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 259422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 259522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 259622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 259722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 259822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 259922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 260022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 260122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 260222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 260322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 260422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 260522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 2606864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 2607864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 2608864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 2609864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 2610864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2611864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 26122223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 2613864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 2614864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 2615864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 2616864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 2617864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 2618864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 2619d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner if (Regs.Regs.empty()) { 2620832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 2621832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 2622d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 2623d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 26242cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 26252cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 2626864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 26272cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 26282cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 2629864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 26302cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 263122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 263222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 26332cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 26342cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 26356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 26366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 26376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 2638c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 26396656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 26406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 26416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 264222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 26434e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 26443d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 26452223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 26462223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 26472223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 26482223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 26493d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 2650c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 2651c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 2652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 2653c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 2654c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 2655c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2656c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2657a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 2658a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 2659c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2660c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 2661c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2662c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2663c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2664c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2665c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2666c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2667c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2668c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 2669c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue MatchedRegs; 2670c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 2671c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 2672c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 2673c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 2674c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.Regs.push_back(Reg); 2675c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2676c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2677c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Use the produced MatchedRegs object to 2678a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 2679a844126c43976387a66dafbe5137a762169f1f34Evan Cheng TLI.getPointerTy()); 2680c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 268187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 268287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 268387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 268487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 268587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 268687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 26873d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 268887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 268953069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 269053069fbbae2558a3138df24776448791fea3aceeChris Lattner ConstraintCode[0], DAG); 269153069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 2692832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 2693832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << ConstraintCode << "'!\n"; 269453069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 269553069fbbae2558a3138df24776448791fea3aceeChris Lattner } 2696c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 269787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 269887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 269987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 270087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 270187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 270287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 270387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 270487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 270587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Check that the operand isn't a float. 270687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 270787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2708c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 270987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 271087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 271187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 271287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 271387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 271487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 271587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 271687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 271787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 271887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 271987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 2720c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 27212223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 272287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 272387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 272487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 272587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 272687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 272787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 272887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 272987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 273087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 273187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 2732a844126c43976387a66dafbe5137a762169f1f34Evan Cheng InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, TLI.getPointerTy()); 273387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 273487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 27356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 27366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2737c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 2738c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 2739c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 2740c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 2741c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 2742c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 2743c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 2744c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 27456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 27466656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2747c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 27486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2749ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2750ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 2751ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 2752ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 2753ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2754f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 2755f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 2756bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 2757ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 2758ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 27606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 2761864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 2762864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 27636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 27646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 27656656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 27666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 27676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 27686656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 2769864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 27706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 2771864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 2772864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 27736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2774ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 2776bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 27776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 2778786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 27796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 27808b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 27816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 2782bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 2783bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 2784ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 2785ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 2786ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2787ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 27891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 27901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 279268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 279368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 279468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 279568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 279668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 27971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 2799a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 28001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 28011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 28021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2804a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType())); 2805cf5734dddd66af9388a171b44996505ede47feedChris Lattner 2806cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2807adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true, 2808cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 2809cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 2810cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 2811cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 28121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 28151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 28161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(getValue(I.getOperand(0)), 2817a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson TLI.getTargetData()->getIntPtrType())); 28181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 2819cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2820adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true, 2821cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 2822cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 28231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2825025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 2826025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 2827025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 2828025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 2829025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 2830025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 2831025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 2832832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 2833832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 2834832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 2835025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 2836025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 2837025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 2838025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 283939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 2840acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 2841acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2842acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 284339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 284439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 28451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 2846acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 2847acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 2848acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 2849acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 2850acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 28511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 2854acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 2855acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2856acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 28571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 2860acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 2861acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2862acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 2863acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 2864acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 28651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2867b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either 2868b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate. 2869b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg, 2870b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned &i, SelectionDAG &DAG, 2871b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 2872b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) 2873b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(Arg, i++); 2874b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 2875b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 2876b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 2877b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 2878b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BIT_CONVERT, VT, 2879b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI)); 2880b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 2881b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 2882b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 2883b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 2884b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 2885b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi); 2886b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 2887b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 2888b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 2889b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 2890b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(); 2891b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 2892b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 2893fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 2894fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 2895f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 2896f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 2897fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 2898fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 2899fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 2900fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 29018c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 2902fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 2903fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 2904fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2905fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 2906fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 2907fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2908fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2909fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2910fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2911fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2912fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2913fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 2914fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2915fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 2916fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 2917fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2918fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2919fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2920fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 2921fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 2922fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 29239f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 29249f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 2925fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (unsigned i = 0; i != NumVals; ++i) 2926fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 2927fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2928fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2929fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2930fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumElems = cast<PackedType>(I->getType())->getNumElements(); 2931fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner const Type *EltTy = cast<PackedType>(I->getType())->getElementType(); 2932f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2933fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2934fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2935fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2936fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2937fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 2938fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2939fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2940fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2941fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2942fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2943fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2944fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 29453b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 29468c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 2947fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2948fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 2949f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 2950f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 2951bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 29528c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 29538c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 2954fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2955fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 2956fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 2957fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 2958fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2959fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2960fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2961fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2962fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2963fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2964fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 2965fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2966fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 2967fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 2968fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 2969fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext 2970fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner : ISD::AssertZext; 2971fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT)); 2972fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 2973fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2974fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2975fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 2976fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2977fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 2978fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2979fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2980fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2981fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2982b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // If this is a large integer or a floating point node that needs to be 2983b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // expanded, it needs to be reassembled from small integers. Figure out 2984b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // what the source elt type is and how many small integers it is. 2985b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this)); 2986fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2987fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2988fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2989020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const PackedType *PTy = cast<PackedType>(I->getType()); 2990020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 2991020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 2992f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2993fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2994fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2995fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2996d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2997020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 2998020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 2999d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 3000d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3001d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3002d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 3003d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 3004fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3005da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3006fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3007fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3008fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3009fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3010fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3011fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3012fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3013fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3014f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3015b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarCallArgs - Recursively expand call argument node by 3016b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_converting it or extract a pair of elements from the larger node. 3017b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg, 3018b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng bool isSigned, 3019b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SmallVector<SDOperand, 32> &Ops, 3020b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SelectionDAG &DAG, 3021b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 3022b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) { 3023b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(Arg); 3024b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3025b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return; 3026b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3027b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3028b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3029b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3030b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3031b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg); 3032b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarCallArgs(EVT, Arg, isSigned, Ops, DAG, TLI); 3033b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3034b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3035b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(0, TLI.getPointerTy())); 3036b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3037b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(1, TLI.getPointerTy())); 3038b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3039b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 3040b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarCallArgs(EVT, Lo, isSigned, Ops, DAG, TLI); 3041b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarCallArgs(EVT, Hi, isSigned, Ops, DAG, TLI); 3042b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3043b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3044b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3045b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3046b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3047b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3048f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3049f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3050f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3051f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3052f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 3053f4ec817299a4187044a6162c2f520772b3ad69a0Chris LattnerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, 3054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3055f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3056f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3057be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3058f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3059f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3060f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3061f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3062f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3063f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3064f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3065f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 3066f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(Args[i].second); 3067f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Op = Args[i].first; 3068f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng bool isSigned = Args[i].second->isSigned(); 3069f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3070f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3071f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3072f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3073d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3074f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3075f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3076f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3077f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng unsigned ExtOp = isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 3078f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 3079f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3080f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3081f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 3082f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3083f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3084d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3085f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3086f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3087f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3088f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 3089f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3090f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 3091b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarCallArgs(VT, Op, isSigned, Ops, DAG, *this); 3092f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3093da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3094da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 3095da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(Args[i].second); 3096da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3097da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3098da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3099da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3100da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3101da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 31021b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 31031b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner // Insert a VBIT_CONVERT of the MVT::Vector type to the packed type. 31041b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 31051b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 3106d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 31071b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 3108da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 3109da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3110da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3111f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3112f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3113f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3114f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3115f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3116f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 3117be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<MVT::ValueType, 4> RetTys; 3118f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3119f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 3120f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3121f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3122f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3123f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3124f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 3125f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3126f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3127f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 3128f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3129f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3130f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3131f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 3132f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3133f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 31349f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng MVT::ValueType NVT = getTypeToExpandTo(VT); 31359f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = getNumElements(VT); 3136f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 3137f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 3138f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3139da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3140da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 3141da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(RetTy); 3142da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3143da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3144da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3145da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3146da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3147da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3148da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3149da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 3150da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3151da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 3152da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3153da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3154f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3155f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3156f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3157f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3158f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 3159f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3160f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 3161be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 3162be384162c68641233deba8702666af51bdfd4b83Chris Lattner DAG.getVTList(&RetTys[0], RetTys.size()), 3163be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 3164f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3165f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 3166f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 3167f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 3168f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 3169f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 3170f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3171f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 3172f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 3173f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3174f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 3175f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 3176da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 3177da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBITCONVERT to convert from the packed result type to the 3178da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 3179da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = cast<PackedType>(RetTy)->getNumElements(); 3180da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = cast<PackedType>(RetTy)->getElementType(); 3181da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3182da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3183da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3184da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3185da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3186da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 3187da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 3188da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 3189d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3190d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3191da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3192da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3193da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3194da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 3195f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned AssertOp = RetTy->isSigned() ? 3196f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::AssertSext : ISD::AssertZext; 3197f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 3198f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 3199f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 3200f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3201f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 32021a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng if (getTypeAction(VT) == Expand) 32031a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::BIT_CONVERT, VT, ResVal); 32041a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng else 32051a8f1fe676f1d83e0da7336e744ebcdcc14a88c4Evan Cheng ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 3206f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3207f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3208f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 3209f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 3210f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 3211f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3212f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3213f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 3214f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3215f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3216f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3217f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 3218f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 3219f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3220f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3221f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 322239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// It is always conservatively correct for llvm.returnaddress and 322339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// llvm.frameaddress to return 0. 3224f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// 3225f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be 3226f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// expanded to 0 if the target wants. 322739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnerstd::pair<SDOperand, SDOperand> 322839ae3622791986a0232f7e4797b633f8fa9e54d2Chris LattnerTargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, 322939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth, SelectionDAG &DAG) { 323039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain); 32311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 323350381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 3234171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 3235171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 3236d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 3237171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 3238171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 32390aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 32400aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 32410aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 32420aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 32430aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 32440aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 32450aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 324639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) { 3247b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Depth = (unsigned)cast<ConstantInt>(I.getOperand(1))->getZExtValue(); 324839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner std::pair<SDOperand,SDOperand> Result = 3249a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG); 325039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner setValue(&I, Result.first); 325139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner DAG.setRoot(Result.second); 325239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 32531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 325474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 32551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 32561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 3257a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 32581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 32591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 32601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 32611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 32621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 32631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 32641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 32651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 32661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 32681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 32691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 32701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 32711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 32721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 32731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 32741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 32751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 32761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 32771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 32781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 32801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 32811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 32831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 328474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 328574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 328674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 328774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 328874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 328974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 329074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 329174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 329274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 329374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 329474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 3295a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 329674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 329774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 329874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 329974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 330074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 33011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 33021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 33031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 33041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 33051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 33061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 33071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3308c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 330980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 331080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 3311c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 3312c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 3313c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 33141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 33151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 33171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 33181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 33191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 33201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 33211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 33221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 33231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 33241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 33251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 33261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 33271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 33281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 33291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 33301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 33311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 33321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 33331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 33341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 333580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 333680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 333780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 333880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 33391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 334080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 334180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 334280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 3343dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 33441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 33451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 33461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 33471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 33481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 33491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 335080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 335180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 335280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 335380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 33541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 33551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 33561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 335780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 335880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 33591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 33601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33617041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 33621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 33631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 33641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 33651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 33661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 33671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 33681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 33701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 33711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 33731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 3374bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 33751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 3376ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 33771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 3378c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 3379c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 338080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 33811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 33821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 33831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 33841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 3385a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 3386786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 3387864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 33888b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 3389c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 3390c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 3391c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3392c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3393c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 3394c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3395c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 3396c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 3397c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 3398c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 3399cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 340074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 340174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 3402cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 340374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 340474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 340574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 340674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 340774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 340874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 340974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 3410cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 341174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 341274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 341374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 3414f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 34150937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 3416cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 3417cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 3418cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 3419cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 3420cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 342174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 342274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3423c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 3424c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 3425c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 342674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 342774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3428cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 342974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 343074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 343174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3432786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3433786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 34348b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 343574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 343674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 343774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 3438466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 343974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 344074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3441786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3442786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 34438b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 344474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 3445c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 344674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 344774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 34481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3450c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 34511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3453c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 3454c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 3455bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 3456bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 3457c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 3458c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 34591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3461bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 34621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 34657041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 34667041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 34671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 34691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 34701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3472495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 347336b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // FIXME: we only modify the CFG to split critical edges. This 347436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // updates dom and loop info. 3475c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 3476495a0b51915eb763576874f29192820b731edc22Chris Lattner} 34771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3478c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 34797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// OptimizeNoopCopyExpression - We have determined that the specified cast 34807e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// instruction is a noop copy (e.g. it's casting from one pointer type to 34817e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// another, int->uint, or int->sbyte on PPC. 3482903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// 3483903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// Return true if any changes are made. 3484903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI) { 34857e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *DefBB = CI->getParent(); 34867e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34877e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner /// InsertedCasts - Only insert a cast in each block once. 34887e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner std::map<BasicBlock*, CastInst*> InsertedCasts; 34897e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 3490903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = false; 34917e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 34927e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UI != E; ) { 34937e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Use &TheUse = UI.getUse(); 34947e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *User = cast<Instruction>(*UI); 34957e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34967e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Figure out which BB this cast is used in. For PHI's this is the 34977e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // appropriate predecessor block. 34987e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *UserBB = User->getParent(); 34997e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 35007e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner unsigned OpVal = UI.getOperandNo()/2; 35017e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UserBB = PN->getIncomingBlock(OpVal); 35027e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 35037e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35047e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Preincrement use iterator so we don't invalidate it. 35057e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner ++UI; 35067e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35077e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this user is in the same block as the cast, don't change the cast. 35087e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (UserBB == DefBB) continue; 35097e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35107e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If we have already inserted a cast into this block, use it. 35117e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 35127e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35137e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (!InsertedCast) { 35147e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock::iterator InsertPt = UserBB->begin(); 35157e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 35167e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35177e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner InsertedCast = 35187b06bd532d3324a2f76bbc856ae20ff89d8e0e92Reid Spencer CastInst::create(CI->getOpcode(), CI->getOperand(0), CI->getType(), "", 35197b06bd532d3324a2f76bbc856ae20ff89d8e0e92Reid Spencer InsertPt); 3520903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = true; 35217e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 35227e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 35237e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Replace a use of the cast with a use of the new casat. 35247e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner TheUse = InsertedCast; 35257e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 3526903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3527903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If we removed all uses, nuke the cast. 3528903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->use_empty()) 3529903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner CI->eraseFromParent(); 3530903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3531903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return MadeChange; 35327e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner} 3533c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3534903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset, 3535903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// casting to the type of GEPI. 3536f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattnerstatic Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB, 3537f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *GEPI, Value *Ptr, 3538f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Value *PtrOffset) { 3539903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (V) return V; // Already computed. 3540903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 35413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Figure out the insertion point 3542903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner BasicBlock::iterator InsertPt; 3543903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (BB == GEPI->getParent()) { 35443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // If GEP is already inserted into BB, insert right after the GEP. 3545903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = GEPI; 3546903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ++InsertPt; 3547903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3548903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Otherwise, insert at the top of BB, after any PHI nodes 3549903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = BB->begin(); 3550903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 3551903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3552903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3553903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into 3554903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // BB so that there is only one value live across basic blocks (the cast 3555903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // operand). 3556903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CastInst *CI = dyn_cast<CastInst>(Ptr)) 3557903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType())) 35587b06bd532d3324a2f76bbc856ae20ff89d8e0e92Reid Spencer Ptr = CastInst::create(CI->getOpcode(), CI->getOperand(0), CI->getType(), 35597b06bd532d3324a2f76bbc856ae20ff89d8e0e92Reid Spencer "", InsertPt); 3560903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3561903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Add the offset, cast it to the right type. 3562903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt); 35633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Ptr is an integer type, GEPI is pointer type ==> IntToPtr 35643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return V = CastInst::create(Instruction::IntToPtr, Ptr, GEPI->getType(), 35653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer "", InsertPt); 3566903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3567903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3568903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to 3569903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One 3570903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's 3571903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to 3572903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// sink PtrOffset into user blocks where doing so will likely allow us to fold 3573903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// the constant add into a load or store instruction. Additionally, if a user 3574903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// is a pointer-pointer cast, we look through it to find its users. 3575903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr, 3576903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Constant *PtrOffset, BasicBlock *DefBB, 3577903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GetElementPtrInst *GEPI, 3578f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> &InsertedExprs) { 3579903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (!RepPtr->use_empty()) { 3580903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Instruction *User = cast<Instruction>(RepPtr->use_back()); 3581903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 35823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // If the user is a Pointer-Pointer cast, recurse. Only BitCast can be 35833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // used for a Pointer-Pointer cast. 35843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (isa<BitCastInst>(User)) { 3585903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3586903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3587903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we 3588903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // could invalidate an iterator. 3589903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->setOperand(0, UndefValue::get(RepPtr->getType())); 3590903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner continue; 3591903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3592903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3593903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a load of the pointer, or a store through the pointer, emit 3594903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // the increment into the load/store block. 3595f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *NewVal; 3596903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<LoadInst>(User) || 3597903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) { 3598903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()], 3599903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->getParent(), GEPI, 3600903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3601903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3602903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this use is not foldable into the addressing mode, use a version 3603903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // emitted in the GEP block. 3604903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI, 3605903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3606903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3607903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3608f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner if (GEPI->getType() != RepPtr->getType()) { 3609f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner BasicBlock::iterator IP = NewVal; 3610f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner ++IP; 36113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // NewVal must be a GEP which must be pointer type, so BitCast 36123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer NewVal = new BitCastInst(NewVal, RepPtr->getType(), "", IP); 3613f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner } 3614903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->replaceUsesOfWith(RepPtr, NewVal); 3615903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3616903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3617903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3618903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3619c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction 3620c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// selection, we want to be a bit careful about some things. In particular, if 3621c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// we have a GEP instruction that is used in a different block than it is 3622c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// defined, the addressing expression of the GEP cannot be folded into loads or 3623c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// stores that use it. In this case, decompose the GEP and move constant 3624c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// indices into blocks that use it. 3625903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeGEPExpression(GetElementPtrInst *GEPI, 3626a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD) { 3627c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP is only used inside the block it is defined in, there is no 3628c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // need to rewrite it. 3629c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool isUsedOutsideDefBB = false; 3630c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock *DefBB = GEPI->getParent(); 3631c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end(); 3632c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner UI != E; ++UI) { 3633c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (cast<Instruction>(*UI)->getParent() != DefBB) { 3634c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner isUsedOutsideDefBB = true; 3635c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3636c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3637c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3638903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!isUsedOutsideDefBB) return false; 3639c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3640c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP has no non-zero constant indices, there is nothing we can do, 3641c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // ignore it. 3642c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool hasConstantIndex = false; 3643903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool hasVariableIndex = false; 3644c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3645c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3646903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) { 3647b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue()) { 3648c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner hasConstantIndex = true; 3649c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3650c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3651903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3652903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner hasVariableIndex = true; 3653903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3654c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3655903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3656903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a "GEP X, 0, 0, 0", turn this into a cast. 3657903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !hasVariableIndex) { 36583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer /// The GEP operand must be a pointer, so must its result -> BitCast 36593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Value *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(), 3660903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->getName(), GEPI); 3661903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->replaceAllUsesWith(NC); 3662903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->eraseFromParent(); 3663903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3664903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3665903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 36663802c2552fe4475418db3c948e7601d7259f996dChris Lattner // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses. 3667903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0))) 3668903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return false; 3669c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3670c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the 3671c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constant offset (which we now know is non-zero) and deal with it later. 3672c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner uint64_t ConstantOffset = 0; 3673a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const Type *UIntPtrTy = TD->getIntPtrType(); 36743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Value *Ptr = new PtrToIntInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI); 3675c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner const Type *Ty = GEPI->getOperand(0)->getType(); 3676c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3677c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3678c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3679c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Idx = *OI; 3680c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 3681b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 3682c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (Field) 3683a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field]; 3684c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = StTy->getElementType(Field); 3685c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } else { 3686c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 3687c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3688c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Handle constant subscripts. 3689c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 3690b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 3691b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getType()->isSigned()) 3692b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CI->getSExtValue(); 3693c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner else 3694b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer ConstantOffset += TD->getTypeSize(Ty)*CI->getZExtValue(); 3695c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner continue; 3696c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3697c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3698c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Ptr = Ptr + Idx * ElementSize; 3699c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3700c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Cast Idx to UIntPtrTy if needed. 37017b06bd532d3324a2f76bbc856ae20ff89d8e0e92Reid Spencer Idx = CastInst::createIntegerCast(Idx, UIntPtrTy, true/*SExt*/, "", GEPI); 3702c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3703a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 3704c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Mask off bits that should not be set. 3705c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3706b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Constant *SizeCst = ConstantInt::get(UIntPtrTy, ElementSize); 3707c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3708c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Multiply by the element size and add to the base. 3709c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI); 3710c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI); 3711c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3712c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3713c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3714c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Make sure that the offset fits in uintptr_t. 3715c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3716b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Constant *PtrOffset = ConstantInt::get(UIntPtrTy, ConstantOffset); 3717c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3718c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Okay, we have now emitted all of the variable index parts to the BB that 3719c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // the GEP is defined in. Loop over all of the using instructions, inserting 3720c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // an "add Ptr, ConstantOffset" into each block that uses it and update the 3721c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // instruction to use the newly computed value, making GEPI dead. When the 3722c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // user is a load or store instruction address, we emit the add into the user 3723c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // block, otherwise we use a canonical version right next to the gep (these 3724c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // won't be foldable as addresses, so we might as well share the computation). 3725c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner 3726f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> InsertedExprs; 3727903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3728c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3729c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Finally, the GEP is dead, remove it. 3730c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner GEPI->eraseFromParent(); 3731903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3732903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3733c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner} 3734c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3735bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3736bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// SplitEdgeNicely - Split the critical edge from TI to it's specified 3737bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// successor if it will improve codegen. We only do this if the successor has 3738bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// phi nodes (otherwise critical edges are ok). If there is already another 3739bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// predecessor of the succ that is empty (and thus has no phi nodes), use it 3740bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// instead of introducing a new block. 3741bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattnerstatic void SplitEdgeNicely(TerminatorInst *TI, unsigned SuccNum, Pass *P) { 3742bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *TIBB = TI->getParent(); 3743bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *Dest = TI->getSuccessor(SuccNum); 3744bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner assert(isa<PHINode>(Dest->begin()) && 3745bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner "This should only be called if Dest has a PHI!"); 3746bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3747bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner /// TIPHIValues - This array is lazily computed to determine the values of 3748bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner /// PHIs in Dest that TI would provide. 3749bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner std::vector<Value*> TIPHIValues; 3750bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3751bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Check to see if Dest has any blocks that can be used as a split edge for 3752bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // this terminator. 3753bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner for (pred_iterator PI = pred_begin(Dest), E = pred_end(Dest); PI != E; ++PI) { 3754bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *Pred = *PI; 3755bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // To be usable, the pred has to end with an uncond branch to the dest. 3756bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BranchInst *PredBr = dyn_cast<BranchInst>(Pred->getTerminator()); 3757bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (!PredBr || !PredBr->isUnconditional() || 3758bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Must be empty other than the branch. 3759bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner &Pred->front() != PredBr) 3760bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner continue; 3761bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3762bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Finally, since we know that Dest has phi nodes in it, we have to make 3763bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // sure that jumping to Pred will have the same affect as going to Dest in 3764bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // terms of PHI values. 3765bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner PHINode *PN; 3766bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner unsigned PHINo = 0; 3767bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner bool FoundMatch = true; 3768bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner for (BasicBlock::iterator I = Dest->begin(); 3769bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I, ++PHINo) { 3770bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (PHINo == TIPHIValues.size()) 3771bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner TIPHIValues.push_back(PN->getIncomingValueForBlock(TIBB)); 3772bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3773bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // If the PHI entry doesn't work, we can't use this pred. 3774bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (TIPHIValues[PHINo] != PN->getIncomingValueForBlock(Pred)) { 3775bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner FoundMatch = false; 3776bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner break; 3777bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3778bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3779bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3780bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // If we found a workable predecessor, change TI to branch to Succ. 3781bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (FoundMatch) { 3782bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner Dest->removePredecessor(TIBB); 3783bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner TI->setSuccessor(SuccNum, Pred); 3784bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner return; 3785bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3786bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3787bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3788bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner SplitCriticalEdge(TI, SuccNum, P, true); 3789bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner} 3790bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3791bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 37921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 37931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 37941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 3795832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 37961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 379747e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner // First, split all critical edges. 3798c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 37997e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // In this pass we also look for GEP and cast instructions that are used 38007e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // across basic blocks and rewrite them to improve basic-block-at-a-time 38017e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // selection. 38027e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // 3803903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = true; 3804903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (MadeChange) { 3805903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = false; 380636b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 3807bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Split all critical edges where the dest block has a PHI. 380847e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner TerminatorInst *BBTI = BB->getTerminator(); 380947e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner if (BBTI->getNumSuccessors() > 1) { 381047e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner for (unsigned i = 0, e = BBTI->getNumSuccessors(); i != e; ++i) 3811bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (isa<PHINode>(BBTI->getSuccessor(i)->begin()) && 3812bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner isCriticalEdge(BBTI, i, true)) 3813bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner SplitEdgeNicely(BBTI, i, this); 381447e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner } 381547e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner 3816c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 381757f9a43c64e8c5c8b2566fb6649754c11b59b98aChris Lattner for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) { 38187e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *I = BBI++; 38193f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 38203f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (CallInst *CI = dyn_cast<CallInst>(I)) { 38213f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner // If we found an inline asm expession, and if the target knows how to 38223f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner // lower it to normal LLVM code, do so now. 38233f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (isa<InlineAsm>(CI->getCalledValue())) 38243f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (const TargetAsmInfo *TAI = 38253f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner TLI.getTargetMachine().getTargetAsmInfo()) { 38263f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (TAI->ExpandInlineAsm(CI)) 38273f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner BBI = BB->begin(); 38283f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner } 38293f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 3830903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData()); 38317e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } else if (CastInst *CI = dyn_cast<CastInst>(I)) { 3832c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // If the source of the cast is a constant, then this should have 3833c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // already been constant folded. The only reason NOT to constant fold 3834c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // it is if something (e.g. LSR) was careful to place the constant 3835c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // evaluation in a block other than then one that uses it (e.g. to hoist 3836c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // the address of globals out of a loop). If this is the case, we don't 3837c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // want to forward-subst the cast. 3838c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner if (isa<Constant>(CI->getOperand(0))) 3839c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner continue; 3840c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner 38417e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is a noop copy, sink it into user blocks to reduce the number 38427e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // of virtual registers that must be created and coallesced. 38437e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 38447e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType DstVT = TLI.getValueType(CI->getType()); 38457e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38467e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // This is an fp<->int conversion? 38477e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT)) 38487e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner continue; 38497e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38507e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is an extension, it will be a zero or sign extension, which 38517e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // isn't a noop. 38527e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT < DstVT) continue; 38537e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38547e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If these values will be promoted, find out what they will be promoted 38557e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 38567e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // are. 38577e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) 38587e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner SrcVT = TLI.getTypeToTransformTo(SrcVT); 38597e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(DstVT) == TargetLowering::Promote) 38607e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner DstVT = TLI.getTypeToTransformTo(DstVT); 38617e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 38637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT == DstVT) 3864903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeNoopCopyExpression(CI); 38657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 38667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 386736b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner } 3868903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3869c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 38701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 38711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 38731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3874edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 38751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 38761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3878571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 3879571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 3880571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 388118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3882d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 388318c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3884d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3885d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3886d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3887d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3888d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3889d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3890571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 38911c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 389270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 389370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 389470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()), 389570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 38961c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 389770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 389870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 389970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 390070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 390170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 390270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 390370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 390470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 390570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 3906bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 3907571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Root = getRoot(); 390870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 390970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 3910a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(i, TLI.getPointerTy())); 391170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 391270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 391370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 391470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 391570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 391670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 391770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 391870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 391970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 392070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 392170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 392270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 392370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 392470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3925a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 392670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3927a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 392870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 392970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 393070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 39311c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 3932bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, 3933bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 39349f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng } else if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) { 3935d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 3936fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 3937fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 3938fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 3939fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 3940571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 3941d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 39429f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DestVT = TLI.getTypeToExpandTo(SrcVT); 39439f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng unsigned NumVals = TLI.getNumElements(SrcVT); 39449f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng if (NumVals == 1) 39459f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng return DAG.getCopyToReg(getRoot(), Reg, 39469f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng DAG.getNode(ISD::BIT_CONVERT, DestVT, Op)); 39479f87788040786b1bc6530763e4cf7e105bfb2924Evan Cheng assert(NumVals == 2 && "1 to 4 (and more) expansion not implemented!"); 3948d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 3949d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3950a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 3951d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3952a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 3953571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Op = DAG.getCopyToReg(getRoot(), Reg, Lo); 3954d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 3955d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 39561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3958068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 3959068a81e9fca511b9a3b3a0f28a8988a57f994652Chris LattnerLowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL, 3960068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 39611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 3962068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner Function &F = *BB->getParent(); 39630afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 3964bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 3965bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 3966bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3967bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 3968bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 3969bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 3970bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 3971bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 3972f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3973bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 3974bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 3975bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (FuncInfo.ValueMap.count(AI)) { 3976bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand Copy = 3977571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(AI, FuncInfo.ValueMap[AI]); 3978bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 3979bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 39800afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 3981bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3982bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 3983966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 3984bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 3985068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 3986068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3987068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 3988068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 3989f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3990068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 3991068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3992068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 3993edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3994bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 3995bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (LLVMBB == &LLVMBB->getParent()->front()) 3996bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 39971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 39991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 40001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 40021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 40031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 40041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4005f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 40061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 40071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 40081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4009f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 4010ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 40111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4012ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4013571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 40141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 40171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 40181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 40191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 40201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 40211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4022edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 40238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 40241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 40261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4027d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 40288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 40298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 40308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 40318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 40328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 40341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 40351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 40361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4037d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 40388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4039d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 40408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 40418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 40428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 40438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 40448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 40458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 40471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 40481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 40501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 40511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 40521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 40538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 40548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 40558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 40568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 40588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 40593f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 40608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 40618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 40628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 40638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 40648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 40658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 40661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 40688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 40698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 40708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 40718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 40728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 40738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 40748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 40758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 40768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 40777e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 40781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 40818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 40828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 40838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 40848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 40858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 40868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 40878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 40888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 40898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 40908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 40918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 40928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 40938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 40948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 40951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 40971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4098ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 40995a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 41007436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 41017436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 41027436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 41037436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 41047436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 41057436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 41067436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 41077436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 41087436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 41097436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 41107436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 41117436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4112bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4113bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4114ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4115ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 41161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 41171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*LLVMBB->getTerminator()); 4118a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4119f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 412037efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4121f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4122f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 412337efe6764568a3829fee26aba532283131d1a104Nate Begeman JT = SDL.JT; 4124f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4125a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4126a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 41271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4129f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4130c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4131c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4132c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4133af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4134c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 41352300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4136832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 41371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4138f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 41401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4141ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4142f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4143832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 41441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4145f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4146af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4147c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 41482300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4149a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4150552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4151a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4152a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 41531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4154f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4155832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 41561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4157f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 4163f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 4164f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4165f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4166f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4167f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4168f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 41691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4171f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4173f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4174a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 41751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 417637efe6764568a3829fee26aba532283131d1a104Nate Begeman if (SwitchCases.empty() && JT.Reg == 0) { 4177f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4178f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4179f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4180f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 418109e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4182f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4183f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4184f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 41851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4186f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41879453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 41889453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 41899453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 419037efe6764568a3829fee26aba532283131d1a104Nate Begeman if (JT.Reg) { 419137efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(SwitchCases.empty() && "Cannot have jump table and lowered switch"); 419237efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 419337efe6764568a3829fee26aba532283131d1a104Nate Begeman CurDAG = &SDAG; 419437efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 41959453eea49bca1c3904047db495855c93e001d1cdNate Begeman MachineBasicBlock *RangeBB = BB; 419637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 419737efe6764568a3829fee26aba532283131d1a104Nate Begeman BB = JT.MBB; 419837efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.setCurrentBasicBlock(BB); 419937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 420037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.visitJumpTable(JT); 420137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDAG.setRoot(SDL.getRoot()); 420237efe6764568a3829fee26aba532283131d1a104Nate Begeman CodeGenAndEmitDAG(SDAG); 420337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 420437efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 420537efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 420637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 420737efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 420837efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 4209f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (PHIBB == JT.Default) { 421009e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4211f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(RangeBB); 4212f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 4213f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 421409e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4215f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 421637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 421737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 421837efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 421937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 422037efe6764568a3829fee26aba532283131d1a104Nate Begeman 4221b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4222b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4223b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4224b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4225b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4226b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4227b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4228b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4229b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4230b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4231b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4232b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4233f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4234f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4235d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 4236f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 4237f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4238f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4239d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4240f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4241f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4242f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4243d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4244f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4245f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4246f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4247f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4248d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4249d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4250d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4251d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4252d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 425357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4254d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4255d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4256d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4257d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4258d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4259d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4260d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4261d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4262d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4263d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4264d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4265f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4266d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4267d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 426857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 426957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4270d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4271d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 42722452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 427357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4274f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 427557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4276a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 42771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4278a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 427913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4280a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4281a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4282a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4283a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4284a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 428513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4286eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 428713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 428813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4289eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 42909373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 42914ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 429213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 42939ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4294a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4295cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4296a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 42970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 429803fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 42999ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 43009ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 43019ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 43029ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4303755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4304755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4305755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4306755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4307755480681c795d585c73556c028b6143c46bda86Chris Lattner 4308755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4309755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4310755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4311755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4312755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4313755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4314755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4315755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4316755480681c795d585c73556c028b6143c46bda86Chris Lattner 4317755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4318755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4319755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4320755480681c795d585c73556c028b6143c46bda86Chris Lattner 4321755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4322755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4323755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4324755480681c795d585c73556c028b6143c46bda86Chris Lattner 4325755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4326755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4327755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4328755480681c795d585c73556c028b6143c46bda86Chris Lattner if (getTargetLowering().MaskedValueIsZero(LHS, NeededMask)) 4329755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4330755480681c795d585c73556c028b6143c46bda86Chris Lattner 4331755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4332755480681c795d585c73556c028b6143c46bda86Chris Lattner 4333755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4334755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4335755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4336755480681c795d585c73556c028b6143c46bda86Chris Lattner 4337755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4338755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4339755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4340755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4341755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4342755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4343755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4344755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4345755480681c795d585c73556c028b6143c46bda86Chris Lattner 4346755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4347755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4348755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4349755480681c795d585c73556c028b6143c46bda86Chris Lattner 4350755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4351755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4352755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4353755480681c795d585c73556c028b6143c46bda86Chris Lattner 4354755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4355755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4356755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4357755480681c795d585c73556c028b6143c46bda86Chris Lattner 4358755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4359755480681c795d585c73556c028b6143c46bda86Chris Lattner getTargetLowering().ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4360755480681c795d585c73556c028b6143c46bda86Chris Lattner 4361755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4362755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4363755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4364755480681c795d585c73556c028b6143c46bda86Chris Lattner 4365755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4366755480681c795d585c73556c028b6143c46bda86Chris Lattner 4367755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4368755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4369755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4370755480681c795d585c73556c028b6143c46bda86Chris Lattner 43719ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 43720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 43730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 43740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 43750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 43760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 43770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 43780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 43800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 43810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 43830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 43840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 43850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 43870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 43880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 43890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 43900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 43910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 43920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 43930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 43940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 43950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 43960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 4397832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 43980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 43990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 44000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 44010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 44020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32)); 44030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 44040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 44050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 44060e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 44070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 44080e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 44090e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 44100e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 44110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 4412