SelectionDAGISel.cpp revision 3f7927c84c1b8c449378eaaf67eb9c563eb78949
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" 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <iostream> 487e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 527944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 53a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 55a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 56a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 57a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 587944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 595e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 617944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 62eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 63eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 754ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 76eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 77eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 7813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 793700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 8013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 8113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 829ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 839373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 849373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 854ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 864ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 87864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 88864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 89864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 90864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 91864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 929525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 93864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 94864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 95864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 96864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 97864635ad7b3046d3042311423071152c613961deChris Lattner 98864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 99864635ad7b3046d3042311423071152c613961deChris Lattner /// 100864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 101864635ad7b3046d3042311423071152c613961deChris Lattner 102864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 103864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 104864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 105864635ad7b3046d3042311423071152c613961deChris Lattner 106864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 107864635ad7b3046d3042311423071152c613961deChris Lattner 108864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 109864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 110864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 111864635ad7b3046d3042311423071152c613961deChris Lattner } 112864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 113864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 114864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 115864635ad7b3046d3042311423071152c613961deChris Lattner } 116864635ad7b3046d3042311423071152c613961deChris Lattner 117864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 118864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 119864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 120864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1219f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 124c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 125c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 127a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 128a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 132c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1349f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 135864635ad7b3046d3042311423071152c613961deChris Lattner }; 136864635ad7b3046d3042311423071152c613961deChris Lattner} 1374ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 160f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 161f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, unsigned> ValueMap; 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 190571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 191edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1933c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 204f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 209f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 210571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 211f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 216bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 217f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 218f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 219bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 225bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 226bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 228edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 231bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 232bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 23316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 23416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 235bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 240bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2412aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 244b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 246a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 247ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 248a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 249ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 250a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 251b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // If the alignment of the value is smaller than the size of the 252b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // value, and if the size of the value is particularly small 253b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // (<= 8 bytes), round up to the size of the value for potentially 254b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer // better performance. 255a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // 256a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // FIXME: This could be made better with a preferred alignment hook in 257a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // TargetData. It serves primarily to 8-byte align doubles for X86. 258a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner if (Align < TySize && TySize <= 8) Align = TySize; 259b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 260d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 262f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2652aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2662aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2752aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 2888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 2898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 2908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 2918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 2928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 2948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 295f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 298c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 2998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 300c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a packed type, figure out what type it will decompose into 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner const PackedType *PTy = cast<PackedType>(V->getType()); 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3286cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3296cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3306cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3316cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3433c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3443c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3453c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3463c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3473c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3483c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3493c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3503c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NT = VT-1; // Find the type to use. 3513c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (TLI.getNumElements((MVT::ValueType)NT) != 1) 3523c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner --NT; 3533c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3543c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned R = MakeReg((MVT::ValueType)NT); 3553c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3563c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg((MVT::ValueType)NT); 3573c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3583c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, SDOperand> NodeMap; 3701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 371d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 372d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 373d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 374d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 375d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 376d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Case - A pair of values to record the Value for a switch case, and the 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// case's target basic block. 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<Constant*, MachineBasicBlock*> Case; 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::vector<Case>::iterator CaseItr; 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<CaseItr, CaseItr> CaseRange; 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// The comparison function for sorting Case values. 401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman bool operator () (const Case& C1, const Case& C2) { 403b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (const ConstantInt* I1 = dyn_cast<const ConstantInt>(C1.first)) 404b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (I1->getType()->isUnsigned()) 405b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return I1->getZExtValue() < 406b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<const ConstantInt>(C2.first)->getZExtValue(); 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 408b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return cast<const ConstantInt>(C1.first)->getSExtValue() < 409b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<const ConstantInt>(C2.first)->getSExtValue(); 410f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 411f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 412f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 419a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 421f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 423f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 42437efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGISel::JumpTable JT; 425f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 431edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4339453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT(0,0,0,0), FuncInfo(funcinfo) { 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 436a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 437a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 438a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 439d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 440d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 441edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 442d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 443d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 444d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 445d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 446d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 447d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 448d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 450bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 451bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 452d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 453d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 454d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 455a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 456a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 457571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 458571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4621e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4631e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 477466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 47828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 484199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const SDOperand &setValue(const Value *V, SDOperand NewN) { 4871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return N = NewN; 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4914e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 492864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 493864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 494864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 495864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 496864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 497f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 498571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 499571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 500571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 502571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 503571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 507f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 510f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Helper for visitSwitch 511f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 51237efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 513f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 5151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); } 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); } 5171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5181628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitIntBinary(User &I, unsigned IntOp, unsigned VecOp); 5191628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitFPBinary(User &I, unsigned FPOp, unsigned VecOp); 520e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5215fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5221628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (I.getType()->isFloatingPoint()) 5231628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FADD, ISD::VADD); 5241628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5251628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::ADD, ISD::VADD); 52601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 527b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5281628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5291628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (I.getType()->isFloatingPoint()) 5301628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FMUL, ISD::VMUL); 5311628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5321628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::MUL, ISD::VMUL); 5331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5340a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitURem(User &I) { visitIntBinary(I, ISD::UREM, 0); } 5350a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitSRem(User &I) { visitIntBinary(I, ISD::SREM, 0); } 5360a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitFRem(User &I) { visitFPBinary (I, ISD::FREM, 0); } 5371628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitUDiv(User &I) { visitIntBinary(I, ISD::UDIV, ISD::VUDIV); } 5381628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitSDiv(User &I) { visitIntBinary(I, ISD::SDIV, ISD::VSDIV); } 5390a783f783ca05c961234385f5b269d4cf03dbbdbReid Spencer void visitFDiv(User &I) { visitFPBinary (I, ISD::FDIV, ISD::VSDIV); } 5401628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitAnd(User &I) { visitIntBinary(I, ISD::AND, ISD::VAND); } 5411628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitOr (User &I) { visitIntBinary(I, ISD::OR, ISD::VOR); } 5421628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitXor(User &I) { visitIntBinary(I, ISD::XOR, ISD::VXOR); } 543e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShl(User &I) { visitShift(I, ISD::SHL); } 5443822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5453822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 54645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 54745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 548f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc, 549f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpc); 550f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ, 551f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOEQ); } 552f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE, 553f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETUNE); } 554f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE, 555f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLE); } 556f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE, 557f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGE); } 558f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT, 559f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLT); } 560f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT, 561f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGT); } 5623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5762bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5772bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5783e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 579c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 590ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 591c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5920eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 59839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner void visitFrameReturnAddress(CallInst &I, bool isFrameAddress); 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6007041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 613199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 614199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 615199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 616199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 617199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 618199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 619199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 620199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 621199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(N.Val && "visit didn't populate the ValueMap!"); 623199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 624199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 625199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 626199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 627199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 628199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 62923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner if (!isa<PackedType>(VTy)) 63023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 63123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 632b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 63323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner const PackedType *PTy = cast<PackedType>(VTy); 63423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 63523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 63623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 637bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 63823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 63923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 64023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 64123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 64223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 643bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, 644bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 645199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 646199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 647199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) { 648199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 649199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 650199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 651199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 652199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 653199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 654bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 655199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) { 6562bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6572bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 658199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 659199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 660199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 661199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 662199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 663199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 665199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 666199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 667199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 668b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 66923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 67023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 671bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR,MVT::Vector,&Ops[0],Ops.size()); 672199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 673199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 674b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer return N = DAG.getConstant(cast<ConstantIntegral>(C)->getZExtValue(),VT); 675199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 676199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 677199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 678199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 679199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 680199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 681199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 682199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 683199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 684199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 685199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const Value*, unsigned>::const_iterator VMI = 686199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.ValueMap.find(V); 687199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!"); 688199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 689199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned InReg = VMI->second; 690199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 691199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 69270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 69370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 694199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 69570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 69670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (DestVT < VT) { 69770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 69870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // register pair VMI->second and VMI->second+1. 69970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 70070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 70170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (DestVT > VT) { // Promotion case 702199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(VT)) 703199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::FP_ROUND, VT, N); 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::TRUNCATE, VT, N); 706199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 70770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 70870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 70970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 71070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 7112e2ef9535070bb352601482cceac1140c1158cddChris Lattner const PackedType *PTy = cast<PackedType>(VTy); 7122e2ef9535070bb352601482cceac1140c1158cddChris Lattner unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT, 71370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 71470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 71570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 716bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 71770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 71870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 71970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 72070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 72170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 72270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 72370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 72470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 72570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 72670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 72770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 72870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 72970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 73070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 73170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 73270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 73370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 73470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 73570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 73670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 73770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 73870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 73970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 74070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 74170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 74270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 74370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 74470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 74570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 74670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 747bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size()); 7482e2ef9535070bb352601482cceac1140c1158cddChris Lattner 7492e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7502e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7512e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7522e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7532e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7542e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 755199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 756199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 757199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 758199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 759199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 760199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 763a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 766bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 767ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 768ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 769ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 7708e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng bool isSigned = I.getOperand(i)->getType()->isSigned(); 771ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 772ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 773ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 774ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7758e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7768e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 777ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 778ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 779ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 780ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 781ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 782ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 783ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 7841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7858e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng if (isSigned) 786ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp); 787ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 788ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp); 789ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 790ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 7918e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng NewValues.push_back(DAG.getConstant(isSigned, MVT::i32)); 7921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 793bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 794bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 7951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 797571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 798571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 799571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 800571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 801571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 802571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 803571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 804571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 805571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 806571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 807571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 808571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 809571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 810571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 8128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 8138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 8148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 8158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 8168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 8178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 8188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 8218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 8258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 8268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 8278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 8288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 8318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 8328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 8338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 8358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 8368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 8378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 8386a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 8396a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 8406a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 8416a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 8426a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 8436a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 844571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 845571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 846571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 847571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 848571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 849571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 850571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 851571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BinaryOperator *BOp = dyn_cast<BinaryOperator>(Cond); 852571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 853571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!BOp || (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 8546a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 8556a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 8566a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 857571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 858571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 859df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Cond)) 860df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if ((II->getIntrinsicID() == Intrinsic::isunordered_f32 || 861df19f27d039fd791c73e39f4134319debc75db4fChris Lattner II->getIntrinsicID() == Intrinsic::isunordered_f64) && 862df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // The operands of the setcc have to be in this block. We don't know 863df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // how to export them from some other block. If this is the first 864df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // block of the sequence, no exporting is needed. 865df19f27d039fd791c73e39f4134319debc75db4fChris Lattner (CurBB == CurMBB || 866df19f27d039fd791c73e39f4134319debc75db4fChris Lattner (isExportableFromCurrentBlock(II->getOperand(1), BB) && 867df19f27d039fd791c73e39f4134319debc75db4fChris Lattner isExportableFromCurrentBlock(II->getOperand(2), BB)))) { 868df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETUO, II->getOperand(1), 869df19f27d039fd791c73e39f4134319debc75db4fChris Lattner II->getOperand(2), TBB, FBB, CurBB); 870df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.push_back(CB); 871df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 872df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 873df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 874df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 875571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If the leaf of the tree is a setcond inst, merge the condition into the 876571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // caseblock. 877571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp && isa<SetCondInst>(BOp) && 878571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // The operands of the setcc have to be in this block. We don't know 8795a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 8805a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 8815a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 8825a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 8835a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 884571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner ISD::CondCode SignCond, UnsCond, FPCond, Condition; 885571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner switch (BOp->getOpcode()) { 886571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner default: assert(0 && "Unknown setcc opcode!"); 887571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetEQ: 888571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETEQ; 889571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETEQ; 890571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOEQ; 891571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 892571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetNE: 893571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETNE; 894571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETNE; 895571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETUNE; 896571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 897571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetLE: 898571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETLE; 899571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETULE; 900571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOLE; 901571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 902571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetGE: 903571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETGE; 904571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETUGE; 905571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOGE; 906571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 907571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetLT: 908571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETLT; 909571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETULT; 910571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOLT; 911571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 912571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner case Instruction::SetGT: 913571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SignCond = ISD::SETGT; 914571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner UnsCond = ISD::SETUGT; 915571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FPCond = ISD::SETOGT; 916571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner break; 917571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 918571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 919571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const Type *OpType = BOp->getOperand(0)->getType(); 920571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(OpType)) 921571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner OpType = PTy->getElementType(); 922571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 923571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!FiniteOnlyFPMath() && OpType->isFloatingPoint()) 924571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = FPCond; 925571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else if (OpType->isUnsigned()) 926571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = UnsCond; 927571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else 928571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Condition = SignCond; 929571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 930571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 931571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOperand(1), TBB, FBB, CurBB); 932571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 933571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 934571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 935571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 936571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 937571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantBool::getTrue(), 938571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner TBB, FBB, CurBB); 939571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 940571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 941571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 942571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 943d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 944d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 945571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 946571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 947571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 948571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 949d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 950d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 951d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 952d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 953d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 954d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 955d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 956d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 957571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 958d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 959d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 960d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 961d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 962d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 963d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 964d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 965d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 966d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 967d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 968d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 969d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 970d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 971d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 972d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 973d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 974d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 975d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 976d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 977d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 978d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 979d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 980571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 981571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 982df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 983df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 984df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 985df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 986df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 987df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 988df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 9890ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 9900ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 9910ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 9920ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 9930ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 9940ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 9950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 9960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 9970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 998df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 999df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1000df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 10011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 10021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 10031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 10041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 10061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 10071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 10081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 10091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 10101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 10121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 10131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1014a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1015dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 101657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 101757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 101857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 101957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 102157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 102257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 102357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 102457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 102557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 102657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1027571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1028571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1029571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1030571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1031571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1032571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1033571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1034571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1035571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1036571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1037571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1038571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1039571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1040571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1041571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1042571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1043571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1044571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1045d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1046571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1047571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 10480ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 10490ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 10500ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 10510ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 10520ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1053df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1054df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1055df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1056df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1057df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1058df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1059df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1060df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1061df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1062df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1063df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 10645a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 10655a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 10660ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 10670ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 10680ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 10690ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 10700ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1071df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1072571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1073571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 10742452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 10752452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantBool::getTrue(), 10772452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner Succ0MBB, Succ1MBB, CurMBB); 10782452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 10792452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 10802452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 10811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 10821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1083f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1084f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1085f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 108657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 108757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 108857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 1089571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Build the setcc now, fold "(X == true)" to X and "(X == false)" to !X to 1090571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // handle common cases produced by branch lowering. 1091571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (CB.CmpRHS == ConstantBool::getTrue() && CB.CC == ISD::SETEQ) 109257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Cond = CondLHS; 1093571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner else if (CB.CmpRHS == ConstantBool::getFalse() && CB.CC == ISD::SETEQ) { 1094571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 1095571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 1096571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } else 1097571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 1098f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1099f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1100f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1101f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1102f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1103f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1104f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1105f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1106f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1107f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 110857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 110957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1110f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1111f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1112f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1113f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 111457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 111557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1116f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1117f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1118f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 111957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1120f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 112157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 112257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1123f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1124f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 112537efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 112637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 112737efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 11283d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 11293d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 11303d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 11313d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 11323d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 113337efe6764568a3829fee26aba532283131d1a104Nate Begeman} 113437efe6764568a3829fee26aba532283131d1a104Nate Begeman 1135f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitch(SwitchInst &I) { 1136f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1137f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1138f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1139c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1140f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1141f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1142f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1143d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()]; 1144d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1145f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1146f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 1147f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (I.getNumOperands() == 2) { 1148f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1149c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1150f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1151d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1152f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1153d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1154c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1155d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1156f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1157f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 1162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<Case> Cases; 1163c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1164f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 1; i < I.getNumSuccessors(); ++i) { 1165f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)]; 1166f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cases.push_back(Case(I.getSuccessorValue(i), SMBB)); 1167f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1168c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1169f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 1170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1171f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1173f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 1174f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Value *SV = I.getOperand(0); 117537efe6764568a3829fee26aba532283131d1a104Nate Begeman 117637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Get the MachineFunction which holds the current MBB. This is used during 117737efe6764568a3829fee26aba532283131d1a104Nate Begeman // emission of jump tables, and when inserting any additional MBBs necessary 117837efe6764568a3829fee26aba532283131d1a104Nate Begeman // to represent the switch. 1179f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction *CurMF = CurMBB->getParent(); 1180f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const BasicBlock *LLVMBB = CurMBB->getBasicBlock(); 1181d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1182d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If the switch has few cases (two or less) emit a series of specific 1183d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // tests. 1184b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (Cases.size() < 3) { 1185d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // TODO: If any two of the cases has the same destination, and if one value 1186d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // is the same as the other, but has one bit unset that the other has set, 1187d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // use bit manipulation to do two compares at once. For example: 1188d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1189d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1190b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // Rearrange the case blocks so that the last one falls through if possible. 1191b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner if (NextBlock && Default != NextBlock && Cases.back().second != NextBlock) { 1192b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // The last case block won't fall through into 'NextBlock' if we emit the 1193b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner // branches in this order. See if rearranging a case value would help. 1194b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner for (unsigned i = 0, e = Cases.size()-1; i != e; ++i) { 1195b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner if (Cases[i].second == NextBlock) { 1196b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner std::swap(Cases[i], Cases.back()); 1197b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner break; 1198b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1199b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1200b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner } 1201b354343af79ce7b64e3b32696f37ad0ce29f3ffdChris Lattner 1202d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // Create a CaseBlock record representing a conditional branch to 1203d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // the Case's target mbb if the value being switched on SV is equal 1204d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // to C. 1205d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *CurBlock = CurMBB; 1206d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner for (unsigned i = 0, e = Cases.size(); i != e; ++i) { 1207d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner MachineBasicBlock *FallThrough; 1208d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (i != e-1) { 1209d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner FallThrough = new MachineBasicBlock(CurMBB->getBasicBlock()); 1210d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMF->getBasicBlockList().insert(BBI, FallThrough); 1211d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } else { 1212d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If the last case doesn't match, go to the default block. 1213d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner FallThrough = Default; 1214d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 1215d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1216d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, Cases[i].first, 1217d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner Cases[i].second, FallThrough, CurBlock); 1218d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1219d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // If emitting the first comparison, just call visitSwitchCase to emit the 1220d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // code into the current block. Otherwise, push the CaseBlock onto the 1221d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // vector to be later processed by SDISel, and insert the node's MBB 1222d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner // before the next MBB. 1223d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (CurBlock == CurMBB) 1224d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner visitSwitchCase(CB); 1225d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner else 1226d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner SwitchCases.push_back(CB); 1227d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1228d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurBlock = FallThrough; 1229d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 1230d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner return; 1231d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner } 123237efe6764568a3829fee26aba532283131d1a104Nate Begeman 123317c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // If the switch has more than 5 blocks, and at least 31.25% dense, and the 123417c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // target supports indirect branches, then emit a jump table rather than 123517c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // lowering the switch to a binary tree of conditional branches. 12363d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng if ((TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 12373d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng TLI.isOperationLegal(ISD::BRIND, MVT::Other)) && 1238f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman Cases.size() > 5) { 1239b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer uint64_t First =cast<ConstantIntegral>(Cases.front().first)->getZExtValue(); 1240b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getZExtValue(); 1241f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman double Density = (double)Cases.size() / (double)((Last - First) + 1ULL); 1242f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 124317c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman if (Density >= 0.3125) { 124437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Create a new basic block to hold the code for loading the address 124537efe6764568a3829fee26aba532283131d1a104Nate Begeman // of the jump table, and jumping to it. Update successor information; 124637efe6764568a3829fee26aba532283131d1a104Nate Begeman // we will either branch to the default case for the switch, or the jump 124737efe6764568a3829fee26aba532283131d1a104Nate Begeman // table. 124837efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 124937efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 125037efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(Default); 125137efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(JumpTableBB); 125237efe6764568a3829fee26aba532283131d1a104Nate Begeman 125337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Subtract the lowest switch case value from the value being switched on 125437efe6764568a3829fee26aba532283131d1a104Nate Begeman // and conditional branch to default mbb if the result is greater than the 125537efe6764568a3829fee26aba532283131d1a104Nate Begeman // difference between smallest and largest cases. 125637efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SwitchOp = getValue(SV); 125737efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType VT = SwitchOp.getValueType(); 125837efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 125937efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(First, VT)); 126037efe6764568a3829fee26aba532283131d1a104Nate Begeman 126137efe6764568a3829fee26aba532283131d1a104Nate Begeman // The SDNode we just created, which holds the value being switched on 126237efe6764568a3829fee26aba532283131d1a104Nate Begeman // minus the the smallest case value, needs to be copied to a virtual 126337efe6764568a3829fee26aba532283131d1a104Nate Begeman // register so it can be used as an index into the jump table in a 126437efe6764568a3829fee26aba532283131d1a104Nate Begeman // subsequent basic block. This value may be smaller or larger than the 126537efe6764568a3829fee26aba532283131d1a104Nate Begeman // target's pointer type, and therefore require extension or truncating. 126637efe6764568a3829fee26aba532283131d1a104Nate Begeman if (VT > TLI.getPointerTy()) 126737efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 126837efe6764568a3829fee26aba532283131d1a104Nate Begeman else 126937efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 1270c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 127137efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 127237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 127337efe6764568a3829fee26aba532283131d1a104Nate Begeman 127437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the range check for the jump table, and branch to the default 127537efe6764568a3829fee26aba532283131d1a104Nate Begeman // block for the switch statement if the value being switched on exceeds 127637efe6764568a3829fee26aba532283131d1a104Nate Begeman // the largest case in the switch. 127737efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 127837efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(Last-First,VT), ISD::SETUGT); 127937efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 128037efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getBasicBlock(Default))); 128137efe6764568a3829fee26aba532283131d1a104Nate Begeman 1282f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Build a vector of destination BBs, corresponding to each target 1283f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // of the jump table. If the value of the jump table slot corresponds to 1284f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // a case statement, push the case's BB onto the vector, otherwise, push 1285f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // the default BB. 128637efe6764568a3829fee26aba532283131d1a104Nate Begeman std::vector<MachineBasicBlock*> DestBBs; 1287f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman uint64_t TEI = First; 1288c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) 1289b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (cast<ConstantIntegral>(ii->first)->getZExtValue() == TEI) { 1290f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(ii->second); 1291f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ++ii; 1292f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } else { 1293f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(Default); 1294f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 1295f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 12968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Update successor info. Add one edge to each unique successor. 12978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 12988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 12998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(CurMBB->getParent()->getNumBlockIDs()); 13008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 1301c66764c00756d800aede2fd32d55658a236b1912Chris Lattner for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 13028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner E = DestBBs.end(); I != E; ++I) { 13038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (!SuccsHandled[(*I)->getNumber()]) { 13048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[(*I)->getNumber()] = true; 13058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner JumpTableBB->addSuccessor(*I); 13068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 1308f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 1309f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Create a jump table index for this jump table, or return an existing 1310f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // one. 131137efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 131237efe6764568a3829fee26aba532283131d1a104Nate Begeman 131337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the jump table information so that we can codegen it as a second 131437efe6764568a3829fee26aba532283131d1a104Nate Begeman // MachineBasicBlock 131537efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.Reg = JumpTableReg; 131637efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.JTI = JTI; 131737efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.MBB = JumpTableBB; 13189453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT.Default = Default; 131937efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 132037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 132137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 1322f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1323f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Push the initial CaseRec onto the worklist 1324f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<CaseRec> CaseVec; 1325f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 1326f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1327f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman while (!CaseVec.empty()) { 1328f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Grab a record representing a case range to process off the worklist 1329f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec CR = CaseVec.back(); 1330f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.pop_back(); 1331f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1332f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Size is the number of Cases represented by this range. If Size is 1, 1333f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // then we are processing a leaf of the binary search tree. Otherwise, 1334f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // we need to pick a pivot, and push left and right ranges onto the 1335f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // worklist. 1336f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman unsigned Size = CR.Range.second - CR.Range.first; 1337f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1338f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (Size == 1) { 1339f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1340f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the Case's target mbb if the value being switched on SV is equal 1341f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // to C. Otherwise, branch to default. 1342f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = CR.Range.first->first; 1343f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Target = CR.Range.first->second; 1344f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default, 1345f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CR.CaseBB); 1346c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1347f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the MBB representing the leaf node is the current MBB, then just 1348f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // call visitSwitchCase to emit the code into the current block. 1349f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, push the CaseBlock onto the vector to be later processed 1350f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // by SDISel, and insert the node's MBB before the next MBB. 1351f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1352f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1353c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling else 1354f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1355f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1356f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // split case range at pivot 1357f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseItr Pivot = CR.Range.first + (Size / 2); 1358f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange LHSR(CR.Range.first, Pivot); 1359f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange RHSR(Pivot, CR.Range.second); 1360f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = Pivot->first; 136157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1362c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1363f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // We know that we branch to the LHS if the Value being switched on is 1364f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // less than the Pivot value, C. We use this to optimize our binary 1365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // tree a bit, by recognizing that if SV is greater than or equal to the 1366f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // LHS's Case Value, and that Case Value is exactly one less than the 1367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Pivot's Value, then we can branch directly to the LHS's Target, 1368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // rather than creating a leaf node for it. 1369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((LHSR.second - LHSR.first) == 1 && 1370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSR.first->first == CR.GE && 1371b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<ConstantIntegral>(C)->getZExtValue() == 1372b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer (cast<ConstantIntegral>(CR.GE)->getZExtValue() + 1ULL)) { 137357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner TrueBB = LHSR.first->second; 1374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 137557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner TrueBB = new MachineBasicBlock(LLVMBB); 137657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMF->getBasicBlockList().insert(BBI, TrueBB); 137757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CaseVec.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1379c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Similar to the optimization above, if the Value being switched on is 1381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // known to be less than the Constant CR.LT, and the current Case Value 1382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // is CR.LT - 1, then we can branch directly to the target block for 1383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the current Case Value, rather than emitting a RHS leaf node for it. 1384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1385b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer cast<ConstantIntegral>(RHSR.first->first)->getZExtValue() == 1386b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer (cast<ConstantIntegral>(CR.LT)->getZExtValue() - 1ULL)) { 138757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner FalseBB = RHSR.first->second; 1388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 138957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner FalseBB = new MachineBasicBlock(LLVMBB); 139057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMF->getBasicBlockList().insert(BBI, FalseBB); 139157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CaseVec.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1393c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the LHS node if the value being switched on SV is less than C. 1396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, branch to LHS. 1397f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT; 139857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SelectionDAGISel::CaseBlock CB(CC, SV, C, TrueBB, FalseBB, CR.CaseBB); 1399c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1402c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling else 1403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1408b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1409b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 141001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (I.getType()->isFloatingPoint()) { 141101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 141201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 141301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 141401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 141501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 141601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 14171628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitFPBinary(I, ISD::FSUB, ISD::VSUB); 14181628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else 14191628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer visitIntBinary(I, ISD::SUB, ISD::VSUB); 1420b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1421b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 14221628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencervoid 14231628cec4d7fce310d9cde0bcc73997e5a71692c4Reid SpencerSelectionDAGLowering::visitIntBinary(User &I, unsigned IntOp, unsigned VecOp) { 14245fbb5d2459a5410590f285250faa604576308a93Nate Begeman const Type *Ty = I.getType(); 14251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 14261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 14272c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 14281628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 14291628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 14301628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 14311628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 14325fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 14331628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2)); 14341628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } 14351628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 14361628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 14371628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencervoid 14381628cec4d7fce310d9cde0bcc73997e5a71692c4Reid SpencerSelectionDAGLowering::visitFPBinary(User &I, unsigned FPOp, unsigned VecOp) { 14391628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer const Type *Ty = I.getType(); 14401628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 14411628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 14421628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 14431628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 1444c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 1445c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 1446c7029805ef35ce9805931067b841e6af11db382eChris Lattner setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 14471628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer } else { 14481628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2)); 14495fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1450e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 14512c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1452e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1453e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1454e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1455e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1456e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1457e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 14581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 14591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 14601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 146145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 146245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ICmpInst *IC = cast<ICmpInst>(&I); 146345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op1 = getValue(IC->getOperand(0)); 146445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op2 = getValue(IC->getOperand(1)); 146545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 146645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer switch (IC->getPredicate()) { 146745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 146845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 146945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 147045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 147145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 147245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 147345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 147445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 147545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 147645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 147745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 147845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 147945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 148045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 148145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 148245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 148345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 148445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 148545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 148645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer FCmpInst *FC = cast<FCmpInst>(&I); 148745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op1 = getValue(FC->getOperand(0)); 148845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer SDOperand Op2 = getValue(FC->getOperand(1)); 148945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 149045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer switch (FC->getPredicate()) { 149145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_FALSE : Opcode = ISD::SETFALSE; 149245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OEQ : Opcode = ISD::SETOEQ; 149345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OGT : Opcode = ISD::SETOGT; 149445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OGE : Opcode = ISD::SETOGE; 149545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OLT : Opcode = ISD::SETOLT; 149645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_OLE : Opcode = ISD::SETOLE; 149745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ONE : Opcode = ISD::SETONE; 149845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ORD : Opcode = ISD::SETO; 149945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UNO : Opcode = ISD::SETUO; 150045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UEQ : Opcode = ISD::SETUEQ; 150145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UGT : Opcode = ISD::SETUGT; 150245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UGE : Opcode = ISD::SETUGE; 150345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ULT : Opcode = ISD::SETULT; 150445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_ULE : Opcode = ISD::SETULE; 150545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_UNE : Opcode = ISD::SETUNE; 150645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case FCmpInst::FCMP_TRUE : Opcode = ISD::SETTRUE; 150745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 150845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 150945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETFALSE; 151045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 151145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 151245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 151345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 151445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 15151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode, 1516f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode UnsignedOpcode, 1517f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpcode) { 15181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 15191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 15201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode Opcode = SignedOpcode; 152180235d508e5f7a9603ef43ba6625984173ff0323Evan Cheng if (!FiniteOnlyFPMath() && I.getOperand(0)->getType()->isFloatingPoint()) 1522f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng Opcode = FPOpcode; 1523f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng else if (I.getOperand(0)->getType()->isUnsigned()) 15241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Opcode = UnsignedOpcode; 15257cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 15261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 15291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 15301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 15311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 1532b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner if (!isa<PackedType>(I.getType())) { 1533b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1534b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1535b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1536b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1537b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1538b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1539b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 15401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 15443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 15453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 15483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 15513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 15523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 15533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 15563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 15593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 15603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 15613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 15643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 15673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 15683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 15713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 15743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 15753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 15783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 15813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 15823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 15853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 15883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 15893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 15923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 15933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 15943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 15953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 15963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 15973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 15983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 15993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 16023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 16033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 16063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 16093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 16103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 16111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1612e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 161328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 16153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 16163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 16173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 16193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 16203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 16213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 16243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 16253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 16263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 16283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 16293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 16303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 16313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 16333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 16343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 16353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 16373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 16383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 1639e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 16403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast to a vector from something else. 16413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the output vector. 1642e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 1643e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1644e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1645e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1646e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 16473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 16483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer } 16493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 16503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (SrcVT == MVT::Vector) { 16513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // This is a cast from a vctor to something else. 16523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Get information about the input vector. 1653e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 16543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return; 16551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 16563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 16573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 16583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 16593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 16603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 16613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 16623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 16631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 16641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16652bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1666c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1667c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1668c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1669c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1670c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16712332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 16722332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 16732332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 16742332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1675c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1676c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16772bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1678384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1679384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1680384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1681384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1682384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1683384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1684384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1685c7029805ef35ce9805931067b841e6af11db382eChris Lattner 16863e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 16873e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 16883e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 16893e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 16903e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 16913e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 16923e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 16933e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 16943e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 16953e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 16963e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 16973e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 16981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 16991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 17001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 17011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 17031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 17041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1705c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 1706b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 17071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 17081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1709a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field]; 17101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1711dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 17121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 17141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 17151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 17167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 17187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 1719b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 17207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner uint64_t Offs; 1721b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getType()->isSigned()) 1722b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Offs = (int64_t) 1723b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 17247c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 1725b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Offs = 1726b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getZExtValue(); 17277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 17287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 17297c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 17307c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17317c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1732a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 17337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 17347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17357c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 17367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 17377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 17387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (Idx->getType()->isSigned()) 17397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 17407c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 17417c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN); 17427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 17437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 17447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 17467c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 17477c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 17487c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 17497c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 17506b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 17511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 17527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 17531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17547c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 17557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 17567c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 17577c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 17581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 17611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 17641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 17651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 17661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 17671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 17681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 1770a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 1771a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 1772ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman I.getAlignment()); 17731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 177568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 177668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 177768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 177868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 177968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 17801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 178168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 17821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 17831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 17841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 17851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 17861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 17871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 17881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 17891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 17901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 17911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 17921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 17931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 17941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 17951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 17961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 17971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 17981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 17991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1800bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 1801f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 1802f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 1803f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 18041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DAG.setRoot(setValue(&I, DSA).getValue(1)); 18051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 18071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 18081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 18091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 18121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 1813edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1814d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 1815d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 1816d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 1817d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 1818d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 1819d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 1820d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 182128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 1822466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 182328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 182428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 182528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 182628b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 1827466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 182828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 18295fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 18308cfa57b1b4eade4e0101195b2f94ab288cd03563Nate Begeman if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 18314ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1832466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, 1833466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng DAG.getSrcValue(SV)); 18345fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 1835466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, isVolatile); 18365fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1837d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 183828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 1839d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 1840d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 1841d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 184228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 184328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 18441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 18481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 18491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 18501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 18518b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 18528b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.isVolatile())); 18531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 18550eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 18560eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 18570eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 18580eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 18590eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 18600eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 18610eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 18620eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 18630eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1864e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 1865e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 1866e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 1867e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 1868e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 1869e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 1870e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 1871e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 1872e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 18730eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 18740eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 18750eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 18760eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 18777255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 1878e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 18790eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18800eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 1881bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 1882e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 1883e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 1884e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 1885e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 1886e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 1887e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 1888e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 1889e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 18900eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18910eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 18920eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 18930eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18940eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 18950eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 18960eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 18970eade319cdb72e24c11d068728a98083737c6435Chris Lattner 18980eade319cdb72e24c11d068728a98083737c6435Chris Lattner // If this is a vector type, force it to the right packed type. 18990eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 19000eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType()); 19010eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 19020eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19030eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 19040eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 19050eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 19060eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19070eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19080eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 19090eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 19100eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 19110eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19120eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19130eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 19140eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 19150eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 19160eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 19170eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 19180eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 19190eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19200eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 19210eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 19220eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19230eade319cdb72e24c11d068728a98083737c6435Chris Lattner 19240eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 19250eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 19260eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19270eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 19280eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 19290eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1930f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 1931f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 19320eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 193348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 193448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 1935f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 1936f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 193748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 1938f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 1939f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 194048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 1941f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 1942f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 194348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 1944e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 1945e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 1946e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 1947e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 1948e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 1949e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 1950e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 19510eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 19520eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) { 19530eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 19540eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 19550eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 19560eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 19570eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19580eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 19590eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 19600eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 19610eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1962c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 1963c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 1964c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 1965c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 1966c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 1967c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 19680eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 19690eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 19700eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 19710eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 1972c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 1973c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 1974c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 1975c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0; 1976c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0; 1977c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 1978c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_setjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1979c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 1980c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 1981c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_longjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1982c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 198303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 198403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 198503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 198603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 198703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 198803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 198903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 199003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 199103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 199203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 199303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 199403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 1995c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 199686cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 1997ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 199843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 1999fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) { 2000bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 200136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2002bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2003bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2004bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2005ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 200643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext()); 2007ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 200843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 200943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2010bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2011bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2012ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2013bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 201486cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 201543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2016b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 201736ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 201843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 201943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 202043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 2021fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) { 202243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext()); 2023bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, getRoot(), 2024bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 202543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 202643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2027b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 202843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 202943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 203043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 203143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 2032fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) { 203343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext()); 2034bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, 2035bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 203643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 203743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2038b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 203943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 204043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 204143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 204243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 2043fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && FSI.getSubprogram() && 2044fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey DebugInfo->Verify(FSI.getSubprogram())) { 204543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram()); 2046bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, 2047bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 204843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 204943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2050b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 205143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 205243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 205343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 205443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 2055bf7637d59028a5d9911769810f537c499e23bb8eJim Laskey if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) { 20560892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2057bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 205843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex()); 205943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 206043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 206143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 206243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2063c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 20640b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f32: 20650b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f64: 2066c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)), 2067c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(2)), ISD::SETUO)); 2068c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2069c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 20700b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 20710b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2072c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2073c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2074c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2075c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 20766ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 20776ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 20786ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 20796ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 20806ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 20816ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 20826ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2083c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2084c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2085c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2086c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2087c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 20888b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2089bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2090f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2091f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2092f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 20938b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 20948b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 209551b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 20968b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2097d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i16: 2098d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i32: 2099d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i64: 2100d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2101d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2102d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2103d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 21040b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i8: 21050b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i16: 21060b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i32: 21070b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i64: 2108c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTTZ, 2109c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2110c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2111c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 21120b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i8: 21130b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i16: 21140b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i32: 21150b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i64: 2116c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTLZ, 2117c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2118c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2119c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 21200b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i8: 21210b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i16: 21220b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i32: 21230b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i64: 2124c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTPOP, 2125c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2126c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2127c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2128140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2129bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2130f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2131f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2132140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2133140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2134140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2135140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 213639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 213739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 213839a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2139140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 214039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2141ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2142ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2143ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 2144c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2145c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2146c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2147c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 21481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 214964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2150c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 2151c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (F->isExternal()) 2152c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2153c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2154c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2155c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2156c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2157c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2158a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2159a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2160a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2161a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2162a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2163a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2164a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2165a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2166a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2167a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2168a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2169a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2170c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2171c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2172c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2173c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2174c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2175c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2176c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2177c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2178f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2179f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 218006a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2181c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2182f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2183f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2184f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2185c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2186f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2187f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 218806a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2189c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2190f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2191f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2192f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2193f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2194c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2195ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2196ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2197ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2198c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2199edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 220064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 220164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 220264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 220364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 220464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 22051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2206c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner Args.reserve(I.getNumOperands()); 22071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 22081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Arg = I.getOperand(i); 22091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand ArgNode = getValue(Arg); 22101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(ArgNode, Arg->getType())); 22111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2212edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 22138e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType()); 22148e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 2215edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2216cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 22179092fa310c8b2b1645b0d448c4c34b1e8ddc131dChris Lattner TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(), 2218adf6a965a321372c640845407195594835921eb4Chris Lattner I.isTailCall(), Callee, Args, DAG); 22191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getType() != Type::VoidTy) 2220cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); 2221cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 22221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2224864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 22259f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 2226864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 2227864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 2228864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 2229864635ad7b3046d3042311423071152c613961deChris Lattner 2230864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 2231864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 2232864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 2233864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 2234864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 2235693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Chain = Hi.getValue(1); 2236693163e74d047a05799eaaf619ba4972fdc3a0e9Evan Cheng Flag = Hi.getValue(2); 22379f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 22389f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 22399f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 22409f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 2241864635ad7b3046d3042311423071152c613961deChris Lattner } 2242864635ad7b3046d3042311423071152c613961deChris Lattner 2243cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 2244864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 2245864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 2246864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 2247864635ad7b3046d3042311423071152c613961deChris Lattner 2248cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 2249cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 2250cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2251cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 2252cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2253cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } else { 2254864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2255cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 2256864635ad7b3046d3042311423071152c613961deChris Lattner} 2257864635ad7b3046d3042311423071152c613961deChris Lattner 2258c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2259c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 2260c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 2261c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2262a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 2263a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 2264c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 2265c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 2266c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2267c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 22680c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (MVT::isInteger(RegVT)) { 22690c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 22700c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 22710c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 22720c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 22730c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner } else 2274c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 2275c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2276c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 2277c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2278c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 22799f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 22809f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 22819f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 22829f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 22839f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 2284c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 2285a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 22869f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 2287c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 2288c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2289c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2290c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2291864635ad7b3046d3042311423071152c613961deChris Lattner 2292c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2293c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2294c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2295c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 22969f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 2297c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32)); 2298c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 2299c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 2300c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2301864635ad7b3046d3042311423071152c613961deChris Lattner 2302864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 2303864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 2304864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 2305864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 23069b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 23079b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 2308f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 2309f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 23109b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 23119b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 2312f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 2313f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 23149b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 23159b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 23169b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 23179b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 23189b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 23199b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 2320f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 2321f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 2322f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 2323f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 2324f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 2325f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 2326f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2327f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 23289b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 23299b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 23309b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2331f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 23329b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 2333864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 2334864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 2335864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 2336864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 23379b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 23389b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 2339f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 2340f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 2341f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 2342f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 2343f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 2344f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 2345f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 2346864635ad7b3046d3042311423071152c613961deChris Lattner } 2347f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 2348864635ad7b3046d3042311423071152c613961deChris Lattner} 2349864635ad7b3046d3042311423071152c613961deChris Lattner 2350864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 2351864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 2352864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 2353864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 23544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 2355864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 2356864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 2357864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 2358864635ad7b3046d3042311423071152c613961deChris Lattner 2359864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 2360864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 2361864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 2362864635ad7b3046d3042311423071152c613961deChris Lattner 23632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 23642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 2365864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 2366864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 2367864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 2368cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 2369cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 2370cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 2371cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 2372cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 2373864635ad7b3046d3042311423071152c613961deChris Lattner 2374864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 2375864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 2376864635ad7b3046d3042311423071152c613961deChris Lattner 2377864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 2378864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 2379864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 2380864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 2381864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 2382864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 2383864635ad7b3046d3042311423071152c613961deChris Lattner 2384864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 2385864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 2386864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 2387864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 2388864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 2389864635ad7b3046d3042311423071152c613961deChris Lattner } 2390864635ad7b3046d3042311423071152c613961deChris Lattner } 2391864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 2392864635ad7b3046d3042311423071152c613961deChris Lattner } 2393864635ad7b3046d3042311423071152c613961deChris Lattner 23942a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 23952a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 23962a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 23972a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (PhysReg.second) { 23982a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 23992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 24002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 24012a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (!isOutReg || !isInReg) { 24022a821601f1db665fbb825727aacf1a54d17b91efChris Lattner if (VT == MVT::Other) 24032a821601f1db665fbb825727aacf1a54d17b91efChris Lattner ValueVT = *PhysReg.second->vt_begin(); 24042a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 24052a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24062a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 24072a821601f1db665fbb825727aacf1a54d17b91efChris Lattner SSARegMap *RegMap = DAG.getMachineFunction().getSSARegMap(); 24082a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 24092a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 24102a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24112a821601f1db665fbb825727aacf1a54d17b91efChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 24122a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 24132a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 24152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 24162a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 24172a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 24182a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 24192a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 24202a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 24212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 24222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 24232a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 2424864635ad7b3046d3042311423071152c613961deChris Lattner 24254e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 24264e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 2427864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 2428864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 2429864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 24304e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 2431864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 2432864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 2433864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2434864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2435864635ad7b3046d3042311423071152c613961deChris Lattner continue; 2436864635ad7b3046d3042311423071152c613961deChris Lattner } 2437864635ad7b3046d3042311423071152c613961deChris Lattner 24384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 24394e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 24409b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 2441864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 2442864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 2443864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 2444864635ad7b3046d3042311423071152c613961deChris Lattner continue; 24454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 24464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2447864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 2448864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 2449864635ad7b3046d3042311423071152c613961deChris Lattner 2450864635ad7b3046d3042311423071152c613961deChris Lattner // If we allocated enough consecutive 2451864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 2452864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 2453864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 2454864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 2455864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 2456864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 2457864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 2458864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 2459864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 2460864635ad7b3046d3042311423071152c613961deChris Lattner } 2461864635ad7b3046d3042311423071152c613961deChris Lattner 2462864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 2463864635ad7b3046d3042311423071152c613961deChris Lattner } 24644e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 2465864635ad7b3046d3042311423071152c613961deChris Lattner 2466864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 2467864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 24684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 24694e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 2470864635ad7b3046d3042311423071152c613961deChris Lattner 2471ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 2472ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 2473ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 2474ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 2475ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2476ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 2477ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 2478ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 24792cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 24801efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 2481ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2482ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 2483ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 2484ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 2485ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 2486ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 2487ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 2488ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2489ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 2490ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 2491ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 24924e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 24934e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 24944e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 24954e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 24964e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 24971efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 24984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 24994e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 25004e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 25012223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 25021efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 25031efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25041efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 25051efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 25061efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 25071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 25081efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 25091efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 25101efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 251122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 25121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 25131efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 25141efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 25151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 25171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 25181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 25191efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25201efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 25211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 25221efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25231efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 25241efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25251efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 25261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2527864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2528864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 25291efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2530864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2531864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2532864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2533864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2534864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 25354e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 25364e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 25374e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 25384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2539864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25404e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 25414e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 25422223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2543864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 25451efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 25461efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2547864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25481efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 25494e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 25504e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2551864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2552864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 25534e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 25544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 25554e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 25562cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 25570f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 25580f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2559864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2560864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 25611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 25620f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 25636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 25642cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 25652cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 25661efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 25672cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 25682cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 256922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 257022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 257122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 257222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 257322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 257422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 257522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 257622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 257722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 257822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 257922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 258022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 258222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 258322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 258522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 258622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 258722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 258822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 258922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 259022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 259122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 259222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 259322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 259422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 259522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 259622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 259722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 259822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 259922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 260022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 260122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 260222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 2603864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 2604864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 2605864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 2606864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 2607864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2608864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 26092223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 2610864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 2611864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 2612864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 2613864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 2614864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 2615864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 2616d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner if (Regs.Regs.empty()) { 2617d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner std::cerr << "Couldn't allocate output reg for contraint '" 2618d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner << ConstraintCode << "'!\n"; 2619d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 2620d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 26212cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 26222cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 2623864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 26242cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 26252cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 2626864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 26272cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 262822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 262922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 26302cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 26312cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 26326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 26336656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 26346656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 2635c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 26366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 26376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 26386656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 263922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 26404e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 26413d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 26422223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 26432223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 26442223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 26452223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 26463d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 2647c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 2648c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 2649c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 2650c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 2651c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 2652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2653c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2654a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 2655a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 2656c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2657c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 2658c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2659c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2660c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2661c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2662c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2663c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2664c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2665c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 2666c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue MatchedRegs; 2667c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 2668c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 2669c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 2670c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 2671c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.Regs.push_back(Reg); 2672c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2673c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2674c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Use the produced MatchedRegs object to 2675a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 2676a844126c43976387a66dafbe5137a762169f1f34Evan Cheng TLI.getPointerTy()); 2677c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 267887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 267987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 268087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 268187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 268287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 268387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 26843d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 268587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 268653069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 268753069fbbae2558a3138df24776448791fea3aceeChris Lattner ConstraintCode[0], DAG); 268853069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 268953069fbbae2558a3138df24776448791fea3aceeChris Lattner std::cerr << "Invalid operand for inline asm constraint '" 269053069fbbae2558a3138df24776448791fea3aceeChris Lattner << ConstraintCode << "'!\n"; 269153069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 269253069fbbae2558a3138df24776448791fea3aceeChris Lattner } 2693c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 269487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 269587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 269687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 269787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 269887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 269987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 270087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 270187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 270287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Check that the operand isn't a float. 270387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 270487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2705c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 270687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 270787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 270887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 270987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 271087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 271187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 271287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 271387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 271487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 271587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 271687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 2717c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 27182223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 271987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 272087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 272187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 272287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 272387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 272487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 272587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 272687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 272787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 272887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 2729a844126c43976387a66dafbe5137a762169f1f34Evan Cheng InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, TLI.getPointerTy()); 273087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 273187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 27326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 27336656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2734c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 2735c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 2736c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 2737c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 2738c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 2739c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 2740c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 2741c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 27426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 27436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2744c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 27456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2746ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2747ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 2748ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 2749ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 2750ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2751f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 2752f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 2753bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 2754ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 2755ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 27576656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 2758864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 2759864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 27606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 27616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 27626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 27636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 27646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 27656656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 2766864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 27676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 2768864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 2769864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 27706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2771ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27726656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 2773bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 27746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 2775786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 27766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 27778b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 27786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 2779bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 2780bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 2781ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 2782ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 2783ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2784ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 27851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 27861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 27871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 278968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 279068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 279168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 279268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 279368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 27941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 2796a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 27971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 27981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 27991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2801a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType())); 2802cf5734dddd66af9388a171b44996505ede47feedChris Lattner 2803cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2804adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true, 2805cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 2806cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 2807cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 2808cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 28091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 28121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 28131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(getValue(I.getOperand(0)), 2814a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson TLI.getTargetData()->getIntPtrType())); 28151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 2816cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2817adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true, 2818cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 2819cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 28201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2822025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 2823025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 2824025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 2825025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 2826025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 2827025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 2828025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 2829025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner std::cerr << "If a target marks an instruction with " 2830025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "'usesCustomDAGSchedInserter', it must implement " 2831025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "TargetLowering::InsertAtEndOfBasicBlock!\n"; 2832025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 2833025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 2834025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 2835025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 283639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 2837acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 2838acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2839acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 284039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 284139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 28421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 2843acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 2844acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 2845acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 2846acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 2847acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 28481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 2851acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 2852acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2853acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 28541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 2857acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 2858acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2859acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 2860acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 2861acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 28621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2864fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 2865fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 2866f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 2867f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 2868fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 2869fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 2870fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 2871fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 28728c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 2873fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 2874fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 2875fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2876fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 2877fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 2878fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2879fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2880fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2881fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2882fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2883fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2884fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 2885fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2886fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 2887fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 2888fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2889fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2890fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2891fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 2892fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 2893fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 2894fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2895fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2896fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (unsigned i = 0; i != NumVals; ++i) 2897fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 2898fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2899fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2900fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2901fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumElems = cast<PackedType>(I->getType())->getNumElements(); 2902fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner const Type *EltTy = cast<PackedType>(I->getType())->getElementType(); 2903f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2904fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2905fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2906fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2907fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2908fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 2909fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2910fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2911fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2912fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2913fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2914fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2915fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 29163b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 29178c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 2918fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2919fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 2920f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 2921f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 2922bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 29238c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 29248c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 2925fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2926fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 2927fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 2928fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 2929fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2930fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2931fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2932fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2933fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2934fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2935fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 2936fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2937fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 2938fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 2939fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 2940fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext 2941fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner : ISD::AssertZext; 2942fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT)); 2943fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 2944fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2945fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2946fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 2947fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2948fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 2949fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2950fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2951fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2952fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2953fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be reassembled from small 2954fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the source elt type is and how many small 2955fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it is. 2956fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2957fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2958fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (NumVals == 2) { 2959fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Lo = SDOperand(Result, i++); 2960fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Hi = SDOperand(Result, i++); 2961fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2962fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (!isLittleEndian()) 2963fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::swap(Lo, Hi); 2964fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2965fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi)); 2966fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2967fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Value scalarized into many values. Unimp for now. 2968fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2969fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2970fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2971fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2972fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2973020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const PackedType *PTy = cast<PackedType>(I->getType()); 2974020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 2975020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 2976f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2977fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2978fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2979fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2980d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2981020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 2982020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 2983d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 2984d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 2985d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 2986d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 2987d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 2988fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2989da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2990fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2991fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2992fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2993fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2994fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2995fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 2996fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 2997fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2998f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2999f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3000f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3001f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3002f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3003f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 3004f4ec817299a4187044a6162c2f520772b3ad69a0Chris LattnerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, 3005f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3006f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3007f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3008be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3009f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3010f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3011f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3012f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3013f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3014f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3015f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3016f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 3017f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(Args[i].second); 3018f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Op = Args[i].first; 3019f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng bool isSigned = Args[i].second->isSigned(); 3020f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3021f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3022f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3023f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3024d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3025f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3026f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3027f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3028f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng unsigned ExtOp = isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 3029f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 3030f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3031f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3032f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 3033f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3034f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3035d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3036f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3037f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3038f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3039f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 3040f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3041f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 3042f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 3043f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 3044f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (NumVals == 2) { 3045f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 3046f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(0, getPointerTy())); 3047f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 3048f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(1, getPointerTy())); 3049f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (!isLittleEndian()) 3050f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::swap(Lo, Hi); 3051f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3052f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Lo); 3053d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Hi); 3055d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 3056f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3057f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Value scalarized into many values. Unimp for now. 3058f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 3059f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3060f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3061da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3062da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 3063da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(Args[i].second); 3064da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3065da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3066da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3067da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3068da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3069da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 30701b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 30711b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner // Insert a VBIT_CONVERT of the MVT::Vector type to the packed type. 30721b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 30731b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 3074d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 30751b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 3076da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 3077da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3078da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3079f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3080f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3081f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3082f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3083f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3084f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 3085be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<MVT::ValueType, 4> RetTys; 3086f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3087f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 3088f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3089f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3090f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 3091f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 3092f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 3093f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3094f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3095f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 3096f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3097f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 3098f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 3099f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 3100f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 3101f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 3102f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 3103f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 3104f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 3105f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 3106f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3107da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 3108da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 3109da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(RetTy); 3110da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 3111da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 3112da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3113da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3114da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3115da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3116da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3117da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 3118da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3119da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 3120da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3121da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3122f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3123f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3124f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3125f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3126f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 3127f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3128f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 3129be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 3130be384162c68641233deba8702666af51bdfd4b83Chris Lattner DAG.getVTList(&RetTys[0], RetTys.size()), 3131be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 3132f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3133f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 3134f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 3135f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 3136f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 3137f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 3138f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 3139f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 3140f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 3141f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3142f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 3143f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 3144da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 3145da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBITCONVERT to convert from the packed result type to the 3146da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 3147da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = cast<PackedType>(RetTy)->getNumElements(); 3148da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = cast<PackedType>(RetTy)->getElementType(); 3149da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 3150da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 3151da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 3152da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 3153da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3154da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 3155da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 3156da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 3157d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 3158d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 3159da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 3160da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3161da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 3162da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 3163f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned AssertOp = RetTy->isSigned() ? 3164f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::AssertSext : ISD::AssertZext; 3165f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 3166f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 3167f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 3168f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3169f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 3170f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 3171f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3172f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3173f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 3174f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 3175f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 3176f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3177f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 3178f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 3179f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3180f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 3181f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3182f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 3183f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 3184f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3185f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3186f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 318739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// It is always conservatively correct for llvm.returnaddress and 318839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// llvm.frameaddress to return 0. 3189f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// 3190f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be 3191f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// expanded to 0 if the target wants. 319239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnerstd::pair<SDOperand, SDOperand> 319339ae3622791986a0232f7e4797b633f8fa9e54d2Chris LattnerTargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, 319439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth, SelectionDAG &DAG) { 319539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain); 31961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 31971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 319850381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 3199171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 3200171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 3201d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 3202171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 3203171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 32040aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 32050aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 32060aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 32070aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 32080aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 32090aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 32100aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 321139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) { 3212b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Depth = (unsigned)cast<ConstantInt>(I.getOperand(1))->getZExtValue(); 321339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner std::pair<SDOperand,SDOperand> Result = 3214a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG); 321539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner setValue(&I, Result.first); 321639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner DAG.setRoot(Result.second); 321739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 32181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 321974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 32201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 32211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 3222a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 32231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 32241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 32251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 32261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 32271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 32281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 32291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 32301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 32311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 32331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 32341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 32351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 32361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 32371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 32381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 32391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 32401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 32411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 32421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 32431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 32451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 32461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 32481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 324974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 325074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 325174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 325274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 325374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 325474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 325574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 325674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 325774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 325874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 325974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 326074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Val = (Val << 8) | Str[Offset]; 326174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 326274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 326374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 326474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 326574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 32661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 32671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 32681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 32691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 32701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 32711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 32721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3273c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 327480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 327580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 3276c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 3277c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 3278c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 32791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 32801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 32811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 32821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 32831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 32841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 32851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 32861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 32871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 32881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 32891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 32901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 32911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 32921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 32931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 32941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 32951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 32961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 32971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 32991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 330080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 330180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 330280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 330380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 33041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 330580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 330680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 330780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 3308dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 33091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 33101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 33111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 33121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 33131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 33141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 331580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 331680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 331780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 331880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 33191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 33201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 33211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 332280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 332380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 33241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 33251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33267041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 33271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 33281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 33291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 33301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 33311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 33321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 33331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 33351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 33361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 33371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 33381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 3339bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 33401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 3341ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 33421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 3343c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 3344c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 334580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 33461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 33471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 33481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 33491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 3350a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 3351786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 3352864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 33538b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 3354c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 3355c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 3356c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3357c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3358c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 3359c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 3360c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 3361c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 3362c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 3363c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 3364cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 336574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 336674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 3367cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 336874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 336974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 337074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 337174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 337274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 337374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 337474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 3375cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 337674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 337774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 337874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 3379cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (GV) { 33800937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 3381cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 3382cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 3383cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 3384cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 3385cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 338674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 338774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3388c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 3389c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 3390c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 339174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 339274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 3393cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 339474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 339574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 339674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3397786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3398786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 33998b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 340074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 340174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 340274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 3403466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 340474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 340574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 3406786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 3407786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 34088b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 340974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 3410c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 341174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 341274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 34131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3415c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 34161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 3418c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 3419c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 3420bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 3421bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 3422c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 3423c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 34241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 34251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 3426bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 34271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34297041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 34307041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 34317041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 34321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 34341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 34351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3437495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 343836b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // FIXME: we only modify the CFG to split critical edges. This 343936b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // updates dom and loop info. 3440c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 3441495a0b51915eb763576874f29192820b731edc22Chris Lattner} 34421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3443c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 34447e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// OptimizeNoopCopyExpression - We have determined that the specified cast 34457e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// instruction is a noop copy (e.g. it's casting from one pointer type to 34467e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// another, int->uint, or int->sbyte on PPC. 3447903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// 3448903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// Return true if any changes are made. 3449903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI) { 34507e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *DefBB = CI->getParent(); 34517e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34527e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner /// InsertedCasts - Only insert a cast in each block once. 34537e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner std::map<BasicBlock*, CastInst*> InsertedCasts; 34547e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 3455903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = false; 34567e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 34577e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UI != E; ) { 34587e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Use &TheUse = UI.getUse(); 34597e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *User = cast<Instruction>(*UI); 34607e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34617e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Figure out which BB this cast is used in. For PHI's this is the 34627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // appropriate predecessor block. 34637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *UserBB = User->getParent(); 34647e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 34657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner unsigned OpVal = UI.getOperandNo()/2; 34667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UserBB = PN->getIncomingBlock(OpVal); 34677e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 34687e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34697e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Preincrement use iterator so we don't invalidate it. 34707e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner ++UI; 34717e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34727e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this user is in the same block as the cast, don't change the cast. 34737e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (UserBB == DefBB) continue; 34747e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34757e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If we have already inserted a cast into this block, use it. 34767e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 34777e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34787e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (!InsertedCast) { 34797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock::iterator InsertPt = UserBB->begin(); 34807e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 34817e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34827e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner InsertedCast = 34833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer CastInst::createInferredCast(CI->getOperand(0), CI->getType(), "", 34843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer InsertPt); 3485903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = true; 34867e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 34877e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 34887e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Replace a use of the cast with a use of the new casat. 34897e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner TheUse = InsertedCast; 34907e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 3491903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3492903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If we removed all uses, nuke the cast. 3493903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->use_empty()) 3494903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner CI->eraseFromParent(); 3495903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3496903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return MadeChange; 34977e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner} 3498c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3499903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset, 3500903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// casting to the type of GEPI. 3501f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattnerstatic Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB, 3502f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *GEPI, Value *Ptr, 3503f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Value *PtrOffset) { 3504903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (V) return V; // Already computed. 3505903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 35063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Figure out the insertion point 3507903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner BasicBlock::iterator InsertPt; 3508903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (BB == GEPI->getParent()) { 35093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // If GEP is already inserted into BB, insert right after the GEP. 3510903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = GEPI; 3511903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ++InsertPt; 3512903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3513903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Otherwise, insert at the top of BB, after any PHI nodes 3514903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = BB->begin(); 3515903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 3516903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3517903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3518903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into 3519903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // BB so that there is only one value live across basic blocks (the cast 3520903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // operand). 3521903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CastInst *CI = dyn_cast<CastInst>(Ptr)) 3522903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType())) 35233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Ptr = CastInst::createInferredCast(CI->getOperand(0), CI->getType(), "", 35243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer InsertPt); 3525903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3526903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Add the offset, cast it to the right type. 3527903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt); 35283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Ptr is an integer type, GEPI is pointer type ==> IntToPtr 35293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer return V = CastInst::create(Instruction::IntToPtr, Ptr, GEPI->getType(), 35303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer "", InsertPt); 3531903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3532903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3533903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to 3534903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One 3535903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's 3536903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to 3537903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// sink PtrOffset into user blocks where doing so will likely allow us to fold 3538903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// the constant add into a load or store instruction. Additionally, if a user 3539903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// is a pointer-pointer cast, we look through it to find its users. 3540903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr, 3541903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Constant *PtrOffset, BasicBlock *DefBB, 3542903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GetElementPtrInst *GEPI, 3543f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> &InsertedExprs) { 3544903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (!RepPtr->use_empty()) { 3545903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Instruction *User = cast<Instruction>(RepPtr->use_back()); 3546903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 35473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // If the user is a Pointer-Pointer cast, recurse. Only BitCast can be 35483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // used for a Pointer-Pointer cast. 35493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (isa<BitCastInst>(User)) { 3550903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3551903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3552903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we 3553903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // could invalidate an iterator. 3554903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->setOperand(0, UndefValue::get(RepPtr->getType())); 3555903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner continue; 3556903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3557903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3558903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a load of the pointer, or a store through the pointer, emit 3559903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // the increment into the load/store block. 3560f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *NewVal; 3561903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<LoadInst>(User) || 3562903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) { 3563903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()], 3564903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->getParent(), GEPI, 3565903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3566903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3567903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this use is not foldable into the addressing mode, use a version 3568903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // emitted in the GEP block. 3569903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI, 3570903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3571903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3572903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3573f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner if (GEPI->getType() != RepPtr->getType()) { 3574f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner BasicBlock::iterator IP = NewVal; 3575f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner ++IP; 35763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // NewVal must be a GEP which must be pointer type, so BitCast 35773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer NewVal = new BitCastInst(NewVal, RepPtr->getType(), "", IP); 3578f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner } 3579903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->replaceUsesOfWith(RepPtr, NewVal); 3580903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3581903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3582903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3583903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3584c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction 3585c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// selection, we want to be a bit careful about some things. In particular, if 3586c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// we have a GEP instruction that is used in a different block than it is 3587c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// defined, the addressing expression of the GEP cannot be folded into loads or 3588c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// stores that use it. In this case, decompose the GEP and move constant 3589c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// indices into blocks that use it. 3590903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeGEPExpression(GetElementPtrInst *GEPI, 3591a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD) { 3592c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP is only used inside the block it is defined in, there is no 3593c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // need to rewrite it. 3594c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool isUsedOutsideDefBB = false; 3595c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock *DefBB = GEPI->getParent(); 3596c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end(); 3597c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner UI != E; ++UI) { 3598c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (cast<Instruction>(*UI)->getParent() != DefBB) { 3599c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner isUsedOutsideDefBB = true; 3600c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3601c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3602c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3603903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!isUsedOutsideDefBB) return false; 3604c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3605c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP has no non-zero constant indices, there is nothing we can do, 3606c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // ignore it. 3607c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool hasConstantIndex = false; 3608903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool hasVariableIndex = false; 3609c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3610c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3611903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) { 3612b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue()) { 3613c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner hasConstantIndex = true; 3614c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3615c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3616903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3617903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner hasVariableIndex = true; 3618903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3619c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3620903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3621903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a "GEP X, 0, 0, 0", turn this into a cast. 3622903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !hasVariableIndex) { 36233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer /// The GEP operand must be a pointer, so must its result -> BitCast 36243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Value *NC = new BitCastInst(GEPI->getOperand(0), GEPI->getType(), 3625903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->getName(), GEPI); 3626903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->replaceAllUsesWith(NC); 3627903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->eraseFromParent(); 3628903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3629903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3630903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 36313802c2552fe4475418db3c948e7601d7259f996dChris Lattner // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses. 3632903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0))) 3633903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return false; 3634c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3635c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the 3636c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constant offset (which we now know is non-zero) and deal with it later. 3637c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner uint64_t ConstantOffset = 0; 3638a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const Type *UIntPtrTy = TD->getIntPtrType(); 36393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Value *Ptr = new PtrToIntInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI); 3640c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner const Type *Ty = GEPI->getOperand(0)->getType(); 3641c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3642c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3643c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3644c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Idx = *OI; 3645c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 3646b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 3647c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (Field) 3648a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field]; 3649c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = StTy->getElementType(Field); 3650c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } else { 3651c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 3652c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3653c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Handle constant subscripts. 3654c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 3655b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 3656b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getType()->isSigned()) 3657b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CI->getSExtValue(); 3658c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner else 3659b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer ConstantOffset += TD->getTypeSize(Ty)*CI->getZExtValue(); 3660c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner continue; 3661c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3662c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3663c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Ptr = Ptr + Idx * ElementSize; 3664c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3665c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Cast Idx to UIntPtrTy if needed. 36663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Idx = CastInst::createInferredCast(Idx, UIntPtrTy, "", GEPI); 3667c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3668a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 3669c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Mask off bits that should not be set. 3670c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3671b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Constant *SizeCst = ConstantInt::get(UIntPtrTy, ElementSize); 3672c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3673c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Multiply by the element size and add to the base. 3674c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI); 3675c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI); 3676c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3677c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3678c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3679c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Make sure that the offset fits in uintptr_t. 3680c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3681b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer Constant *PtrOffset = ConstantInt::get(UIntPtrTy, ConstantOffset); 3682c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3683c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Okay, we have now emitted all of the variable index parts to the BB that 3684c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // the GEP is defined in. Loop over all of the using instructions, inserting 3685c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // an "add Ptr, ConstantOffset" into each block that uses it and update the 3686c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // instruction to use the newly computed value, making GEPI dead. When the 3687c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // user is a load or store instruction address, we emit the add into the user 3688c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // block, otherwise we use a canonical version right next to the gep (these 3689c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // won't be foldable as addresses, so we might as well share the computation). 3690c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner 3691f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> InsertedExprs; 3692903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3693c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3694c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Finally, the GEP is dead, remove it. 3695c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner GEPI->eraseFromParent(); 3696903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3697903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3698c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner} 3699c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3700bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3701bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// SplitEdgeNicely - Split the critical edge from TI to it's specified 3702bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// successor if it will improve codegen. We only do this if the successor has 3703bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// phi nodes (otherwise critical edges are ok). If there is already another 3704bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// predecessor of the succ that is empty (and thus has no phi nodes), use it 3705bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner/// instead of introducing a new block. 3706bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattnerstatic void SplitEdgeNicely(TerminatorInst *TI, unsigned SuccNum, Pass *P) { 3707bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *TIBB = TI->getParent(); 3708bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *Dest = TI->getSuccessor(SuccNum); 3709bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner assert(isa<PHINode>(Dest->begin()) && 3710bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner "This should only be called if Dest has a PHI!"); 3711bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3712bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner /// TIPHIValues - This array is lazily computed to determine the values of 3713bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner /// PHIs in Dest that TI would provide. 3714bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner std::vector<Value*> TIPHIValues; 3715bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3716bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Check to see if Dest has any blocks that can be used as a split edge for 3717bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // this terminator. 3718bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner for (pred_iterator PI = pred_begin(Dest), E = pred_end(Dest); PI != E; ++PI) { 3719bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BasicBlock *Pred = *PI; 3720bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // To be usable, the pred has to end with an uncond branch to the dest. 3721bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner BranchInst *PredBr = dyn_cast<BranchInst>(Pred->getTerminator()); 3722bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (!PredBr || !PredBr->isUnconditional() || 3723bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Must be empty other than the branch. 3724bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner &Pred->front() != PredBr) 3725bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner continue; 3726bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3727bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Finally, since we know that Dest has phi nodes in it, we have to make 3728bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // sure that jumping to Pred will have the same affect as going to Dest in 3729bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // terms of PHI values. 3730bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner PHINode *PN; 3731bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner unsigned PHINo = 0; 3732bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner bool FoundMatch = true; 3733bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner for (BasicBlock::iterator I = Dest->begin(); 3734bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I, ++PHINo) { 3735bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (PHINo == TIPHIValues.size()) 3736bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner TIPHIValues.push_back(PN->getIncomingValueForBlock(TIBB)); 3737bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3738bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // If the PHI entry doesn't work, we can't use this pred. 3739bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (TIPHIValues[PHINo] != PN->getIncomingValueForBlock(Pred)) { 3740bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner FoundMatch = false; 3741bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner break; 3742bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3743bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3744bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3745bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // If we found a workable predecessor, change TI to branch to Succ. 3746bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (FoundMatch) { 3747bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner Dest->removePredecessor(TIBB); 3748bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner TI->setSuccessor(SuccNum, Pred); 3749bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner return; 3750bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3751bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner } 3752bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3753bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner SplitCriticalEdge(TI, SuccNum, P, true); 3754bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner} 3755bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 3756bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 37571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 37581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 37591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 37601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "\n\n\n=== " << Fn.getName() << "\n"); 37611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 376247e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner // First, split all critical edges. 3763c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 37647e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // In this pass we also look for GEP and cast instructions that are used 37657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // across basic blocks and rewrite them to improve basic-block-at-a-time 37667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // selection. 37677e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // 3768903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = true; 3769903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (MadeChange) { 3770903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = false; 377136b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 3772bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner // Split all critical edges where the dest block has a PHI. 377347e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner TerminatorInst *BBTI = BB->getTerminator(); 377447e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner if (BBTI->getNumSuccessors() > 1) { 377547e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner for (unsigned i = 0, e = BBTI->getNumSuccessors(); i != e; ++i) 3776bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner if (isa<PHINode>(BBTI->getSuccessor(i)->begin()) && 3777bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner isCriticalEdge(BBTI, i, true)) 3778bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner SplitEdgeNicely(BBTI, i, this); 377947e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner } 378047e32e6b831dad8289fd498c71c5f641172b1c09Chris Lattner 3781c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 378257f9a43c64e8c5c8b2566fb6649754c11b59b98aChris Lattner for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) { 37837e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *I = BBI++; 37843f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 37853f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (CallInst *CI = dyn_cast<CallInst>(I)) { 37863f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner // If we found an inline asm expession, and if the target knows how to 37873f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner // lower it to normal LLVM code, do so now. 37883f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (isa<InlineAsm>(CI->getCalledValue())) 37893f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (const TargetAsmInfo *TAI = 37903f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner TLI.getTargetMachine().getTargetAsmInfo()) { 37913f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner if (TAI->ExpandInlineAsm(CI)) 37923f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner BBI = BB->begin(); 37933f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner } 37943f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 3795903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData()); 37967e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } else if (CastInst *CI = dyn_cast<CastInst>(I)) { 3797c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // If the source of the cast is a constant, then this should have 3798c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // already been constant folded. The only reason NOT to constant fold 3799c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // it is if something (e.g. LSR) was careful to place the constant 3800c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // evaluation in a block other than then one that uses it (e.g. to hoist 3801c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // the address of globals out of a loop). If this is the case, we don't 3802c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner // want to forward-subst the cast. 3803c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner if (isa<Constant>(CI->getOperand(0))) 3804c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner continue; 3805c970f062e0a66d97a06eca213486a16fae1b37a4Chris Lattner 38067e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is a noop copy, sink it into user blocks to reduce the number 38077e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // of virtual registers that must be created and coallesced. 38087e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 38097e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType DstVT = TLI.getValueType(CI->getType()); 38107e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38117e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // This is an fp<->int conversion? 38127e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT)) 38137e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner continue; 38147e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38157e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is an extension, it will be a zero or sign extension, which 38167e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // isn't a noop. 38177e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT < DstVT) continue; 38187e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38197e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If these values will be promoted, find out what they will be promoted 38207e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 38217e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // are. 38227e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) 38237e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner SrcVT = TLI.getTypeToTransformTo(SrcVT); 38247e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(DstVT) == TargetLowering::Promote) 38257e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner DstVT = TLI.getTypeToTransformTo(DstVT); 38267e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 38277e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 38287e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT == DstVT) 3829903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeNoopCopyExpression(CI); 38307e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 38317e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 383236b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner } 3833903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3834c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 38351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 38361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 38381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3839edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 38401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 38411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3843571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 3844571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 3845571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 384618c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3847d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 384818c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3849d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3850d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3851d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3852d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3853d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3854d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3855571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 38561c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 385770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 385870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 385970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()), 386070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 38611c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 386270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 386370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 386470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 386570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 386670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 386770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 386870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 386970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 387070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 3871bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 3872571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Root = getRoot(); 387370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 387470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 3875a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(i, TLI.getPointerTy())); 387670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 387770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 387870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 387970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 388070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 388170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 388270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 388370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 388470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 388570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 388670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 388770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 388870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 388970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3890a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 389170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3892a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 389370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 389470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 389570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 38961c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 3897bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, 3898bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3899d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else if (SrcVT < DestVT) { 3900d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 3901fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 3902fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 3903fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 3904fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 3905571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return DAG.getCopyToReg(getRoot(), Reg, Op); 3906d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 3907d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 3908d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3909a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 3910d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3911a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 3912571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner Op = DAG.getCopyToReg(getRoot(), Reg, Lo); 3913d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 3914d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 39151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3917068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 3918068a81e9fca511b9a3b3a0f28a8988a57f994652Chris LattnerLowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL, 3919068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 39201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 3921068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner Function &F = *BB->getParent(); 39220afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 3923bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 3924bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 3925bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3926bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 3927bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 3928bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 3929bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 3930bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 3931f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3932bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 3933bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 3934bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (FuncInfo.ValueMap.count(AI)) { 3935bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand Copy = 3936571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(AI, FuncInfo.ValueMap[AI]); 3937bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 3938bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 39390afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 3940bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3941bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 3942966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 3943bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 3944068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 3945068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3946068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 3947068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 3948f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3949068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 3950068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3951068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 3952edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3953bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 3954bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (LLVMBB == &LLVMBB->getParent()->front()) 3955bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 39561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 39581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 39591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 39611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 39621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 39631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 3964f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 39651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 39661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 39671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 3968f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 3969ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 39701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 3971ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3972571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 39731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 39741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 39761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 39771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 39781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 39791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 39801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 3981edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 39828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 39831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 39841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 39851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 3986d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 39878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 39888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 39898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 39908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 39918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 39921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 39931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 39941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 39951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 3996d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 39978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 3998d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 39998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 40008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 40018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 40028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 40038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 40048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 40061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 40071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 40091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 40101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 40111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 40128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 40138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 40148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 40158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 40178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 40183f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 40198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 40208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 40218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 40228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 40238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 40248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 40251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 40278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 40288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 40298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 40308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 40318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 40328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 40338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 40348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 40358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 40367e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 40371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 40398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 40408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 40418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 40428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned NumElements; 40438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VT != MVT::Vector) 40448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = TLI.getNumElements(VT); 40458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner else { 40468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT1,VT2; 40478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner NumElements = 40488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 40498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner VT1, VT2); 40508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 40518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 40528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 40538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 40541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 40551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 40561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4057ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 40585a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 40597436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 40607436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 40617436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 40627436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 40637436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 40647436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 40657436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 40667436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 40677436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 40687436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 40697436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 40707436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4071bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4072bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4073ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4074ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 40751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 40761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*LLVMBB->getTerminator()); 4077a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4078f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 407937efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4080f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4081f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 408237efe6764568a3829fee26aba532283131d1a104Nate Begeman JT = SDL.JT; 4083f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4084a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4085a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 40861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 40871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4088f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4089c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4090c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4091c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4092af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4093c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 40942300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 40951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Lowered selection DAG:\n"); 40961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4097f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 40981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 40991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4100ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4101f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Legalized selection DAG:\n"); 41031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4104f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4105af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4106c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 41072300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4108a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4109552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4110a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4111a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 41121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4113f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Selected machine code:\n"); 41151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4116f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4117f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4118f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4119f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4120f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4121f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 4122f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 4123f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4124f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4125f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4126f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4127f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 41281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4129f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4130f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4131f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4132f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4133a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 41341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 413537efe6764568a3829fee26aba532283131d1a104Nate Begeman if (SwitchCases.empty() && JT.Reg == 0) { 4136f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4137f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4138f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4139f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 414009e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4141f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4142f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4143f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 41441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4145f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 41469453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 41479453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 41489453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 414937efe6764568a3829fee26aba532283131d1a104Nate Begeman if (JT.Reg) { 415037efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(SwitchCases.empty() && "Cannot have jump table and lowered switch"); 415137efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 415237efe6764568a3829fee26aba532283131d1a104Nate Begeman CurDAG = &SDAG; 415337efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 41549453eea49bca1c3904047db495855c93e001d1cdNate Begeman MachineBasicBlock *RangeBB = BB; 415537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 415637efe6764568a3829fee26aba532283131d1a104Nate Begeman BB = JT.MBB; 415737efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.setCurrentBasicBlock(BB); 415837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 415937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.visitJumpTable(JT); 416037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDAG.setRoot(SDL.getRoot()); 416137efe6764568a3829fee26aba532283131d1a104Nate Begeman CodeGenAndEmitDAG(SDAG); 416237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 416337efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 416437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 416537efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 416637efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 416737efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 4168f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (PHIBB == JT.Default) { 416909e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4170f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(RangeBB); 4171f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 4172f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 417309e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4174f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 417537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 417637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 417737efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 417837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 417937efe6764568a3829fee26aba532283131d1a104Nate Begeman 4180b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4181b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4182b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4183b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4184b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4185b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4186b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4187b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4188b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4189b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4190b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4191b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4192f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4193f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4194d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 4195f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 4196f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4197f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4198d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4199f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4200f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4201f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4202d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4204f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4205f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4206f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4207d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4208d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4209d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4210d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4211d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 421257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4213d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4214d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4215d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4216d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4217d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4218d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4219d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4220d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4221d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4222d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4223d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4224f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4225d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4226d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 422757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 422857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4229d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4230d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 42312452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 423257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4233f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 423457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4235a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 42361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4237a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 423813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4239a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4240a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4241a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4242a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4243a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 424413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4245eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 424613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 424713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4248eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 42499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 42504ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 425113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 42529ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4253a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4254cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4255a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 42560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 425703fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 42589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 42599ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 42609ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 42619ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4262755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4263755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4264755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4265755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4266755480681c795d585c73556c028b6143c46bda86Chris Lattner 4267755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4268755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4269755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4270755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4271755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4272755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4273755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4274755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4275755480681c795d585c73556c028b6143c46bda86Chris Lattner 4276755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4277755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4278755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4279755480681c795d585c73556c028b6143c46bda86Chris Lattner 4280755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4281755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4282755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4283755480681c795d585c73556c028b6143c46bda86Chris Lattner 4284755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4285755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4286755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4287755480681c795d585c73556c028b6143c46bda86Chris Lattner if (getTargetLowering().MaskedValueIsZero(LHS, NeededMask)) 4288755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4289755480681c795d585c73556c028b6143c46bda86Chris Lattner 4290755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4291755480681c795d585c73556c028b6143c46bda86Chris Lattner 4292755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4293755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4294755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4295755480681c795d585c73556c028b6143c46bda86Chris Lattner 4296755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4297755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4298755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4299755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4300755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4301755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4302755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4303755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4304755480681c795d585c73556c028b6143c46bda86Chris Lattner 4305755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4306755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4307755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4308755480681c795d585c73556c028b6143c46bda86Chris Lattner 4309755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4310755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4311755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4312755480681c795d585c73556c028b6143c46bda86Chris Lattner 4313755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4314755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4315755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4316755480681c795d585c73556c028b6143c46bda86Chris Lattner 4317755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4318755480681c795d585c73556c028b6143c46bda86Chris Lattner getTargetLowering().ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4319755480681c795d585c73556c028b6143c46bda86Chris Lattner 4320755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4321755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4322755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4323755480681c795d585c73556c028b6143c46bda86Chris Lattner 4324755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4325755480681c795d585c73556c028b6143c46bda86Chris Lattner 4326755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4327755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4328755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4329755480681c795d585c73556c028b6143c46bda86Chris Lattner 43309ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 43310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 43320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 43330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 43340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 43350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 43360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 43370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 43390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 43400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 43420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 43430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 43440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 43460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 43470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 43480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 43490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 43500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 43510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 43520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 43530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 43540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 43550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 43560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::cerr << "Could not match memory address. Inline asm failure!\n"; 43570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 43580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 43590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 43610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32)); 43620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 43630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 43640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 43650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 43660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 43670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 43680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 43690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 43700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 4371