SelectionDAGISel.cpp revision cfacc8f5d25f38112eee836530004f7816439765
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 51c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This file was developed by the LLVM research group and is distributed under 61c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 16c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 2944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey#include "llvm/CodeGen/MachineModuleInfo.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3237efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 34eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 37fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 43124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 46a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 477e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 517944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 52a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 53a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 55a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 56a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 577944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 585e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 61eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 62eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 63eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 734ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 7613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 773700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 7813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 7913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 809ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 819373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 829373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 834ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 85bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { struct AsmOperandInfo; } 86bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 87864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 88864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 89864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 90864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 91864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 929525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 93b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// Regs - This list holds 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. 120b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 121864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 122b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 124c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 125c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 127b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 129b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 132c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1359f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 136864635ad7b3046d3042311423071152c613961deChris Lattner }; 137864635ad7b3046d3042311423071152c613961deChris Lattner} 1384ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1589373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 161f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 162f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1769f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 183f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 184f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 185f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 186f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 187f40708223e409a152834b1553c6883ff2035b957Duncan Sands 1881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 191571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 192571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 193571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 194571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 195571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 196571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 197edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 208f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// isFilterOrSelector - Return true if this instruction is a call to the 209f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// eh.filter or the eh.selector intrinsic. 210f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic bool isFilterOrSelector(Instruction *I) { 211f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 212f40708223e409a152834b1553c6883ff2035b957Duncan Sands return II->getIntrinsicID() == Intrinsic::eh_selector 213f40708223e409a152834b1553c6883ff2035b957Duncan Sands || II->getIntrinsicID() == Intrinsic::eh_filter; 214f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 215f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 216f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 218f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 219f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 224f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 225571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 226f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 231bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 232f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 233f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 234bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 235bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 237f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 240bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 241bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 243edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 246bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 247bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 24816ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 24916ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 250bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 251bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 253bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 254bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 255bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2562aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 259b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 261a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 262ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 263d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 264ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 265a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 266b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 267d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 2696266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 2701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2722aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2732aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2822aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 2958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 297c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 298b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 299c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 310b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 311b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 31295b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 3138c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman unsigned R = MakeReg(RegisterVT); 3148c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman for (unsigned i = 1; i != NumRegisters; ++i) 3158c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman MakeReg(RegisterVT); 3168c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3290da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 331d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 332d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 333d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 334d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 335d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 336d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 384b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 385b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 3865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 3885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 3904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 3915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 3925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 3935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 3945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 3975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 3994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 412a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 414f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 415f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 416f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 421f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 427edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 432a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 433a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 434a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 435d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 436d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 437edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 438d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 439d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 440d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 441d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 442d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 443d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 444d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 445d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 446bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 447bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 448d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 450d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 451a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 452a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 453571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 454571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4581e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4591e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 473466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 47495c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 480199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4820da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4850da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 488e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 489e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 490e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 491f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 492571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 493571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 494571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 4958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 496571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 4971da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 4981da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 499070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov bool IsTailCall, SDOperand Callee, unsigned OpIdx, 500070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 501070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 505f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 508b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 509dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 513dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 517dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 525f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 53037efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 535b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 536b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5387f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 539e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5405fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 5431628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 54501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 546b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5471628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5487f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 5501628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 5521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 5547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 5557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 5567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 5577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 5587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 5597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 5607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 5617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 56224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5633822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5643822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 56545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 56645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 5673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5812bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5822bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5833e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 584c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 595ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 596c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5970eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6047041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 617199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 618199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 619199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 620199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 621199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 623199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 624199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 625199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 6260da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 6270da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 6280da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 629199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 630199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 631199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 632199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 633199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 6349d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 63523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 63623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 6377f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR of undef nodes. 6389d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 63923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 64023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 64123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 642bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 64323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 64423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 64523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 6467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 6477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return N = DAG.getNode(ISD::BUILD_VECTOR, VT, 648bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 649199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 650199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 6519d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 652199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 653199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 654199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 655199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 656199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 657199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 658bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 6599d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 6602bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6612bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 662199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 663199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 665199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 666199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 667199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 668199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 669199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 670199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 671199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 6727f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR node. 6737f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 6747f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], 6750da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 676199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 677199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 6786b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 679199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 680199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 681199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 682199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 683199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 684199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 685199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 686199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 687199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 688199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 689251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 690251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 691199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 692b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 693b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(VT); 694b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 695b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> Regs(NumRegs); 696b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 697b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Regs[i] = InReg + i; 698b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 699b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegsForValue RFV(Regs, RegisterVT, VT); 700b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 701b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 702b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 703199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 708a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 711bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 712ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 713ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 714ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 715ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 716ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 717ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 718ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7198e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7208e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 721ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 722ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 723ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 724ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 725ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 726ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 727ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 72847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 7295694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 730bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 73118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt)) 7328c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 73318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt)) 73447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 735376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 736ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 737ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 73847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer NewValues.push_back(DAG.getConstant(false, MVT::i32)); 7391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 740bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 741bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 7421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 744571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 745571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 746571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 747571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 748571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 749571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 750571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 751571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 752571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 753571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 754571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 755571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 756571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 757571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 7588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 7598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 7608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 7618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 7628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 7638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 7648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 7658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 7668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 7678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 7688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 7698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 7708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 7718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 7728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 7738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 7748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 7758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 7768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 7778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 7788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 7798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 7808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 7818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 7828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 7838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 7848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 7856a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 7866a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 7876a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 7886a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 7896a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 7906a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 791571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 792571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 793571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 794571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 795571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 796571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 797571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 798e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 799571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 800e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 801e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 8026a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 8036a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 8046a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 805571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 806571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 807e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 808e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 809e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 810e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 8115a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 8125a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 8135a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 8145a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 8155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 816e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 817e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 818e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 819e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 820e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 821e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 822e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 823e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 824e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 825e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 826e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 827e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 828e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 829e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 830e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 831e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 832e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 833e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 834e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 835e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 836e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 837e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 838e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 839e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 840e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 841e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 842e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 843e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 844e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 845e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 846e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 847e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 848e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 849e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 850e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 851e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 852e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 853e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 854e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 855e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 856e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 857e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 8580da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 859e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 860571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 861571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 862571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 8635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 864571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 865571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 866571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 867571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 868571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 8696b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 8705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 871571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 872571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 873571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 874571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 875d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 876d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 877571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 878571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 879571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 880571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 881d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 882d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 883d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 884d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 885d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 886d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 887d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 888d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 889571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 890d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 891d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 892d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 893d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 894d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 895d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 896d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 897d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 898d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 899d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 900d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 901d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 902d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 903d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 904d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 905d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 906d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 907d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 908d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 909d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 910d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 911d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 912571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 913571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 914df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 915df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 916df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 917df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 918df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 919df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 920df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 9210ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 9220ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 9230ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 9240ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 9250ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 9260ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 9270ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 9280ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 9290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 930df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 931df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 932df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 9331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 9341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 9351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 9361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 9381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 9391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 9401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 9411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 9421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 9441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 9451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 946a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 947dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 94857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 94957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 95057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 95157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 95257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 95357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 95457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 95557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 95657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 95757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 95857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 959571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 960571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 961571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 962571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 963571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 965571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 966571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 967571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 968571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 969571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 970571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 971571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 972571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 973571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 974571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 975571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 976571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 977d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 978571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 979571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 9800ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 9810ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 9820ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 9830ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 9840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 985df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 986df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 987df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 988df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 989df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 990df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 991df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 992df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 993df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 994df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 995df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 9965a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 9975a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 9980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 9990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 10000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 10010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 10020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1003df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1004571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1005571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 10062452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 10072452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 10086b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 10095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 10102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 10112452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 10122452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 10131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 10141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1015f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1016f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1017f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 101857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 101957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 102057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 10215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 10225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 10235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 10245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 10255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 10265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 10275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 10285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 10295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 10305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 10315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 10325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 10335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 10345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 10355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 10365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 10375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 10385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 10395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 10403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 10415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 10425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 10435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 10445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 10455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 10465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 10475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 10485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 10495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 10505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1051f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1052f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1053f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1054f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1055f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1056f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1057f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1058f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1059f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 106057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 106157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1062f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1063f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1064f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1065f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 106657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 106757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1068f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1069f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1070f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 107157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1072f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 107357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 107457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1075f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1076f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 10773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 107837efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 107937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1080f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 108137efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 10823d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 10833d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 10843d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 10853d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 10863d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 108737efe6764568a3829fee26aba532283131d1a104Nate Begeman} 108837efe6764568a3829fee26aba532283131d1a104Nate Begeman 10893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 10903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 10913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 10923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 10933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 10943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 10953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 10963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 10973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 10983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 10993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 11003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 11023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 11033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 11043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 11053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 11067f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 11073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 11083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 11093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 11103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 11123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 11133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 11143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 11163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 11173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 11183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 11193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 11203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 11213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 11233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 11243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 11253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 11263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 11273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 11283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 11303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 11313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 11333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 11343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 11353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 11364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 11374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 11393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 11403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 11414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 11424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 11434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 11444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 11454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 11464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 11474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 11484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 11494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 11514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 11524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 11534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 11544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 11567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 11574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 11584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 11594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 11604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 11624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 11634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 11644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 11654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 11674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 11684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 11694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 11714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 11724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 11744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 11754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 11764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 11774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 11784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 11794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 11814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 11824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 11834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 11844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 11854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 11864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 11884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 11894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 11914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 11924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 11944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 11954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 11964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 11974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 11984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 11994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 12014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 12024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 12034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 12044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 12054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 12064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 12074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 12084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 12094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 12114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 12124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 12134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 12144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 12154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 12164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 12184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 12194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 12204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 12214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 12224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 12244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 12254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 12274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 12283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1229b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1230b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1231b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1232f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 12339fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1234f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands LowerCallTo(I, I.getCalledValue()->getType(), 1235f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands I.getCallingConv(), 1236f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands false, 1237f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands getValue(I.getOperand(0)), 1238f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 3, LandingPad); 1239f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1240f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1241f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1242f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1243f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1244f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 1245f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second)); 1246f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 12479fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1248f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 1249f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1250f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1251070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1252f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1253f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1254f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1255b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1256b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1257b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1258b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1259b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 12605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1261b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1262dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1263b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1264b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1265b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1266dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1267dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1268dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1269dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 12704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1271dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 12725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1273b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1274b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1275b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1276b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1277b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1278b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1279b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1280b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1281b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1282b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1283b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1284b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1285b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1286b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1287b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1288b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1289b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 12905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1291b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1292b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1293b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 12945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1295b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1296b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1297b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1298b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1299b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1300b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1301b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1302b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1303b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1304b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1305b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1306b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1307b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1308b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1309b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1310b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1311b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1312b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1313b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 13145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 13155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 13165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 13175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 13185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 13195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 13205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 13215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 13225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 13235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 13245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 13255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 13265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1327b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1328b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1329b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1330b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1331b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1332b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1333b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1334b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1335b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1336b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1337b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1338b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1339dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1340dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1341b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1342b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 13437294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 13447294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 13457294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 13467294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 13477294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1348b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1349dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1350b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1351b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1352b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1353dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1354dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1355dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 13575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 13585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 13595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 13605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 13615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 13625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1363dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13647294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1365dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1366dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 13685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1369dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1370dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 13715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 13725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 13734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 13745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1375b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1376b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1377dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1378b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1379b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1380b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1381b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1382b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1383b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1384b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1385b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1386b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1387b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1388b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1389b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1390b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1391b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1392b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1393b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1394b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1395b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1396b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1397b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 13984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1399b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1400b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1401b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1402b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 14035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 14045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 14055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 14065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 14085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 14095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 14105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1411b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1412b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1413b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 14145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1415b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1416b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 14175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1418b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1419b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1420b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1421b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1422b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1423b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1424b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1425b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1426b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1427b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1428b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1429b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1430b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1431b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1432f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1433b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1434b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1435b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1436b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1437b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1438b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1439b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1440dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1441b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1442b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1443b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1444b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1445dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1446b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1447b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1448b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1449b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1450b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1451b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1452b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1453b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1454b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1455b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1456b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1457b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1458b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1459b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1460b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1461b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1462b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1463b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1464b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1465b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1466b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 14675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 14685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 14694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 14705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1471b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1472b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1473b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 14755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 14765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 14775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 14785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 14805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 14814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 14824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 14834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1484b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 14855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 14865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 14875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 14884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1489b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 149154e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 14924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 14934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 14944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 14954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 14964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 14974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 14994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 15004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 15045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15067294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 15077294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 15087294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 15097294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 15107294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 15117294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 15155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 15255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 15265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 15275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 15285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1529b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1533b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1534b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1535b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1539b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 15405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 15415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 15425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1550b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 15525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 15535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1555b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1557b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1558b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1559dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1560dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1562b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 15644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 15654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 15664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 15674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 15684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 15693ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1570b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 15714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 15734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 15744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 15764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 15774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 15784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 15804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 15824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 15834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 15854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 15874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 15884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 15904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 15914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 15924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 15934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 15944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 15954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 15974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 15984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 15994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 16014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 16024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 16034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 16044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 16054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 16064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 16074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 16084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1609ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 16104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 16114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 16124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 16134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 16144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 16164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 16174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 16194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 16204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 16214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1622e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 16234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 16244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 16254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 16264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 16294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 16304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 16324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 16334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 16344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 16354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 16364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 16384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 16394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 16404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 16414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 16444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 16454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 1647e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 16484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 16494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 16534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 16554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 16574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 16584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 16594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 16614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 16634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 16644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 16654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 16664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 16684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 16694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 16704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 16714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 16724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 16734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1675efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 16764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 16774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 16794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 16804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 16824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 16844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 16854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 16885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 16895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 16905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 16915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 16935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 16945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 16955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 16965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 16975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 16985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 17005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 17025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 1703cfacc8f5d25f38112eee836530004f7816439765David Greene // Cray [dag]: Must recompute end() each iteration because it may 1704cfacc8f5d25f38112eee836530004f7816439765David Greene // be invalidated by erase if we hold on to it 1705cfacc8f5d25f38112eee836530004f7816439765David Greene for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 17065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 17075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 17085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 17095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 17105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 17125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 17135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 17145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 17155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 17165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 17175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 17185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 17225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 17235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 17245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 17255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 17285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1731f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1732f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1733f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1734c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 17355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1736d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1737f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1738f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 17395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1740f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1741c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1742f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1743d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1744f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1745d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1746c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1747d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1748f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1749f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1750f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1751f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1752f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1753f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 17545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 17555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 17565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 17575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1758c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1759f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1760f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1761f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 17625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 176337efe6764568a3829fee26aba532283131d1a104Nate Begeman 17643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 17663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 17673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 17693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 17703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 17713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 17723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 17773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1778dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1779dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1780dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 17823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 17833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1784dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1785dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1786dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1787dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 1788dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 1789dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 1790f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1791f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1792f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 17933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1794b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1795b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 179624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 17979d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 17987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 17997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 18007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 18017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned VL = DestTy->getNumElements(); 18027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman std::vector<Constant*> NZ(VL, ConstantFP::get(ElTy, -0.0)); 18037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 18047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (CV == CNZ) { 18057f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand Op2 = getValue(I.getOperand(1)); 18067f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 18077f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return; 18087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 18097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 18107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 18117f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 181201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 181301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 181401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 181501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 181601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 181701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 18187f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 18197f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 18207f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 1821b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1822b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 18237f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 18241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 18251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 182624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 182724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 18281628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 18291628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 1830e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1831e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1832e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1833e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 18347f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 18357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 1836832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 1837832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 1838832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1839e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 18401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 18411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 18421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 184345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 1844e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 1845e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 1846e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 1847e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 1848e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 1849e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1850e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 185145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 1852e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 185345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 185445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 185545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 185645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 185745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 185845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 185945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 186045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 186145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 186245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 186345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 186445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 186545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 186645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 186745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 186845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 186945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 187045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 187145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 1872e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 1873e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 1874e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 1875e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 1876e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 1877e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 1878e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 1879e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 1880e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 1881e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1882e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1883e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1884e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1885e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1886e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1887e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1888e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1889e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1890e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1891e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1892e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1893e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1894e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1895e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1896e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 189745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 189845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 1899e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 190045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 190145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 1902e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1903e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1904e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1905e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1906e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 19071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 19081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 19091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 19101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 19111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 19121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 19137f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 19147f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 19151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 19161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 19173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 19193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 19203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 19233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 19263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 19273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 19283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 19313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 19343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 19353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 19363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 19393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 19423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 19433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 19463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 19493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 19503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 19533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 19563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 19573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 19603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 19633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 19643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 19673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 19703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 19713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 19743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 19773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 19783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 19793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 19813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 19833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 19843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 19853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 19861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1987e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 198828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 19893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 19903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 19913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 19923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 19933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 19943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 19953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 19963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 19971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 19983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 19993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 20003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 20013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 20033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 20053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 20063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 20073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 20083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 20093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 20103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 20123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 20133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 20143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 20153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 20163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 20173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 20183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 20193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 20203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 20211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20232bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2024c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2025c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2026c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2027c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2028c7029805ef35ce9805931067b841e6af11db382eChris Lattner 20297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 20307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 20317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2032c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2033c7029805ef35ce9805931067b841e6af11db382eChris Lattner 20342bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2035384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2036384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2037384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 20387f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2039384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2040384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2041c7029805ef35ce9805931067b841e6af11db382eChris Lattner 20423e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 20433e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 20443e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 20453e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 20463e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 20477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 20487f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 20497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 20503e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 20513e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 20523e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 20531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 20541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 20551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 20561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 20571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 20581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 20591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2060c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2061b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 20621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 20631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2064b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 20651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2066dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 20671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 20681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 20691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 20701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 20717c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 20727c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 20737c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2074b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 207547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 20760d630d220414b02fed6873555bb46795a682174bEvan Cheng TD->getTypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 20777c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 20787c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 20797c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 20807c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 20817c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2082a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 20837c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 20847c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 20857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 20867c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 20877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 208847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 20897c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 20907c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 20917c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 20927c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 20937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 20947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 20957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 20967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 20976b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 20981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 20997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 21001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21017c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 21027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 21037c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 21047c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 21051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 21081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 21111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 21121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 21131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 21141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 21151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2117a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 211858092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2119d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 212058092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 21211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 212368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 212468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 212568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 212668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 212768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 21281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 212968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 21301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 21311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 21331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 21341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 21351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 21361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 21371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 21381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 21391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 21401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 21411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 21421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 21431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 21441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 21451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 21461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 21471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2148bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2149f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2150f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2151f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 21520da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 21530da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 21541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 21561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 21571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 21581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 21611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2162edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2163d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2164d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2165d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2166d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2167d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2168d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2169d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 217028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2171466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 217295c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 217328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 217428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 217528b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2176466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 217795c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 217895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 21797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 21807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 21817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2182d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 218328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2184d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2185d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2186d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 218728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 218828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 21891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 21931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 21941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 21951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 21960b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 219795c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 21981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22000eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 22010eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 22020eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 22030eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 22040eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 22050eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 22060eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 22070eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 22080eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2209e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2210e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2211e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2212e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2213e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2214e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2215e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2216e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2217e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 22180eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 22190eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 22200eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 22210eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 22227255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2223e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 22240eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22250eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2226bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2227e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2228e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2229e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2230e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2231e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2232e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2233e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2234e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 22350eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22360eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 22370eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 22380eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22390eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 22400eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 22410eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 22420eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 22430eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 22440eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 22450eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22460eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22470eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 22480eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 22490eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 22507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 22519d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 22520eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 22530eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22540eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 22550eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 22560eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22570eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22580eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 22590eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 22600eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22610eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 22620eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 22630eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2264f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2265f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 22660eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 226748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 226848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2269f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2270f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 227148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2272f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2273f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 227448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2275f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2276f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 227748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2278e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2279e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2280e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2281e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2282e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2283e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2284e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 22850eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 22869d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 22877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 22887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 22890eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22900eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 22910eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 22920eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 22930eade319cdb72e24c11d068728a98083737c6435Chris Lattner 22943b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands/// ExtractGlobalVariable - If C is a global variable, or a bitcast of one 22953b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands/// (possibly constant folded), return it. Otherwise return NULL. 22963b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sandsstatic GlobalVariable *ExtractGlobalVariable (Constant *C) { 22973b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (GlobalVariable *GV = dyn_cast<GlobalVariable>(C)) 22983b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return GV; 22993b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 23003b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (CE->getOpcode() == Instruction::BitCast) 23013b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return dyn_cast<GlobalVariable>(CE->getOperand(0)); 23023b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands else if (CE->getOpcode() == Instruction::GetElementPtr) { 23033b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i) 23043b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands if (!CE->getOperand(i)->isNullValue()) 23053b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return NULL; 23063b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return dyn_cast<GlobalVariable>(CE->getOperand(0)); 23073b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands } 23083b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands } 23093b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands return NULL; 23103b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands} 23113b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2312f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2313f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// or eh.filter call, and add them to the specified machine basic block. 2314f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2315f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2316f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2317f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2318f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2319f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2320f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2321f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2322f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2323f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2324f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2325f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2326f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (unsigned i = 3, N = I.getNumOperands(); i < N; ++i) { 2327f40708223e409a152834b1553c6883ff2035b957Duncan Sands Constant *C = cast<Constant>(I.getOperand(i)); 2328f40708223e409a152834b1553c6883ff2035b957Duncan Sands GlobalVariable *GV = ExtractGlobalVariable(C); 2329f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert (GV || isa<ConstantPointerNull>(C) && 2330f40708223e409a152834b1553c6883ff2035b957Duncan Sands "TypeInfo must be a global variable or NULL"); 2331f40708223e409a152834b1553c6883ff2035b957Duncan Sands TyInfo.push_back(GV); 2332f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2333f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I.getCalledFunction()->getIntrinsicID() == Intrinsic::eh_filter) 2334f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 2335f40708223e409a152834b1553c6883ff2035b957Duncan Sands else 2336f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2337f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2338f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2339e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng/// propagateEHRegister - The specified EH register is required in a successor 2340e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng/// of the EH landing pad. Propagate it (by adding it to livein) to all the 2341e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng/// blocks in the paths between the landing pad and the specified block. 2342e47c333a12094296e54571ed1ac511a04d74840dEvan Chengstatic void propagateEHRegister(MachineBasicBlock *MBB, unsigned EHReg, 2343e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng SmallPtrSet<MachineBasicBlock*, 8> Visited) { 2344e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (MBB->isLandingPad() || !Visited.insert(MBB)) 2345e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng return; 2346e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 2347e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng MBB->addLiveIn(EHReg); 2348e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(), 2349e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng E = MBB->pred_end(); PI != E; ++PI) 2350e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng propagateEHRegister(*PI, EHReg, Visited); 2351e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng} 2352e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 2353e47c333a12094296e54571ed1ac511a04d74840dEvan Chengstatic void propagateEHRegister(MachineBasicBlock *MBB, unsigned EHReg) { 2354e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng SmallPtrSet<MachineBasicBlock*, 8> Visited; 2355e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng propagateEHRegister(MBB, EHReg, Visited); 2356e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng} 2357e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 2358c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2359c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2360c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2361c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2362c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2363c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 23640eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 23650eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 23660eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 23670eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2368c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2369c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2370c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2371bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2372bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2373bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2374bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2375bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2376bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2377bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2378bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2379c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2380d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2381c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2382c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2383d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2384c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 238503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 238603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 238703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 238803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 238903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 239003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 239103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 239203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 239303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 239403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 239503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 239603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2397c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 239886cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 239944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 240043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 240144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2402bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 240336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2404bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2405bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2406bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2407ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 240844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2409ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 241043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 241143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2412bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2413bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2414ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2415bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 241686cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 241743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2418b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 241936ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 242043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 242144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 242243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 242344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 242444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 24251ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2426bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 242743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 242843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2429b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 243043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 243143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 243244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 243343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 243444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 243544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 24361ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2437bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 243843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 243943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2440b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 244143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 244243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 244344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 244443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 244544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 244644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 244744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 24481ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2449bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 245043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 245143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2452b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 245343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 245443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 245544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 245643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 245744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 24580892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2459bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 246044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 246143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 246243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 246343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 246443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2465c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2466b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2467e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (ExceptionHandling) { 2468e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (!CurMBB->isLandingPad() && TLI.getExceptionAddressRegister()) 2469e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng propagateEHRegister(CurMBB, TLI.getExceptionAddressRegister()); 24709fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 2471735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2472735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2473735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2474735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2475735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2476735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2477735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 24787a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 247964ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2480735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2481b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2482b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2483b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 24840b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_selector: 24850b4711bd94e0723735848ad999bccfb1fb61eeb9Jim Laskey case Intrinsic::eh_filter:{ 2486b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2487f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2488ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2489f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2490f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2491e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2492f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2493f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2494f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2495e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (TLI.getExceptionSelectorRegister()) 2496e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng propagateEHRegister(CurMBB, TLI.getExceptionSelectorRegister()); 2497e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2498735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2499735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 25006ad8256d769f352103b6101c7090e4bfc0389330Anton Korobeynikov SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2501735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2502735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2503735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2504735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2505735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2506735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 25077a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 25086ad8256d769f352103b6101c7090e4bfc0389330Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2509b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2510b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2511b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2512b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2513b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2514b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_typeid_for: { 2515b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2516735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2517735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2518735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 25193b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands Constant *C = cast<Constant>(I.getOperand(1)); 25203b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands GlobalVariable *GV = ExtractGlobalVariable(C); 2521398898cc6a4cba85d908444a2bb42b1a9fc3df2aDuncan Sands assert (GV || isa<ConstantPointerNull>(C) && 25223b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands "TypeInfo must be a global variable or NULL"); 25233b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2524735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 2525735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, DAG.getConstant(TypeID, MVT::i32)); 25267a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 25277a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey setValue(&I, DAG.getConstant(0, MVT::i32)); 2528b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2529b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2530b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2531b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2532b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 25330b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 25340b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2535c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2536c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2537c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2538c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 25396ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 25406ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 25416ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 25426ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 25436ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 25446ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 25456ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2546c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2547c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2548c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2549c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2550c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 25518b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2552bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2553f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2554f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2555f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 25568b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 25578b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 255851b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 25598b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2560c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 25613f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 2562f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 2563f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 2564f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 2565f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 2566f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 2567f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 25683f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 2569addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 2570a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 2571d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2572d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2573d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2574d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 2575a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 2576a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2577a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2578a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 2579a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2580a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2581a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2582a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2583a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2584c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2585a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2586a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 2587a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2588a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2589a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 2590a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2591a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2592a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2593a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2594a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2595c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2596a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2597a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 2598a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2599a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2600a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 2601a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer if (Ty < MVT::i32) 2602a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, result); 2603a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer else if (Ty > MVT::i32) 2604a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer result = DAG.getNode(ISD::TRUNCATE, MVT::i32, result); 2605a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2606c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2607a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2608140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2609bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2610f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2611f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2612140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2613140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2614140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2615140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 261639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 261739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 261839a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2619140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 262039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2621ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2622ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2623ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 262424e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner 262524e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 262624e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 262724e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 2628c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2629c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2630c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2631c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 26321da20a71d1bbabc472f281208be77475550be751Jim Laskeyvoid SelectionDAGLowering::LowerCallTo(Instruction &I, 26331da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, 26341da20a71d1bbabc472f281208be77475550be751Jim Laskey unsigned CallingConv, 26351da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2636070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov SDOperand Callee, unsigned OpIdx, 2637070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 26381da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2639735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 26405694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 2641070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2642070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 2643070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2644735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2645735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2646735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2647735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2648735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2649735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2650735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 26514fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands 26524fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands unsigned attrInd = i - OpIdx + 1; 26534fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::SExt); 26544fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isZExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ZExt); 26554fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isInReg = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::InReg); 26564fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSRet = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::StructRet); 2657735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2658735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2659735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 26609fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (ExceptionHandling && MMI) { 2661070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 2662070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 2663070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 2664070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2665070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(BeginLabel, MVT::i32))); 2666070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2667070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2668735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2669735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 267018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), 26711da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2672735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2673735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2674735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2675735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2676070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 26779fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands if (ExceptionHandling && MMI) { 2678070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 2679070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 2680070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 2681070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2682070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(EndLabel, MVT::i32))); 2683070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2684070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Inform MachineModuleInfo of range. 2685070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 2686070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2687735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2688735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2689735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 26901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 269164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2692c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 26935cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (F->isDeclaration()) 2694c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2695c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2696c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2697c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 2698c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 2699c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 2700a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 2701a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 2702a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2703a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 2704a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 2705a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 2706a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 2707a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 2708a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 2709a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 2710a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 2711a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 2712c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2713c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 2714c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2715c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2716c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 2717c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 2718c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2719c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 2720f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2721f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 272206a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2723c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2724f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 2725f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2726f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2727c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 2728f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 2729f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 273006a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 2731c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2732f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 2733f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 2734f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2735f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 2736c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 2737ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 2738ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 2739ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 2740c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2741edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 274264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 274364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 274464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 274564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 274664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 2747070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 27481da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 2749070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.getCallingConv(), 2750070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.isTailCall(), 2751070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov Callee, 2752070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1); 27531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 27541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2755735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2756b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromParts - Create a value that contains the 2757b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified legal parts combined into the value they represent. 2758b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 2759b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman const SDOperand *Parts, 2760b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts, 2761b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType PartVT, 2762b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType ValueVT, 2763b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE) { 2764b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 2765b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = Parts[0]; 2766b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2767b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the value was expanded, copy from the top part. 2768b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (NumParts > 1) { 2769b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(NumParts == 2 && 2770b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman "Cannot expand to more than 2 elts yet!"); 2771b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Hi = Parts[1]; 27729f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 2773b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2774864635ad7b3046d3042311423071152c613961deChris Lattner 2775b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Otherwise, if the value was promoted or extended, truncate it to the 2776b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // appropriate type. 2777b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (PartVT == ValueVT) 2778b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return Val; 2779864635ad7b3046d3042311423071152c613961deChris Lattner 2780b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::isVector(PartVT)) { 2781b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 2782b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 2783b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 27845df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 2785b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::isInteger(PartVT) && 2786b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::isInteger(ValueVT)) { 2787b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (ValueVT < PartVT) { 2788b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // For a truncate, see if we have any information to 2789b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // indicate whether the truncated bits will always be 2790b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // zero or sign-extension. 2791b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (AssertOp != ISD::DELETED_NODE) 2792b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(AssertOp, PartVT, Val, 2793b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getValueType(ValueVT)); 2794b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 2795b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else { 2796b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 2797b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2798b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2799b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2800b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::isFloatingPoint(PartVT) && 2801b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::isFloatingPoint(ValueVT)) 2802b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 2803b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2804b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::getSizeInBits(PartVT) == 2805b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::getSizeInBits(ValueVT)) 2806b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 2807b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2808b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(0 && "Unknown mismatch!"); 2809b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2810b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2811b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Handle a multi-element vector. 2812b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType IntermediateVT, RegisterVT; 2813b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumIntermediates; 2814b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = 2815b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getTargetLoweringInfo() 2816b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 2817b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegisterVT); 2818b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2819b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 2820b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 2821b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(RegisterVT == Parts[0].getValueType() && 2822b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman "Part type doesn't match part!"); 2823b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2824b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Assemble the parts into intermediate operands. 2825b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 2826b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (NumIntermediates == NumParts) { 2827b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the register was not expanded, truncate or copy the value, 2828b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // as appropriate. 2829b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumParts; ++i) 2830b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, PartVT, IntermediateVT); 2831b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else if (NumParts > 0) { 2832b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the intermediate type was expanded, build the intermediate operands 2833b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // from the parts. 2834b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(NumIntermediates % NumParts == 0 && 2835b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman "Must expand into a divisible number of parts!"); 2836b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned Factor = NumIntermediates / NumParts; 2837b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 2838b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 2839b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman PartVT, IntermediateVT); 2840cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 28415df99b376f38a2a0aaa2fc63254cf0306eef3c1bChris Lattner 2842b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 2843b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // operands. 2844b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(MVT::isVector(IntermediateVT) ? 2845b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::CONCAT_VECTORS : 2846b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::BUILD_VECTOR, 2847b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ValueVT, &Ops[0], NumParts); 2848864635ad7b3046d3042311423071152c613961deChris Lattner} 2849864635ad7b3046d3042311423071152c613961deChris Lattner 2850b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToParts - Create a series of nodes that contain the 2851b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value split into legal parts. 2852b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 2853b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val, 2854b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand *Parts, 2855b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts, 2856b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType PartVT) { 2857b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType ValueVT = Val.getValueType(); 2858b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2859b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 2860b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the value was expanded, copy from the parts. 2861b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (NumParts > 1) { 2862b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i < NumParts; ++i) 2863b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[i] = DAG.getNode(ISD::EXTRACT_ELEMENT, PartVT, Val, 2864b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getConstant(i, MVT::i32)); 2865b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return; 2866b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2867b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2868b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If there is a single part and the types differ, this must be 2869c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 2870b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (PartVT != ValueVT) { 2871b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::isVector(PartVT)) { 2872b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(MVT::isVector(ValueVT) && 28737f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman "Not a vector-vector cast?"); 2874b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 2875b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 2876b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (PartVT < ValueVT) 2877b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(ISD::TRUNCATE, PartVT, Val); 28780c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 2879b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(ISD::ANY_EXTEND, PartVT, Val); 2880b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else if (MVT::isFloatingPoint(PartVT) && 2881b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::isFloatingPoint(ValueVT)) { 2882b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 2883b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else if (MVT::getSizeInBits(PartVT) == 2884b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::getSizeInBits(ValueVT)) { 2885b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 28861a6acc214dc066ea08365b605e109203e9164068Chris Lattner } else { 28871a6acc214dc066ea08365b605e109203e9164068Chris Lattner assert(0 && "Unknown mismatch!"); 28881a6acc214dc066ea08365b605e109203e9164068Chris Lattner } 2889c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2890b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[0] = Val; 2891b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return; 2892b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2893b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2894b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Handle a multi-element vector. 2895b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType IntermediateVT, RegisterVT; 2896b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumIntermediates; 2897b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = 2898b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getTargetLoweringInfo() 2899b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 2900b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegisterVT); 2901b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 2902b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2903b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 2904b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 2905b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2906b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Split the vector into intermediate operands. 2907b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 2908b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 2909b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (MVT::isVector(IntermediateVT)) 2910b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 2911b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman IntermediateVT, Val, 2912b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 2913b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::i32)); 2914b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman else 2915b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2916b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman IntermediateVT, Val, 2917b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getConstant(i, MVT::i32)); 2918b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2919b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Split the intermediate operands into legal parts. 2920b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (NumParts == NumIntermediates) { 2921b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the register was not expanded, promote or copy the value, 2922b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // as appropriate. 2923b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumParts; ++i) 2924b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 2925b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } else if (NumParts > 0) { 2926b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If the intermediate type was expanded, split each the value into 2927b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // legal parts. 2928b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman assert(NumParts % NumIntermediates == 0 && 2929b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman "Must expand into a divisible number of parts!"); 2930b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned Factor = NumParts / NumIntermediates; 2931b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 2932b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 2933b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2934b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 2935b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2936b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2937b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 2938b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 2939b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 2940b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 2941b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 2942b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag)const{ 2943b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of registers, in the appropriate order. 2944b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> R(Regs); 2945b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 2946b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::reverse(R.begin(), R.end()); 2947b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2948b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the legal parts from the registers. 2949b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 2950b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 2951b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 2952b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 2953b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT, *Flag) : 2954b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT); 2955b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(1); 2956b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 2957b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(2); 2958b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[i] = Part; 2959b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 2960b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2961b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Assemble the legal parts into the final value. 2962b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return getCopyFromParts(DAG, &Parts[0], NumParts, RegVT, ValueVT); 2963b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 2964b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2965b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 2966b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 2967b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 2968b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 2969b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 2970b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 2971b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of registers, in the appropriate order. 2972b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> R(Regs); 2973b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 2974b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::reverse(R.begin(), R.end()); 2975b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2976b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 2977b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 2978b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 2979b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman getCopyToParts(DAG, Val, &Parts[0], NumParts, RegVT); 2980b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 2981b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 2982b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 2983b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 2984b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyToReg(Chain, R[i], Parts[i], *Flag) : 2985b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyToReg(Chain, R[i], Parts[i]); 2986b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(0); 2987b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 2988b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 2989c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2990c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 2991864635ad7b3046d3042311423071152c613961deChris Lattner 2992c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 2993c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 2994c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 2995c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 29969f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 29974b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 29984b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 2999c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 3000c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 3001c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3002864635ad7b3046d3042311423071152c613961deChris Lattner 3003864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3004864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3005864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3006864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 30079b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 30089b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 3009f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3010f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 30119b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 30129b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 3013f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3014f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 30159b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 30169b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 30179b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 30189b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 30199b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 30209b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3021f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3022f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3023f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3024f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3025f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3026f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3027f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3028f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 30299b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 30309b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 30319b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3032f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 30339b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3034864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3035864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3036864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3037864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 30389b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 30399b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3040f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3041f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3042f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3043f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3044f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3045f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3046f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3047864635ad7b3046d3042311423071152c613961deChris Lattner } 3048f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3049864635ad7b3046d3042311423071152c613961deChris Lattner} 3050864635ad7b3046d3042311423071152c613961deChris Lattner 3051bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3052bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3053bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3054bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 3055bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstruct AsmOperandInfo : public InlineAsm::ConstraintInfo { 3056bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintCode - This contains the actual string for the code, like "m". 3057bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string ConstraintCode; 3058bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3059bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintType - Information about the constraint code, e.g. Register, 3060bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// RegisterClass, Memory, Other, Unknown. 3061bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ConstraintType; 3062bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3063bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallOperand/CallOperandval - If this is the result output operand or a 3064bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// clobber, this is null, otherwise it is the incoming operand to the 3065bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallInst. This gets modified as the asm is processed. 3066bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 3067bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Value *CallOperandVal; 3068bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3069bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintVT - The ValueType for the operand value. 3070bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ConstraintVT; 3071bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3072e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3073e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3074e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3075e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3076bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner AsmOperandInfo(const InlineAsm::ConstraintInfo &info) 3077bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner : InlineAsm::ConstraintInfo(info), 3078bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType(TargetLowering::C_Unknown), 3079bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CallOperand(0,0), CallOperandVal(0), ConstraintVT(MVT::Other) { 3080bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3081bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3082bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner void ComputeConstraintToUse(const TargetLowering &TLI); 3083e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3084e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3085e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3086e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3087e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 3088e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs) const { 3089e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isOutReg) 3090e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OutputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3091e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isInReg) 3092e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner InputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3093e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3094bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3095bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3096bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3097bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 3098bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 3099bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner switch (CT) { 3100bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner default: assert(0 && "Unknown constraint type!"); 3101bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Other: 3102bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Unknown: 3103bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 0; 3104bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Register: 3105bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 1; 3106bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_RegisterClass: 3107bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 2; 3108bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Memory: 3109bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 3; 3110bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3111bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3112bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3113bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnervoid AsmOperandInfo::ComputeConstraintToUse(const TargetLowering &TLI) { 3114bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner assert(!Codes.empty() && "Must have at least one constraint"); 3115bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3116bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string *Current = &Codes[0]; 3117bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current); 3118bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (Codes.size() == 1) { // Single-letter constraints ('r') are very common. 3119bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3120bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3121bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return; 3122bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3123bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3124bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned CurGenerality = getConstraintGenerality(CurType); 3125bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3126bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 3127bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 3128bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner for (unsigned j = 1, e = Codes.size(); j != e; ++j) { 3129bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]); 3130bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned ThisGenerality = getConstraintGenerality(ThisType); 3131bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (ThisGenerality > CurGenerality) { 3132bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // This constraint letter is more general than the previous one, 3133bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // use it. 3134bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurType = ThisType; 3135bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Current = &Codes[j]; 3136bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurGenerality = ThisGenerality; 3137bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3138bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3139bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3140bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3141bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3142bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3143bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3144bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3145e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 3146e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris LattnerGetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 3147864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 31484e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3149e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3150e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3151e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3152e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3153e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3154e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3155e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3156e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3157e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3158e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3159e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3160e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3161e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3162e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3163e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3164e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3165e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3166e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3167e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3168e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3169e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3170e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3171e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3172e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3173e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3174864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3175e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3176e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3177e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3178e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3179e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3180e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3181864635ad7b3046d3042311423071152c613961deChris Lattner 3182bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3183bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3184b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3185864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3186bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3187864635ad7b3046d3042311423071152c613961deChris Lattner 3188bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 31892a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 31902a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3191864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3192bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3193864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3194cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3195cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3196cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3197cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3198cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3199864635ad7b3046d3042311423071152c613961deChris Lattner 3200864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3201864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3202864635ad7b3046d3042311423071152c613961deChris Lattner 3203864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3204864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3205864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3206864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3207864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3208864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3209864635ad7b3046d3042311423071152c613961deChris Lattner 3210864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3211864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3212864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3213864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3214864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3215864635ad7b3046d3042311423071152c613961deChris Lattner } 3216864635ad7b3046d3042311423071152c613961deChris Lattner } 3217e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3218e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3219e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3220864635ad7b3046d3042311423071152c613961deChris Lattner } 3221864635ad7b3046d3042311423071152c613961deChris Lattner 32222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 32232a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 32242a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3225c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3226c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 32272a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 32282a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 32292a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3230e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3231e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3232e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3233e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3234e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 32352a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 32363a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3237bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 32383a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 32392a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32402a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 3241bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SSARegMap *RegMap = MF.getSSARegMap(); 32422a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 32432a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 32442a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 3245e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3246e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3247e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 32482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 32492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 32512a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 32522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 32532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 32542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 32552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 32562a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 32572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3258bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3259bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 32602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3261e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 32624e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 3263864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3264864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3265864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 32664e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3267864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3268864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3269864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3270864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3271864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3272864635ad7b3046d3042311423071152c613961deChris Lattner } 3273864635ad7b3046d3042311423071152c613961deChris Lattner 32744e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 32754e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3276c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 3277c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner RC = isAllocatableRegister(Reg, MF, TLI, MRI); 3278c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3279c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3280c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3281c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3282c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 32834e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 32844e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3285864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3286864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3287864635ad7b3046d3042311423071152c613961deChris Lattner 3288e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3289864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3290864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3291864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3292864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3293e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3294e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3295864635ad7b3046d3042311423071152c613961deChris Lattner 3296e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(), 3297e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3298e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3299e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3300864635ad7b3046d3042311423071152c613961deChris Lattner } 33014e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3302864635ad7b3046d3042311423071152c613961deChris Lattner 3303864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3304e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 33054e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 33064e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 33073ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3308ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3309ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3310ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 3311ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 3312ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 33130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 33140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<AsmOperandInfo> ConstraintOperands; 3315ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3316ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3317ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3318ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 33194e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 33200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 33210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 33220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 33230c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 33240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3325e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3326e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3327e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3328e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3329e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3330e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3331e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner unsigned OpNo = 1; // OpNo - The operand of the CallInst. 33320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 33330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i])); 33340c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands.back(); 33350c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 33360c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 33371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 33380c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 33390c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 33401efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 33410c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 33420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // The return value of the call is this value. As such, there is no 33430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // corresponding argument. 33441efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 33451efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 33461efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 33470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 33481efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 33491efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 33510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 33521efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33531efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 33540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 33551efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 33561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 33570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 33580c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 33590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 33600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 33610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner const Type *OpTy = OpInfo.CallOperandVal->getType(); 33626995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If this is an indirect operand, the operand is a pointer to the 33636995cf6015580eeab07a1c671fca180084a1325eChris Lattner // accessed type. 33646995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (OpInfo.isIndirect) 33656995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = cast<PointerType>(OpTy)->getElementType(); 33666995cf6015580eeab07a1c671fca180084a1325eChris Lattner 33676995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If OpTy is not a first-class value, it may be a struct/union that we 33686995cf6015580eeab07a1c671fca180084a1325eChris Lattner // can tile with integers. 33696995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (!OpTy->isFirstClassType() && OpTy->isSized()) { 33706995cf6015580eeab07a1c671fca180084a1325eChris Lattner unsigned BitSize = TD->getTypeSizeInBits(OpTy); 33716995cf6015580eeab07a1c671fca180084a1325eChris Lattner switch (BitSize) { 33726995cf6015580eeab07a1c671fca180084a1325eChris Lattner default: break; 33736995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 1: 33746995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 8: 33756995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 16: 33766995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 32: 33776995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 64: 33786995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = IntegerType::get(BitSize); 33796995cf6015580eeab07a1c671fca180084a1325eChris Lattner break; 33806995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 33810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 33826995cf6015580eeab07a1c671fca180084a1325eChris Lattner 33836995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpVT = TLI.getValueType(OpTy, true); 33840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 33851efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 33860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 33872a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 33883ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 33893ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 33901efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3391e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3392e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 339309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 339409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 339509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 339609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 339709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 339809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 339909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 340009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 340109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 340209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 340309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 340409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 340509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 340609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 340709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 340809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 340909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 341009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 341109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 341209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 341309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 341409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 341509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 341609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 341709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 341809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 341909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 342009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 342109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 342209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 342309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 342409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 342509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 342609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 342709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 342809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 342909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 343009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3431e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3432e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3433e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3434e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 34350c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 34360c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 34370c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34380c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3439e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3440e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3441e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 3442e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 3443e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3444e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3445e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3446e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3447e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3448e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3449e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 34500c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 34510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 34520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 34530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 34540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 34550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34562cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 34570f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 34580f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3459864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 34600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3462864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 34630f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 34640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 34650c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 34661efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 34670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 34682cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3469c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3470c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3471f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 347209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 347322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 347422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 347522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3476c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3477c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 347809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 347922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 348022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 348122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 34822a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 348322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3484864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3485864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3486e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3487832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 34880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3489d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3490d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 34912cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 34920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 34930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3494864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 34952cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 34962cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3497e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 34982cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3499e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 35000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 35012cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 35026656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 35036656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 35046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3505e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3506e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 35076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 35086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 35096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 35100c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 35113d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 35120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 35132223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 35142223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 35150c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 35163d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3517c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3518c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3519c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3520c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3521c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3522c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3523c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3524a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3525a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3526c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3527c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3528c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3529c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3530c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3531c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3532527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3533527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3534527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3535527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3536527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3537527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3538527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3539527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3540527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3541527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3542c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3543527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3544b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 3545527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3546527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3547527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3548527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3549527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3550c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 355187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 355287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 35532a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 35540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 355544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 355644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 355753069fbbae2558a3138df24776448791fea3aceeChris Lattner InOperandVal = TLI.isOperandValidForConstraint(InOperandVal, 35580c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintCode[0], 35590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG); 356053069fbbae2558a3138df24776448791fea3aceeChris Lattner if (!InOperandVal.Val) { 3561832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 35620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 356353069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 356453069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3565c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 356687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 356787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 3568c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3569c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 357087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 357187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 35722a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 357309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 357444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 357544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 357644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 357787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 357887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3579c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3580c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 358187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3582c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 35832223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 358487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 35852a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 35862a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 35872a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 35880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 358944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 359087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 359187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3592e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3593e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 359487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3595b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 359687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3597e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3598e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 35996656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 36006656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3601c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3602c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3603c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3604e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3605e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3606e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 36076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 36086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3609c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 36106656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3611ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3612ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3613ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3614ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3615ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3616f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3617f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3618bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3619ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3620ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 36226656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 36233a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 3624b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 36253a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 36263a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 36273a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 36287f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 36297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 36303a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner const VectorType *VTy = cast<VectorType>(I.getType()); 36317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 36323a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 36337f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 36343a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 36353a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 36363a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner setValue(&I, Val); 36373a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 36386656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36396656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 36406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 36426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 36436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3644864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 36456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3646b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 3647864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 36486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3649ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36506656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3651bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 36526656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 36530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 36546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 36558b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 36566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3657bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3658bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3659ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3660ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3661ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3662ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 36641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 36651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 366768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 366868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 366968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 367068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 367168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 36721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3674a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 36751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 36761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 36771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 367847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 367947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 368047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 368147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 368247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3683cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3684cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 368547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3686cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3687cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3688cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3689cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 36901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 36911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 369347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 369447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 369547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 369647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 369747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 36981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3699cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 370047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3701cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3702cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 37031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3705025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3706025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3707025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3708025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3709025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3710025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3711025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3712832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3713832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3714832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3715025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3716025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3717025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3718025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 371939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3720acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3721acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3722acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 372339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 372439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 37251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3726acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3727acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3728acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3729acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3730acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 37311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3734acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3735acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3736acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 37371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3740acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3741acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3742acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3743acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3744acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 37451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3747b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarFormalArgs - Recursively expand the formal_argument node, either 3748b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_convert it or join a pair of them with a BUILD_PAIR when appropriate. 3749b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic SDOperand ExpandScalarFormalArgs(MVT::ValueType VT, SDNode *Arg, 3750b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned &i, SelectionDAG &DAG, 3751b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng TargetLowering &TLI) { 3752b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) 3753b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(Arg, i++); 3754b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3755b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3756b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3757b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3758b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BIT_CONVERT, VT, 3759b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI)); 3760b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3761b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3762b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = ExpandScalarFormalArgs(EVT, Arg, i, DAG, TLI); 3763b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3764b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 3765b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi); 3766b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3767b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3768b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3769b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3770b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return SDOperand(); 3771b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3772b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3773fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3774fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3775f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3776f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3777fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3778fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3779b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 37805694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 3781fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3782fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 37838c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3784fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3785fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3786fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3787fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3788fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 37896aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3790ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3791ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3792fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3793d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 37947aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3795d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 37967aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3797ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3798ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 379918da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt)) 3800d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 380118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt)) 3802d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 380318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg)) 3804d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 380518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet)) 3806d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3807d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3808ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3809fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3810fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3811fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3812fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3813b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3814fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3815fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3816fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3817b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3818fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3819b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman case Expand: { 3820b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If this is an illegal type, it needs to be broken up to fit into 3821b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // registers. 3822b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 3823b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 3824b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3825b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetVals.push_back(RegisterVT); 3826b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // if it isn't first piece, alignment must be 1 3827b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (i > 0) 3828b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3829b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 3830b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3831fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3832fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3833fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3834b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3835fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 38363b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 38378c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3838fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3839fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3840f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3841f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3842bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 38438c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 38448c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 3845fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3846fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3847fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3848fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 384947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 385047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 385147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3852fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3853fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3854fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3855fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3856fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3857fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3858fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3859fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3860fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3861fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 386218da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt)) 3863f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3864f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 386518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt)) 3866f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3867f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3868fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3869fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3870fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3871fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3872fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3873fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3874fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3875fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3876fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 38777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (!MVT::isVector(VT)) { 3878b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // If this is a large integer or a floating point node that needs to be 3879b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // expanded, it needs to be reassembled from small integers. Figure out 3880b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // what the source elt type is and how many small integers it is. 3881b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(ExpandScalarFormalArgs(VT, Result, i, DAG, *this)); 3882fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3883fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 3884fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 38859d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(I->getType()); 3886020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 3887020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 3888f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3889fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 3890ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 38917f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType TVT = 38927f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getVectorType(getValueType(EltTy), NumElems); 3893d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 3894020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 38957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Handle copies from vectors to registers. 38967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman N = DAG.getNode(ISD::BIT_CONVERT, TVT, N); 3897d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 3898d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 3899fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 3900da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 3901fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3902fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3903fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3904fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3905fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3906fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3907fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3908fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3909f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3910b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// ExpandScalarCallArgs - Recursively expand call argument node by 3911b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng/// bit_converting it or extract a pair of elements from the larger node. 3912b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Chengstatic void ExpandScalarCallArgs(MVT::ValueType VT, SDOperand Arg, 39137aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned Flags, 3914b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SmallVector<SDOperand, 32> &Ops, 3915b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SelectionDAG &DAG, 39167aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio TargetLowering &TLI, 39177aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio bool isFirst = true) { 39187aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3919b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (TLI.getTypeAction(VT) != TargetLowering::Expand) { 3920cf8270a9941e697243bb9c91d5d8b2e1fc01a35cLauro Ramos Venancio // if it isn't first piece, alignment must be 1 39217aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio if (!isFirst) 3922d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3923d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov (1 << ISD::ParamFlags::OrigAlignmentOffs); 3924b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Ops.push_back(Arg); 3925b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3926b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng return; 3927b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3928b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3929b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng MVT::ValueType EVT = TLI.getTypeToTransformTo(VT); 3930b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng unsigned NumVals = MVT::getSizeInBits(VT) / MVT::getSizeInBits(EVT); 3931b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (NumVals == 1) { 3932b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng Arg = DAG.getNode(ISD::BIT_CONVERT, EVT, Arg); 39337aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Arg, Flags, Ops, DAG, TLI, isFirst); 3934b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else if (NumVals == 2) { 3935b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3936b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(0, TLI.getPointerTy())); 3937b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, EVT, Arg, 3938b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng DAG.getConstant(1, TLI.getPointerTy())); 3939b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng if (!TLI.isLittleEndian()) 3940b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng std::swap(Lo, Hi); 39417aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Lo, Flags, Ops, DAG, TLI, isFirst); 39427aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio ExpandScalarCallArgs(EVT, Hi, Flags, Ops, DAG, TLI, false); 3943b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } else { 3944b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng // Value scalarized into many values. Unimp for now. 3945b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng assert(0 && "Cannot expand i64 -> i16 yet!"); 3946b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng } 3947b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng} 3948b15974a65ce3c5d5cdde8d5e524055d3f1d59a77Evan Cheng 3949f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3950f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3951f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3952f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3953f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 395447857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 395547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3956f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3957f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3958f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3959be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3960f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 3961f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 3962f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 3963f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 3964f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 3965f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3966f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 3967f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 396847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 396947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 3970d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 39717aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3972d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 39730db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3974d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3975d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 3976d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 3977d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 39780db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 3979d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 39800db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 3981d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3982d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 39830db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 3984f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 3985f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 39867aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 3987f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 3988b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3989f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 3990f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 3991f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 3992d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 3993d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 3994d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 3995d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 3996d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 3997d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 3998d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 3999f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 4000f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4001f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 400262000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // A true promotion would change the size of the argument. 400362000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // Instead, pretend this is an int. If FP objects are not 400462000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // passed the same as ints, the original type should be Legal 400562000eee7de696cad5e3a307de395c77a61350eeDale Johannesen // and we should not get here. 400662000eee7de696cad5e3a307de395c77a61350eeDale Johannesen Op = DAG.getNode(ISD::BIT_CONVERT, 400762000eee7de696cad5e3a307de395c77a61350eeDale Johannesen VT==MVT::f32 ? MVT::i32 : 400862000eee7de696cad5e3a307de395c77a61350eeDale Johannesen (VT==MVT::f64 ? MVT::i64 : 400962000eee7de696cad5e3a307de395c77a61350eeDale Johannesen MVT::Other), 401062000eee7de696cad5e3a307de395c77a61350eeDale Johannesen Op); 4011f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4012f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4013b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4014f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4015f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 40167f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (!MVT::isVector(VT)) { 4017f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 4018f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 4019f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 4020b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov ExpandScalarCallArgs(VT, Op, Flags, Ops, DAG, *this); 4021f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4022da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 4023da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 40249d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(Args[i].Ty); 4025da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 4026da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 4027da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 4028da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 4029ac9dcb94dde5f166ee29372385c0e3b695227ab4Reid Spencer // type. If so, convert to the vector type. 40307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType TVT = 40317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getVectorType(getValueType(EltTy), NumElems); 40321b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 40337f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Insert a BIT_CONVERT of the original type to the vector type. 40347f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Op = DAG.getNode(ISD::BIT_CONVERT, TVT, Op); 40351b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 4036b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 40371b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 4038da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 4039da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 4040da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 4041f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4042f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4043f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4044f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4045f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4046f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 4047b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType VT = getValueType(RetTy); 4048b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4049b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4050b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<MVT::ValueType, 4> RetTys(NumRegs); 4051b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4052b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetTys[i] = RegisterVT; 4053f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 4055f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4056b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4057be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4058b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getVTList(&RetTys[0], NumRegs + 1), 4059be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4060b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = Res.getValue(NumRegs); 4061b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4062b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4063b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 4064b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::NodeType AssertOp = ISD::AssertSext; 4065b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!RetTyIsSigned) 4066b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 4067b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 4> Results(NumRegs); 4068b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4069b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Results[i] = Res.getValue(i); 4070b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Res = getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, AssertOp); 4071f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4072b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4073b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4074f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4075f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 407650381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4077171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4078171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4079d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4080171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4081171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 40820aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 40830aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 40840aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 40850aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 40860aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 40870aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 40880aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 408974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 40901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 40911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 4092a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 40931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 40941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 40951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 40961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 40971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 40981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 40991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 41031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 41051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 41081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 41091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 41101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 41111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 41161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 411974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 412074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 412174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 412274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 412374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 412474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 412574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 4126b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned MSB = MVT::getSizeInBits(VT) / 8; 412774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 412874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 412974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4130a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 413174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 413274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 413374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 413474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 413574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 41361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 41371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 41381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 41391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 41401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 41411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4143c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 414480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 414580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4146c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4147c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4148c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 41491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 41501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 41521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 41551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 41561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 41591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 41601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 41621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 41631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 41651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 41661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 417080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 417180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 417280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 417380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 41741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 417580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 417680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 417780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4178dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 41791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 4180b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 41811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 41821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 41831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 41841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 418580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 418680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 418780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 418880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 41891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 41901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 41911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 419280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 419380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 41941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41967041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 41971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 41981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 41991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 42001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 42011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 42021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 42031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 42051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 42061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 42081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4209bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 42101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4211ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 42121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4213c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4214c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 421580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 42161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 42171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 42181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 4219b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 4220a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4221786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4222864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 42238b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4224c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4225c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4226c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4227c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4228c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4229c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4230c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4231c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4232c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4233c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4234cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 423574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 423674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4237cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 423874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 423974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 424074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 424174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 424274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 424374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 424474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4245cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 424674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 424774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 424874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4249f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 42500937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4251cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4252cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4253cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4254cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4255cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 425674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 425774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4258c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4259c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4260b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 426174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 426274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4263cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 426474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 426574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 426674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4267786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4268786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 42698b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 427074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 427174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 427274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4273466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 427474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 427574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4276786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4277786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 42788b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 427974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4280c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 428174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 428274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 42831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4285c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 42861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4288c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4289c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4290bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4291bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4292c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4293c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 42941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4296bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 42971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42997041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43007041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43017041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 43041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 43051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4307495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4308c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4309c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4310495a0b51915eb763576874f29192820b731edc22Chris Lattner} 43111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4312c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4313bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 43141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 43151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 43161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4317832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 43181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 43201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4321ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling) 4322ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 4323ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 4324ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands // Mark landing pad. 4325ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 43269fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 43279fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 43281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4329edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4330ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4331ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4332ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4333ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4334ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4335ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4336ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4337ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4338f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4339f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4340f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4341f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4342f40708223e409a152834b1553c6883ff2035b957Duncan Sands 43431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 43441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4346571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4347571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4348571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 434918c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4350d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 435118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4352d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4353d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4354b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT); 4355b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(SrcVT); 4356b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Regs(NumRegs); 4357b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 4358b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4359b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the value by legal parts into sequential virtual registers. 4360b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT); 4361b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i < NumRegs; ++i) 4362b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chains[i] = DAG.getCopyToReg(getRoot(), Reg + i, Regs[i]); 4363b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 43641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4366068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 436715699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4368068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 43691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 437015699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 43710afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4372bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4373bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4374bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4375bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4376bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4377bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4378bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4379bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4380f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4381bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4382bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4383251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4384251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4385251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4386bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4387bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 43880afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4389bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4390bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4391966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4392bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4393068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4394068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4395f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4396f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4397f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(!FLI.MBBMap[SrcBB]->isLandingPad() && 4398f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Copying catch info out of a landing pad!"); 4399f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4400f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (isFilterOrSelector(I)) { 4401f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4402f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4403f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4404f40708223e409a152834b1553c6883ff2035b957Duncan Sands FLI.CatchInfoFound.insert(I); 4405f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4406f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4407f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4408f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4409068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4410068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4411f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4412068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 4413068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4414068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4415edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4416bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4417ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4418bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 44191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 44211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 44221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4423f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 44249fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 4425f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (ExceptionHandling && MMI && BB->isLandingPad()) { 4426f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4427f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4428f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4429f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4430f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.getConstant(LabelID, MVT::i32))); 4431f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4432e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4433e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4434e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4435e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4436e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4437e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4438e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4439e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4440f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4441f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4442f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4443f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4444f40708223e409a152834b1553c6883ff2035b957Duncan Sands // information is provided by intrinsics (eh.filter and eh.selector) that 4445f40708223e409a152834b1553c6883ff2035b957Duncan Sands // can be moved to unexpected places by the optimizers: if the unwind edge 4446f40708223e409a152834b1553c6883ff2035b957Duncan Sands // is critical, then breaking it can result in the intrinsics being in the 4447f40708223e409a152834b1553c6883ff2035b957Duncan Sands // successor of the landing pad, not the landing pad itself. This results 4448f40708223e409a152834b1553c6883ff2035b957Duncan Sands // in exceptions not being caught because no typeids are associated with 4449f40708223e409a152834b1553c6883ff2035b957Duncan Sands // the invoke. This may not be the only way things can go wrong, but it 4450f40708223e409a152834b1553c6883ff2035b957Duncan Sands // is the only way we try to work around for the moment. 4451f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4452f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4453f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4454f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4455f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4456f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (isFilterOrSelector(I)) 4457f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4458f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4459f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4460f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4461f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 44629fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 44639fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 44649fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 44651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 44661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 44671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 44681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4469f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 44701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4471f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 44721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4473f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 44749f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 44751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4476ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4477571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 44781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 44791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 44811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 44821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 44831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 44841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 44851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4486edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 44878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 44881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 44901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4491d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 44928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 44938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 44948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 44958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 44968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 44971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 44981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 44991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 45001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4501d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 45028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4503d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 45058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 45068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 45078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 45088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 45098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 45111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 45121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 45141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 45151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 45161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 45178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 45188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 45198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 45208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 45228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 45233f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 45248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 45258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 45268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 45278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 45288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 45298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 45301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 45328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 45338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 45348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 45358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 45368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 45378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 45388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 45398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 45408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 45417e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 45421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 45458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 45468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 45477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4548b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 45498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 45508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 45511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 45531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4554ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 45555a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 45567436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 45577436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 45587436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 45597436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 45607436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 45617436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 45627436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 45637436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 45647436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 45657436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 45667436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 45677436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4568bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4569bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4570ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4571ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 45721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4573f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4574a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4575f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 457637efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4577f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4578f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 45793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 45803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 45814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 45824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 45834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4584a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4585a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 45861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4588f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4589c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey // Get alias analysis for load/store combining. 4590c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); 4591c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey 4592af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 4593c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(false, AA); 45942300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4595832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 45961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4597f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 45991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4600ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4601f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4602832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 46031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4604f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4605af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 4606c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey DAG.Combine(true, AA); 46072300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4608a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4609552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4610a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4611a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 46121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4613f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4614832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 46151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4616f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4617f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4618f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4619f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4620f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 462244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4623f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4624f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4625f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4627f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 46281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4629f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4630f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4631f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 46324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 46344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 46354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 46364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 46374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4638f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4639a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 46401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 46414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4642f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4643f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4644f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4645f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 464609e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4647f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4648f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4649f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 46501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 46534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 46544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 46554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 46564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 46574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 46584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 46594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 46604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 46614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 46624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 46634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 46644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 46654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 46684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 46694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 46704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGLowering BSDL(BSDAG, TLI, FuncInfo); 46714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 46724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 46734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 46744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 46754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 46764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 46774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 46784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 46794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 46804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 46814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 46824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 46834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 46864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 46874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 46884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 46904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 46914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 46924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 46934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 46944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 46954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 46964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 46974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 46984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 46994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent); 47008085bcfdca515a359c746ea475a3b8e9cac1c077Anton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB); 47024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 47044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 47064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 47074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 47084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(cBB); 47104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47159453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 47169453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 47179453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 47183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 47193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 47203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 47213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 47233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering HSDL(HSDAG, TLI, FuncInfo); 47243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 47263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 47283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 47293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 47333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 47353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGLowering JSDL(JSDAG, TLI, FuncInfo); 473637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 47373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 47383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 473937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 47403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 47413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 47423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 47433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 474437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 474537efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 474637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 474737efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 474837efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 474937efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 47504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 47513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 475209e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4754f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 47554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4756f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 475709e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4758f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 475937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 476037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 476137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 476237efe6764568a3829fee26aba532283131d1a104Nate Begeman 4763b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4764b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4765b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4766b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4767b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4768b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4769b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4770b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4771b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4772b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4773b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4774b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4775f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4776f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4777d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 477844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4779f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4780f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 4781d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4782f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4783f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4784f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4785d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4786f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4787f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4788f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4789f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4790d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4791d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4792d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4793d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4794d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 479557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4796d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4797d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4798d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4799d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4800d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4801d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4802d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4803d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4804d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4805d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4806d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4807f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4808d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4809d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 481057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 481157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4812d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4813d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 48142452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 481557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4816f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 481757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4818a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 48191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4820a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 482113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4822a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4823a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4824a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4825a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4826a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 482713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4828eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 482913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 483013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4831eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 48329373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 48334ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 483413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 48359ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4836a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 4837cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4838a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 48390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 484003fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 48419ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 48429ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 48439ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 48449ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4845755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4846755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4847755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4848755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4849755480681c795d585c73556c028b6143c46bda86Chris Lattner 4850755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4851755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4852755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4853755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4854755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4855755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4856755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4857755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4858755480681c795d585c73556c028b6143c46bda86Chris Lattner 4859755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4860755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4861755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4862755480681c795d585c73556c028b6143c46bda86Chris Lattner 4863755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4864755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4865755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4866755480681c795d585c73556c028b6143c46bda86Chris Lattner 4867755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4868755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4869755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4870ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 4871755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4872755480681c795d585c73556c028b6143c46bda86Chris Lattner 4873755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4874755480681c795d585c73556c028b6143c46bda86Chris Lattner 4875755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4876755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4877755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4878755480681c795d585c73556c028b6143c46bda86Chris Lattner 4879755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4880755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4881755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4882755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4883755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4884755480681c795d585c73556c028b6143c46bda86Chris Lattner int64_t DesiredMaskS) { 4885755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4886755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4887755480681c795d585c73556c028b6143c46bda86Chris Lattner 4888755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4889755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4890755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4891755480681c795d585c73556c028b6143c46bda86Chris Lattner 4892755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4893755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4894755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4895755480681c795d585c73556c028b6143c46bda86Chris Lattner 4896755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4897755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4898755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4899755480681c795d585c73556c028b6143c46bda86Chris Lattner 4900755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4901ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4902755480681c795d585c73556c028b6143c46bda86Chris Lattner 4903755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4904755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4905755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4906755480681c795d585c73556c028b6143c46bda86Chris Lattner 4907755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4908755480681c795d585c73556c028b6143c46bda86Chris Lattner 4909755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4910755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4911755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4912755480681c795d585c73556c028b6143c46bda86Chris Lattner 49139ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 49140e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 49150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 49160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 49170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 49180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 49190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 49200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 49220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 49230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 49250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 49260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 49270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 49290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 49300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 49310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 49320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 49330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 49340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 49350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 49360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 49370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 49380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 4939832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 49400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 49410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 49444b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 494536d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 49464b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 49470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 49480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 49490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 49530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 49540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 49550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 4956794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 49571997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 4958