SelectionDAGISel.cpp revision 984e986929c34f9fa41ad33e3a4f19816f80c1ad
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")); 573e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 583e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 593e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman cl::desc("Pop up a window to show SUnit dags after they are processed")); 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 613e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0; 627944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 637944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 77eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 78eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 79e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen ISHeuristic("pre-RA-sched", 803700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 81e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen cl::desc("Instruction schedulers available (before register allocation):")); 8213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 839ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 849373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 859373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 864ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 874ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 88bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { struct AsmOperandInfo; } 89bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 90864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 91864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 92864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 93864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 94864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 959525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 96b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// Regs - This list holds the register (for legal and promoted values) 97864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 98864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 99864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 100864635ad7b3046d3042311423071152c613961deChris Lattner 101864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 102864635ad7b3046d3042311423071152c613961deChris Lattner /// 103864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 104864635ad7b3046d3042311423071152c613961deChris Lattner 105864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 106864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 107864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 108864635ad7b3046d3042311423071152c613961deChris Lattner 109864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 110864635ad7b3046d3042311423071152c613961deChris Lattner 111864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 112864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 113864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 114864635ad7b3046d3042311423071152c613961deChris Lattner } 115864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 116864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 117864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 118864635ad7b3046d3042311423071152c613961deChris Lattner } 119864635ad7b3046d3042311423071152c613961deChris Lattner 120864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 121864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 122864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 123b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 124864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 125b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 127c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 130b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 132b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1389f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 139864635ad7b3046d3042311423071152c613961deChris Lattner }; 140864635ad7b3046d3042311423071152c613961deChris Lattner} 1414ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1589373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1599373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1609373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1619373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 164f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 165f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1799f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 186f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 187f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 188f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 189f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 190f40708223e409a152834b1553c6883ff2035b957Duncan Sands 1911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 194571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 195571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 196571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 197571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 198571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 199571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 200edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 2023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 211cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 212cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 213cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 214f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 2158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 2168806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 217f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 218f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 219f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 221f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 227f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 228571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 229f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 234bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 235f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 236f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 237bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 240f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 241bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 242bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 243bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 244bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 246edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 249bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 250bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 25116ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 25216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 253bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 254bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 256bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 257bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 258bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2592aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 262b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 264a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 265ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 266d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 267ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 268a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 269b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 270d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 2726266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2752aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2762aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2852aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 2988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 300c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 301b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 302c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 313b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 314b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 31595b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 3168c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman unsigned R = MakeReg(RegisterVT); 3178c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman for (unsigned i = 1; i != NumRegisters; ++i) 3188c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman MakeReg(RegisterVT); 3198c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3320da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 334d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 335d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 336d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 337d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 338d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 339d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 387b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 388b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 3895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 3915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 3934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 3945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 3955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 3965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 3975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 415a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 418f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 419f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 420f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 425f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 4315f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 432edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4335f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 4343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 437a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 438a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 439a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 440d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 441d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 442edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 443d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 444d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 445d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 446d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 447d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 448d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 450d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 451bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 452bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 453d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 454d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 455d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 456a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 457a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 458571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 459571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4631e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4641e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 478466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 47995c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 485199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4870da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4900da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4924e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 493e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 494e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 495e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 496f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 497571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 498571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 499571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 501571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5021da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 5031da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 504070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov bool IsTailCall, SDOperand Callee, unsigned OpIdx, 505070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 506070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 510f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 514dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 518dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 522dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 530f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 53537efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 540b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 541b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 544e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5455fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 5481628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 55001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 551b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5521628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 5551628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 5571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 5597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 5607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 5617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 5627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 5637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 5647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 5657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 5667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 56724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5683822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5693822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 57045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 57145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 5723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5862bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5872bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5883e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 589c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 600ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 601c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6020eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6097041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyFromParts - Create a value that contains the 6246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified legal parts combined into the value they represent. 6256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 6266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 6276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 6286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 6296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 6306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE) { 6316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 6326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val = Parts[0]; 6336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the top part. 6356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 6366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts == 2 && 6376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Cannot expand to more than 2 elts yet!"); 6386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Hi = Parts[1]; 639532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 6406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::swap(Val, Hi); 6416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 6426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Otherwise, if the value was promoted or extended, truncate it to the 6456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // appropriate type. 6466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT == ValueVT) 6476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return Val; 6486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 6506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 651a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 652a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman } 653a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman 654a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman if (MVT::isVector(ValueVT)) { 655a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman assert(NumParts == 1 && 656a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorElementType(ValueVT) == PartVT && 657a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 658a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial scalar-to-vector conversions should get here!"); 659a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 6606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isInteger(PartVT) && 6636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isInteger(ValueVT)) { 6646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (ValueVT < PartVT) { 6656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // For a truncate, see if we have any information to 6666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // indicate whether the truncated bits will always be 6676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // zero or sign-extension. 6686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (AssertOp != ISD::DELETED_NODE) 6696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(AssertOp, PartVT, Val, 6706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getValueType(ValueVT)); 6716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 6726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 6736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 6746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isFloatingPoint(PartVT) && 6786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) 6796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 6806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::getSizeInBits(PartVT) == 6826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) 6836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 6846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 6866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 6896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 6906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 6916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 6926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 6936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 6946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 6956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 6976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 6986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == Parts[0].getValueType() && 6996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Part type doesn't match part!"); 7006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Assemble the parts into intermediate operands. 7026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 7036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumIntermediates == NumParts) { 7046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, truncate or copy the value, 7056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 7066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 7076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 708532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 7106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, build the intermediate operands 7116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // from the parts. 712be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman assert(NumParts % NumIntermediates == 0 && 7136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 714be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman unsigned Factor = NumParts / NumIntermediates; 7156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 717532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 7216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // operands. 7226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(MVT::isVector(IntermediateVT) ? 7236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::CONCAT_VECTORS : 7246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::BUILD_VECTOR, 725be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman ValueVT, &Ops[0], NumIntermediates); 7266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 7276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyToParts - Create a series of nodes that contain the 7296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified value split into legal parts. 7306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 7316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 7326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 7336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 734532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman MVT::ValueType PartVT) { 73525ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 73625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 7376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 7386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 7406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the parts. 7416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 7426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 7436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[i] = DAG.getNode(ISD::EXTRACT_ELEMENT, PartVT, Val, 74425ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 745532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 7466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::reverse(Parts, Parts + NumParts); 7476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If there is a single part and the types differ, this must be 7516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // a promotion. 7526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 7536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 7546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && 7556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Not a vector-vector cast?"); 7566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 757a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman } else if (MVT::isVector(ValueVT)) { 758a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman assert(NumParts == 1 && 759a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorElementType(ValueVT) == PartVT && 760a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 761a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 762a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 763a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 7646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 7656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT < ValueVT) 7666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::TRUNCATE, PartVT, Val); 7676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 7686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::ANY_EXTEND, PartVT, Val); 7696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isFloatingPoint(PartVT) && 7706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) { 7716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 7726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::getSizeInBits(PartVT) == 7736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) { 7746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 7756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 7766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 7776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 7806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 7846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 7856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 7866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 7876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 7886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 7896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 7906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 7916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 7936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 7946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 7966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 7976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 7996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 8006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 8016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 80225ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 8036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 8046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 8056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 80625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 8076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 8086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 8096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 8106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 8116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 8126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 813532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 8146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 8156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 8166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 8176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 8186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 8196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 8206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 821532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 8226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 8256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 826199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 827199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 828199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 829199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 830199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 831199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 832199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 833199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 834199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 8350da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 8360da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 8370da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 838199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 839199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 840199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 841199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 842199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 8439d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 84423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 84523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 8467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR of undef nodes. 8479d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 84823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 84923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 85023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 851bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 85223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 85323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 85423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 8557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return N = DAG.getNode(ISD::BUILD_VECTOR, VT, 857bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 858199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 85943421b3dd70af5b70e71816521f37502c397cc65Dale Johannesen return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 8609d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 861199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 862199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 863199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 864199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 865199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 86607a96765daedf180a7102d39fe56c499878312b7Dan Gohman // the vector constant. 867bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 8689d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 8692bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 8702bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 871199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 87207a96765daedf180a7102d39fe56c499878312b7Dan Gohman assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!"); 873199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 874199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 875199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 876199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 877199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 878199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 879199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 880199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 8817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR node. 8827f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8837f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], 8840da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 885199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 886199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 8876b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 888199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 889199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 890199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 891199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 892199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 893199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 894199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 895199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 896199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 897199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 898251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 899251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 900199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 901b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 902b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(VT); 903b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 904b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> Regs(NumRegs); 905b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 906b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Regs[i] = InReg + i; 907b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 908b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegsForValue RFV(Regs, RegisterVT, VT); 909b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 910b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 911b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 912199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 913199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 914199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 9151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 9161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 917a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 9181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 9191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 920bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 921ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 922ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 923ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 924ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 925ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 9266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // the full width of a register, since getCopyToParts and Legalize will use 9276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // ANY_EXTEND rather than sign/zero. 9288e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 9298e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 930ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 931ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 932ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 933ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 934ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 935ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 936ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 93747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 9385694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 939bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 94018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt)) 9418c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 94218da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt)) 94347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 944376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 9456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(RetOp); 9466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 9486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType VT = RetOp.getValueType(); 9496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 9506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT = TLI.getRegisterType(VT); 9516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 952532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT); 9536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i < NumParts; ++i) { 9546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(Parts[i]); 9556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 957ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 9581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 959bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 960bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 9611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 9621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 963571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 965571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 966571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 967571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 968571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 969571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 970571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 971571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 972571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 973571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 974571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 975571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 976571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 9778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 9788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 9798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 9808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 9818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 9828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 9838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 9848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 9878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 9918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 9928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 9938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 9948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 9978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 10008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 10018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 10028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 10038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 10046a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 10056a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 10066a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 10076a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 10086a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 10096a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1010571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1011571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1012571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1013571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1014571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1015571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1016571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1017e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1018571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1019e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1020e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 10216a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 10226a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 10236a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1024571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1025571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1026e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1027e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1028e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1029e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 10305a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 10315a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 10325a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 10335a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 10345a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1035e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1036e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1037e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1038e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1039e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1040e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1041e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1042e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1043e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1044e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1045e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1046e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1047e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1048e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1049e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1050e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1051e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1052e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1053e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1054e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1055e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1056e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1057e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1058e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1059e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1060e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1061e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1062e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1063e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1064e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1065e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1066e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1067e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1068e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1069e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1070e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1071e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1072e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1073e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1074e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1075e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1076e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 10770da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1078e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1079571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1080571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1081571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 10825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1083571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1084571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1085571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1086571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1087571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 10886b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 10895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1090571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1091571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1092571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1093571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1094d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1095d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1096571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1097571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1098571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1099571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1100d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1101d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1102d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1103d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1104d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1105d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1106d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1107d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1108571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1109d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1110d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1111d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1112d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1113d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1114d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1115d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1116d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1117d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1118d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1119d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1120d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1121d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1122d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1123d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1124d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1125d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1126d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1127d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1128d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1129d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1130d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1131571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1132571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1133df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1134df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1135df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1136df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1137df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1138df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1139df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11400ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 11410ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 11420ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 11430ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 11440ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 11450ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 11460ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 11470ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 11480ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1149df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1150df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1151df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 11531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 11541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 11551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 11571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 11581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 11591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 11601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 11611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 11631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 11641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1165a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1166dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 116757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 116857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 116957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 117057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 117157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 117257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 117357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 117457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 117557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 117657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 117757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1178571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1179571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1180571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1181571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1182571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1190571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1191571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1192571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1193571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1194571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1195571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1196d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1197571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1198571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 11990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 12000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 12010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 12020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 12030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1204df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1205df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1206df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1207df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1208df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1209df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1210df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1211df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1212df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1213df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1214df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 12155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 12165a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 12170ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 12180ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 12190ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 12200ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 12210ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1222df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1223571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1224571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 12252452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 12262452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 12276b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 12285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 12292452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 12302452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 12312452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 12321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1234f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1235f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1236f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 123757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 123857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 123957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 12405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 12415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 12425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 12435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 12445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 12455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 12465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 12475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 12485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 12495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 12505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 12515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 12535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 12555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 12565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 12585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 12593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 12615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 12625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 12645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 12655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 12665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1270f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1271f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1272f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1274f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1275f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1276f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1277f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1278f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 127957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 128057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1281f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1282f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1283f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1284f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 128557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 128657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1287f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1288f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1289f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 129057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1291f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 129257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 129357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1294f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1295f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 12963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 129737efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 129837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1299f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 130037efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 13013d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 13023d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 13033d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 13043d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 13053d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 130637efe6764568a3829fee26aba532283131d1a104Nate Begeman} 130737efe6764568a3829fee26aba532283131d1a104Nate Begeman 13083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 13093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 13103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 13113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 13123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 13133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 13143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 13153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 13163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 13193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 13213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 13223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 13233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 13243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 13257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 13263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 13273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 13293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 13323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 13333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 13353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 13363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 13373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 13393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 13403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 13473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 13493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 13503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 13523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 13533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 13554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 13564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 13593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 13614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 13624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 13634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 13644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 13654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 13684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 13704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 13724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 13734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 13757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 13764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 13774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 13794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 13814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 13824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 13834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 13844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 13874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 13884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 13904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 13914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 13984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 14004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 14014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 14024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 14034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 14044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 14054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 14074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 14084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 14104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 14114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 14134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 14144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 14154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 14164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 14174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 14184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 14204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 14214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 14224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 14234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 14244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 14254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 14264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 14274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 14284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 14304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 14314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 14324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 14334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 14344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 14354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 14374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 14384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 14394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 14404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 14414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 14434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 14444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 14464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 14473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1448b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1449b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1450b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1451f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 14529fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1453f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands LowerCallTo(I, I.getCalledValue()->getType(), 1454f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands I.getCallingConv(), 1455f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands false, 1456f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands getValue(I.getOperand(0)), 1457f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 3, LandingPad); 1458f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1459f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1460f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1461f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1462f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1463f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 1464f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second)); 1465f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 14669fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1467f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 1468f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1469f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1470070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1471f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1472f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1473f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1474b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1475b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1476b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1477b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1478b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 14795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1480b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1481dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1482b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1483b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1484b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1485dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1486dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1487dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1488dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 14894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1490dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 14915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1492b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1494b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1495b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1496b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1497b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1502b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1504b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1506b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1507b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1508b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 15095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 15135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1527b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1528b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1529b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1530b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 15355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 15365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 15375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 15385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 15395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 15405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 15425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 15435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 15455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1550b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1553b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1555b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1557b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1558dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1559dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1560b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15627294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 15637294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 15647294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 15657294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 15667294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1567b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1568dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1569b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1570b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1571b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1572dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1573dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1574dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 15765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 15775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 15795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 15815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1582dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15837294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1584dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1585dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 15875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1588dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1589dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 15915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 15924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 15935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1594b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1595b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1596dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1597b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1598b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1599b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1600b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1601b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1602b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1603b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1604b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1605b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1606b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1607b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1608b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1609b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1610b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1611b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1612b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1613b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1614b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1615b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 16174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1618b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1619b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1620b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1621b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 16225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 16235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 16245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 16255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 16275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 16285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 16295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1630b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1631b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1634b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 16365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1637b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1638b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1639b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1643b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1644b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1645b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1646b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1649b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1651f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1652b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1653b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1654b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1655b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1656b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1658b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1659dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1662b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1663b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1664dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1666b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1667b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1668b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1669b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1670b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1671b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1672b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1673b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1674b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1675b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1676b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1677b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1678b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1679b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1680b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1681b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1682b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1683b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1684b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1685b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 16865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 16875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 16884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 16895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1690b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1691b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1692b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 16935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 16945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 16955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 16965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 16975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 16995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 17014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 17024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1703b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 17045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 17055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 17065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 17074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1708b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1709b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 171054e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 17114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 17124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 17154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 17164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1717b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 17184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 17194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1720b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 17235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1724b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17257294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 17267294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 17277294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 17287294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 17297294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 17307294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1731b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1732b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 17345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1736b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1739b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1740b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1741b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1742b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 17445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 17455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 17465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 17475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1748b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1749b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1750b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1751b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1752b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1753b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1754b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1755b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1756b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1757b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 17595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 17605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 17615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1763b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1764b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1766b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1767b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1768b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1769b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1770b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 17715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 17725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1773b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1774b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1775b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1776b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1777b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1778dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1779dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1780b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1781b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 17883ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1789b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 17924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 17934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 17964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 17994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 18004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 18064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 18094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 18104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 18114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 18124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 18134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 18144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 18174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 18184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 18204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 18214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 18224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 18234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 18244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 18254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 18264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 18274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1828ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 18294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 18304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 18314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 18324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 18354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 18364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 18384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 18394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 18404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1841e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 18424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 18434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 18444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 18454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 18484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 18494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 18514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 18524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 18534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 18544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 18554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 18574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 18584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 18594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 18604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 18634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 18644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 1866e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 18674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 18684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 18724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 18744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 18764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 18774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 18784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 18804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 18834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 18844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 18854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 18874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 18884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 18894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 18904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 18914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1894efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 18954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 18964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 18984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 18994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 19014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 19034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 19044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 19075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 19125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 19135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 19145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 19165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 19175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 19195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 19215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 1922a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 1923a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 1924cfacc8f5d25f38112eee836530004f7816439765David Greene for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 19255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 19265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 19275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 19285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 19295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 19315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 19325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 19345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 19355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 19365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 19375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 19415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 19425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 19435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 19445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 19475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 19485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1950f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1951f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1952f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1953c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 19545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1955d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1956f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1957f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 19585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1959f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1960c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1961f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1962d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1963f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1964d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1965c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1966d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1967f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1968f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1969f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1970f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1971f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1972f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 19735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 19745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 19755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 19765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1977c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1978f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1979f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1980f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 19815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 198237efe6764568a3829fee26aba532283131d1a104Nate Begeman 19833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1984b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 19853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 19863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 19883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 19893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 19903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 19913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 19934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 19944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 19963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1997dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1998dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1999dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 20004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 20013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 20023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2003dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2004dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2005dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2006dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2007dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2008dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2009f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2010f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2011f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 20123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2013b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2014b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 201524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 20169d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 20177f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 20187f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 20197f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2020c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2021c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 20229e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2023c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2024c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2025c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2026c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2027c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2028c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 20297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20327f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 203301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 20349e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 203501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 203601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 203701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 203801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 20397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 20417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2042b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2043b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 20447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 20451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 20461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 204724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 204824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 20491628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 20501628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2051e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2052e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2053e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2054e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 20567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2057832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2058832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2059832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2060e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 20621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 206445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2065e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2066e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2067e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2068e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2069e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2070e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2071e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 207245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2073e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 207445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 207545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 207645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 207745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 207845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 207945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 208045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 208145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 208245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 208345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 208445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 208545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 208645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 208745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 208845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 208945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 209045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 209145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 209245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2093e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2094e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2095e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2096e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2097e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2098e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2099e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2100e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2101e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2102e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2103e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2104e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2105e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2106e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2107e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2108e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2109e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2110e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2111e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2112e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2113e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2114e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2115e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2116e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2117e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 211845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 211945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2120e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 212145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 212245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2123e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2124e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2125e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2126e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2127e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 21281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 21311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 21321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 21331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 21347f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 21357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 21361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 21403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 21413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 21443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 21473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 21493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 21523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 21553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 21573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 21603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 21633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 21673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 21703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 21743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 21773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 21783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 21813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 21843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 21853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 21883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 21913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 21953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 21983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 22023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 22053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 22063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 22071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2208e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 220928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 22113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 22123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 22133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 22163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 22173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 22203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 22213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 22223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 22243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 22263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 22273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 22303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 22333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 22373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 22383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 22393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 22403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 22421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22442bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2245c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2246c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2247c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2248c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2249c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 22517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22527f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2253c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2254c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22552bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2256384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2257384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2258384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 22597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2260384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2261384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2262c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22633e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 22643e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 22653e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 22663e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 22673e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22687f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 22697f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 22713e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 22723e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22733e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 22761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 22771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 22801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2281c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2282b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 22831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 22841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2285b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 22861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2287dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 22881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 22901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 22911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 22927c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 22947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2295b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 229647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2297a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 22987c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 22997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 23007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 23017c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2303a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 23047c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 23057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 23077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 23087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 230947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 23107c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 23117c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 23127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23137c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 23147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 23157c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 23167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 23177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 23186b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 23191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 23211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23227c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23237c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 23247c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 23257c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 23291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 23321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 23331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 23341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 23351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2338a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 233958092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2340d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 234158092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 23421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 234468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 234568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 234668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 234768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 234868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 23491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 235068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 23511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 23521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23534515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 23544515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 23554515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 23561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 23571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 23584515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 23591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 23604515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 23614515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 23624515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 23634515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 23644515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(StackAlign-1)); 23654515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 23664515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 23674515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(~(uint64_t)(StackAlign-1))); 23681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2369bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2370f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2371f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2372f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 23730da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 23740da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 23751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 23771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 23781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 23791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 23821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2383edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2384d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2385d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2386d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2387d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2388d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2389d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2390d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 239128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2392466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 239395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 239428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 239528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 239628b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2397466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 239895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 239995c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 24007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 24017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 24027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2403d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 240428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2405d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2406d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2407d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 240828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 240928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 24101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 24141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 24151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 24161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 24170b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 241895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 24191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24210eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 24220eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 24230eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 24240eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 24250eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 24260eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 24270eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 24280eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24290eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2430e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2431e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2432e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2433e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2434e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2435e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2436e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2437e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2438e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 24390eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 24400eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 24410eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 24420eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 24437255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2444e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 24450eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24460eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2447bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2448e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2449e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2450e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2451e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2452e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2453e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2454e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2455e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24560eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24570eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 24580eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 24590eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24600eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 24610eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 24620eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 24630eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 24640eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 24650eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 24660eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24670eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24680eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 24690eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24700eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 24717f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 24729d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 24730eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 24740eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24750eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 24760eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 24770eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24780eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24790eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 24800eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 24810eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24820eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 24830eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 24840eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2485f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2486f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 24870eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 248848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 248948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2490f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2491f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 249248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2493f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2494f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 249548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2496f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2497f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 249848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2499e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2500e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2501e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2502e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2503e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2504e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2505e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 25060eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 25079d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 25087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 25097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 25100eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 25110eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 25120eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 25130eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 25140eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2515b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2516cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2517b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2518b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 2519cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (GV || isa<ConstantPointerNull>(V) && 2520cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2521cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2522cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2523cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2524f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2525cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2526f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2527f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2528f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2529f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2530f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2531f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2532f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2533f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2534f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2535f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2536f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2537f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2538cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2539cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2540cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2541cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2542cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 25436590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2544cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2545cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2546cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2547cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2548cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2549cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2550cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2551cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2552cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2553cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 25546590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 25556590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 25566590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 25576590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 25586590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 25596590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 25606590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 25616590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 25626590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 25636590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 25646590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2565cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2566cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2567cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2568f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2569cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2570cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2571cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2572cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2573cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2574f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2575cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2576f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2577f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2578c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2579c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2580c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2581c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2582c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2583c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 25840eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 25850eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 25860eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 25870eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2588c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2589c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2590c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2591bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2592bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2593bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2594bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2595bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2596bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2597bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2598bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2599c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2600d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2601c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2602c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2603d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2604c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 260503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 260603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 260703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 260803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 260903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 261003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 261103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 261203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 261303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 261403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 261503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 261603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2617c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 261886cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 261944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 262043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 262144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2622bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 262336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2624bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2625bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2626bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2627ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 262844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2629ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 263043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 263143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2632bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2633bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2634ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2635bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 263686cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 263743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2638b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 263936ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 264043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 264144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 264243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 264344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 264444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 26451ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2646bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 264743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 264843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2649b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 265043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 265244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 265343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 265444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 265544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 26561ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2657bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 265843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2660b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 266143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 266243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 266344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 266443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 266544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 266644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 266744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 26681ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2669bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 267043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 267143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2672b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 267343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 267443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 267544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 267643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 267744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 26780892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2679bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 268044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 268143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 268243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 268343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 268443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2685c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2686b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2687e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (ExceptionHandling) { 2688902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (!CurMBB->isLandingPad()) { 2689902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception register as live in. Hack for PR1508. 2690902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionAddressRegister(); 2691902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2692902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands } 2693735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2694735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2695735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2696735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2697735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2698735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2699735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 27007a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 270164ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2702735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2703b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2704b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2705b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 27068806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 27078806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2708b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27098806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 27108806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 27118806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 2712ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2713f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2714f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2715e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2716f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2717f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2718f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2719902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2720902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2721902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2722e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2723735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2724735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 27258806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2726735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2727735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2728735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2729735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2730735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2731735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 27327a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 27338806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2734b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2735b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2736b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2737b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 27388806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 27398806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 27408806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2741b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27428806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 27438806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2744735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2745735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2746735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2747cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 27483b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2749735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 27508806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 27517a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2752f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 27538806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2754b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2755b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2756b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2757b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2758b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 27592365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 27602365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27612365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27622365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MMI && ExceptionHandling) { 27632365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 27642365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 27652365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 27662365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getRoot(), 27672365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 27682365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 27692365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 27702365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 27712365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27722365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27732365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27742365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27752365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27762365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 27772365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 27782365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 27792365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27802365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27812365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27822365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27832365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27842365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 27852365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (ExceptionHandling) { 27862365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 27872f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov SDOperand CfaArg; 27882f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 27892f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::TRUNCATE, 27902f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27912f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov else 27922f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 27932f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27942f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov 27952365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov SDOperand Offset = DAG.getNode(ISD::ADD, 27962365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27972365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 27982f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy()), 27992f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg); 28002365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getNode(ISD::ADD, 28012365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 28022365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAMEADDR, 28032365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 28042365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getConstant(0, 28052365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy())), 28062365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov Offset)); 28072365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 28082365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 28092365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 28102365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 28112365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 28122365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 28132365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 28149ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 2815c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2816c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2817c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2818c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 28199ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 28206ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 28216ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 28226ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 28236ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 28246ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2825ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 2826ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 2827ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2828ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2829ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2830ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 2831ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 2832ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2833ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2834ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2835ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 2836ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 2837ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2838ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 2839ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 2840ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2841c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2842c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2843c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2844c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2845c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 28468b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2847bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2848f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2849f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2850f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 28518b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 28528b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 285351b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 28548b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2855c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 28563f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 2857f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 2858f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 2859f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 2860f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 2861f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 2862f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 28633f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 2864addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 2865a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 2866d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2867d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2868d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2869d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 2870a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 2871a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2872a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2873a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 2874a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2875c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2876a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2877a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 2878a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2879a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2880a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 2881a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2882c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2883a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2884a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 2885a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2886a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2887a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 2888a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2889c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2890a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2891140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2892bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2893f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2894f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2895140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2896140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2897140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2898140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 289939a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 290039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 290139a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2902140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 290339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2904ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2905ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2906ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 290724e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner 290824e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 290924e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 291024e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 291136397f50343639ce9a25996f2d790c656791ab92Duncan Sands 291236397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 291336397f50343639ce9a25996f2d790c656791ab92Duncan Sands const Function *F = 291436397f50343639ce9a25996f2d790c656791ab92Duncan Sands cast<Function>(IntrinsicInst::StripPointerCasts(I.getOperand(2))); 291536397f50343639ce9a25996f2d790c656791ab92Duncan Sands 291636397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 291736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 291836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 291936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 292036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 292136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 292236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 292336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 2924f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 2925f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 2926f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 2927f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 2928f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 2929f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 2930f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 293136397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 293236397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 2933c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2934c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2935c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2936c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 29371da20a71d1bbabc472f281208be77475550be751Jim Laskeyvoid SelectionDAGLowering::LowerCallTo(Instruction &I, 29381da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, 29391da20a71d1bbabc472f281208be77475550be751Jim Laskey unsigned CallingConv, 29401da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2941070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov SDOperand Callee, unsigned OpIdx, 2942070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 29431da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2944735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 29455694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 2946070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2947070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 2948070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2949735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2950735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2951735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2952735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2953735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2954735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2955735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 29564fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands 29574fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands unsigned attrInd = i - OpIdx + 1; 29584fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::SExt); 29594fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isZExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ZExt); 29604fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isInReg = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::InReg); 29614fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSRet = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::StructRet); 296236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Entry.isNest = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::Nest); 296321485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Entry.isByVal = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ByVal); 2964735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2965735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2966735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 296757810cdac4c842b4b395d2a0b2fae406aacb3ee4Duncan Sands if (ExceptionHandling && MMI && LandingPad) { 2968070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 2969070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 2970070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 2971070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2972070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(BeginLabel, MVT::i32))); 2973070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2974070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2975735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2976735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 297718da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), 29781da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2979735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2980735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2981735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2982735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2983070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 298457810cdac4c842b4b395d2a0b2fae406aacb3ee4Duncan Sands if (ExceptionHandling && MMI && LandingPad) { 2985070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 2986070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 2987070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 2988070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2989070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(EndLabel, MVT::i32))); 2990070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2991070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Inform MachineModuleInfo of range. 2992070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 2993070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2994735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2995735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2996735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 29971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 299864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2999c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 300087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3001c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3002c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3003c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3004c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 300587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 300687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 300787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 300887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 300987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 301087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 301187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 301287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 301387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 301487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 301587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 301687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 301787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 301887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 301987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 302087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 302187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 302287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 302387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 302487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 302587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 302687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 302787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 30282f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 30292f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 303087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 303187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 303287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 303387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 303487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 303587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 303687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 303787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 303887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 30392f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 30402f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 304187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 304287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 304387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 304487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 304587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 304687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 304787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 304887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 304987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 30502f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 30512f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 305287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 305387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 305487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 305587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 305687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 305787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3058f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3059c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 306087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3061ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3062ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 3063ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3064c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3065edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 306664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 306764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 306864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 306964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 307064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3071070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 30721da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 3073070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.getCallingConv(), 3074070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.isTailCall(), 3075070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov Callee, 3076070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1); 30771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 30781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3079735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3080b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3081b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3082b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3083b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3084b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3085b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag)const{ 3086b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the legal parts from the registers. 3087b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3088b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 308927a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3090b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3091b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT, *Flag) : 3092b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT); 3093b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(1); 3094b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3095b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(2); 3096b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[i] = Part; 3097b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3098b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3099b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Assemble the legal parts into the final value. 3100532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman return getCopyFromParts(DAG, &Parts[0], NumParts, RegVT, ValueVT); 3101b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3102b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3103b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3104b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3105b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3106b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3107b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3108b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3109b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 3110b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3111b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 3112532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Val, &Parts[0], NumParts, RegVT); 3113b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3114b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 311527a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3116b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3117532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag) : 3118532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 3119b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(0); 3120b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3121b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 3122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3123c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3124864635ad7b3046d3042311423071152c613961deChris Lattner 3125c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3127c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 31299f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 31304b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 31314b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 3132c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 3133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 3134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3135864635ad7b3046d3042311423071152c613961deChris Lattner 3136864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3137864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3138864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3139864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 31409b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 31419b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 3142f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3143f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 31449b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 31459b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 3146f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3147f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 31489b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 31499b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 31509b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 31519b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 31529b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 31539b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3154f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3155f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3156f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3157f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3158f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3159f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3160f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3161f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 31629b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 31639b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 31649b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3165f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 31669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3167864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3168864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3169864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3170864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 31719b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 31729b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3173f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3174f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3175f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3176f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3177f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3178f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3179f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3180864635ad7b3046d3042311423071152c613961deChris Lattner } 3181f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3182864635ad7b3046d3042311423071152c613961deChris Lattner} 3183864635ad7b3046d3042311423071152c613961deChris Lattner 3184bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3185bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3186bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3187bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 3188bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstruct AsmOperandInfo : public InlineAsm::ConstraintInfo { 3189bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintCode - This contains the actual string for the code, like "m". 3190bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string ConstraintCode; 3191bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3192bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintType - Information about the constraint code, e.g. Register, 3193bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// RegisterClass, Memory, Other, Unknown. 3194bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ConstraintType; 3195bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3196bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallOperand/CallOperandval - If this is the result output operand or a 3197bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// clobber, this is null, otherwise it is the incoming operand to the 3198bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallInst. This gets modified as the asm is processed. 3199bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 3200bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Value *CallOperandVal; 3201bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3202bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintVT - The ValueType for the operand value. 3203bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ConstraintVT; 3204bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3205e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3206e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3207e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3208e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3209bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner AsmOperandInfo(const InlineAsm::ConstraintInfo &info) 3210bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner : InlineAsm::ConstraintInfo(info), 3211bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType(TargetLowering::C_Unknown), 3212bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CallOperand(0,0), CallOperandVal(0), ConstraintVT(MVT::Other) { 3213bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3214bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3215bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner void ComputeConstraintToUse(const TargetLowering &TLI); 3216e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3217e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3218e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3219e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3220e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 3221e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs) const { 3222e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isOutReg) 3223e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OutputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3224e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isInReg) 3225e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner InputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3226e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3227bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3228bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3229bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3230bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 3231bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 3232bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner switch (CT) { 3233bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner default: assert(0 && "Unknown constraint type!"); 3234bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Other: 3235bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Unknown: 3236bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 0; 3237bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Register: 3238bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 1; 3239bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_RegisterClass: 3240bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 2; 3241bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Memory: 3242bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 3; 3243bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3244bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3245bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3246bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnervoid AsmOperandInfo::ComputeConstraintToUse(const TargetLowering &TLI) { 3247bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner assert(!Codes.empty() && "Must have at least one constraint"); 3248bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3249bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string *Current = &Codes[0]; 3250bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current); 3251bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (Codes.size() == 1) { // Single-letter constraints ('r') are very common. 3252bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3253bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3254bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return; 3255bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3256bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3257bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned CurGenerality = getConstraintGenerality(CurType); 3258bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3259bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 3260bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 3261bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner for (unsigned j = 1, e = Codes.size(); j != e; ++j) { 3262bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]); 3263bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned ThisGenerality = getConstraintGenerality(ThisType); 3264bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (ThisGenerality > CurGenerality) { 3265bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // This constraint letter is more general than the previous one, 3266bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // use it. 3267bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurType = ThisType; 3268bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Current = &Codes[j]; 3269bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurGenerality = ThisGenerality; 3270bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3271bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3272bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3273bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3274bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3275bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3276bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3277bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3278e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 3279e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris LattnerGetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 3280864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 32814e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3282e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3283e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3284e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3286e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3287e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3288e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3289e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3290e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3291e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3292e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3293e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3294e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3295e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3296e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3297e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3298e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3299e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3300e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3301e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3302e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3303e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3304e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3305e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3306e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3307864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3308e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3309e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3310e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3311e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3312e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3313e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3314864635ad7b3046d3042311423071152c613961deChris Lattner 3315bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3316bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3317b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3318864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3319bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3320864635ad7b3046d3042311423071152c613961deChris Lattner 3321bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 33222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 33232a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3324864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3325bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3326864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3327cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3328cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3329cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3330cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3331cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3332864635ad7b3046d3042311423071152c613961deChris Lattner 3333864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3334864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3335864635ad7b3046d3042311423071152c613961deChris Lattner 3336864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3337864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3338864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3339864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3340864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3341864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3342864635ad7b3046d3042311423071152c613961deChris Lattner 3343864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3344864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3345864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3346864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3347864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3348864635ad7b3046d3042311423071152c613961deChris Lattner } 3349864635ad7b3046d3042311423071152c613961deChris Lattner } 3350e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3351e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3352e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3353864635ad7b3046d3042311423071152c613961deChris Lattner } 3354864635ad7b3046d3042311423071152c613961deChris Lattner 33552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 33562a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 33572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3358c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3359c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 33602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 33612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 33622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3363e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3364e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3365e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3366e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3367e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 33682a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 33693a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3370bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 33713a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 33722a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33732a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 3374bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SSARegMap *RegMap = MF.getSSARegMap(); 33752a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 33762a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 33772a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 3378e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3379e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3380e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 33812a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 33822a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33832a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 33842a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 33852a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 33862a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33872a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 33882a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 33892a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 33902a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3391bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3392bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 33932a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3394e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 33954e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 3396864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3397864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3398864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 33994e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3400864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3401864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3402864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3403864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3404864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3405864635ad7b3046d3042311423071152c613961deChris Lattner } 3406864635ad7b3046d3042311423071152c613961deChris Lattner 34074e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 34084e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3409c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 3410c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner RC = isAllocatableRegister(Reg, MF, TLI, MRI); 3411c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3412c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3413c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3414c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3415c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 34164e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 34174e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3418864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3419864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3420864635ad7b3046d3042311423071152c613961deChris Lattner 3421e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3422864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3423864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3424864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3425864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3426e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3427e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3428864635ad7b3046d3042311423071152c613961deChris Lattner 3429e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(), 3430e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3431e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3432e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3433864635ad7b3046d3042311423071152c613961deChris Lattner } 34344e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3435864635ad7b3046d3042311423071152c613961deChris Lattner 3436864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3437e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 34384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 34394e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 34403ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3441ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3442ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3443ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 3444ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 3445ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34460c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 34470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<AsmOperandInfo> ConstraintOperands; 3448ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3449ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3450ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3451ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34524e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 34530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 34550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 34560c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 34570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3458e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3459e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3460e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3461e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3462e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3463e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3464e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner unsigned OpNo = 1; // OpNo - The operand of the CallInst. 34650c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 34660c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i])); 34670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands.back(); 34680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 34701efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 34710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 34720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 34731efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 34740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 34750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // The return value of the call is this value. As such, there is no 34760c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // corresponding argument. 34771efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 34781efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 34791efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 34800c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 34811efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 34821efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34831efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 34840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 34851efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34861efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 34870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 34881efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34891efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 34900c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 34920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 34930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 34940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner const Type *OpTy = OpInfo.CallOperandVal->getType(); 34956995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If this is an indirect operand, the operand is a pointer to the 34966995cf6015580eeab07a1c671fca180084a1325eChris Lattner // accessed type. 34976995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (OpInfo.isIndirect) 34986995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = cast<PointerType>(OpTy)->getElementType(); 34996995cf6015580eeab07a1c671fca180084a1325eChris Lattner 35006995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If OpTy is not a first-class value, it may be a struct/union that we 35016995cf6015580eeab07a1c671fca180084a1325eChris Lattner // can tile with integers. 35026995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (!OpTy->isFirstClassType() && OpTy->isSized()) { 35036995cf6015580eeab07a1c671fca180084a1325eChris Lattner unsigned BitSize = TD->getTypeSizeInBits(OpTy); 35046995cf6015580eeab07a1c671fca180084a1325eChris Lattner switch (BitSize) { 35056995cf6015580eeab07a1c671fca180084a1325eChris Lattner default: break; 35066995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 1: 35076995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 8: 35086995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 16: 35096995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 32: 35106995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 64: 35116995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = IntegerType::get(BitSize); 35126995cf6015580eeab07a1c671fca180084a1325eChris Lattner break; 35136995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 35140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35156995cf6015580eeab07a1c671fca180084a1325eChris Lattner 35166995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpVT = TLI.getValueType(OpTy, true); 35170c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 35190c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 35202a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 35213ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 35223ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 35231efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3524e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3525e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 352609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 352709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 352809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 352909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 353009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 353109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 353209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 353309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 353409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 353509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 353609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 353709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 353809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 353909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 354009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 354109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 354209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 354309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 354409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 354509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 354609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 354709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 354809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 354909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 355009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 355109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 355209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 355309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 355409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 355509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 355609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 355709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 355809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 355909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 356009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 356109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 356209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 356309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3564e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3565e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3566e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3567e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 35680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 35700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3572e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3573e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3574e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 3575e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 3576e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3577e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3578e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3579e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3580e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3581e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3582e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 35830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 35840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 35850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 35860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 35870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 35880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35892cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 35900f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 35910f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3592864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 35930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3595864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 35960f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 35970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 35980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 35991efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 36000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 36012cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3602c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3603c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3604f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 360509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 360622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 360722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 360822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3609c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3610c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 361109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 361222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 361322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 361422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 36152a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 361622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3617864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3618864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3619e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3620832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 36210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3622d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3623d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 36242cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 36250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 36260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3627864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 36282cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 36292cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3630e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 36312cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3632e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 36330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 36342cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 36356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 36376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3638e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3639e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 36406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 36416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 36426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 36430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 36443d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 36450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 36462223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 36472223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 36480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 36493d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3650c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3651c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3653c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3654c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3655c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3656c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3657a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3658a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3659c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3660c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3661c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3662c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3663c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3664c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3665527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3666527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3667527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3668527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3669527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3670527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3671527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3672527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3673527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3674527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3675c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3676527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3677b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 3678527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3679527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3680527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3681527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3682527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3683c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 368487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 368587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 36862a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 36870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 368844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 368944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 369048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 369148884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 369248884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 369348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 3694832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 36950c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 369653069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 369753069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3698c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 369987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 370048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 3701c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3702c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 370348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 370487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 37052a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 370609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 370744b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 370844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 370944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 371087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 371187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3712c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3713c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 371487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3715c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 37162223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 371787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 37182a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 37192a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 37202a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 37210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 372244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 372387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 372487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3725e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3726e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 372787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3728b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 372987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3730e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3731e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37336656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3734c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3735c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3736c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3737e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3738e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3739e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3742c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 37436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3744ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3745ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3746ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3747ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3748ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3749f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3750f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3751bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3752ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3753ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 37556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 37563a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 3757b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 37583a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37593a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 37603a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 37617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 37627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 37633a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner const VectorType *VTy = cast<VectorType>(I.getType()); 37647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 37653a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 37673a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37683a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37693a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner setValue(&I, Val); 37703a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37716656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37726656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 37736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 37756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 37766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3777864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 37786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3779b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 3780864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 37816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3782ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37836656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3784bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 37856656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 37860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 37876656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 37888b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 37896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3790bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3791bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3792ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3793ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3794ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3795ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 37971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 37981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 380068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 380168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 380268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 380368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 380468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 38051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3807a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 38081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 38091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 38101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 381147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 381247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 381347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 381447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 381547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3816cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3817cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 381847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3819cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3820cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3821cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3822cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 382647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 382747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 382847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 382947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 383047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 38311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3832cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 383347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3834cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3835cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3838025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3839025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3840025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3841025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3842025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3843025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3844025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3845832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3846832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3847832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3848025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3849025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3850025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3851025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 385239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3853acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3854acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3855acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 385639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 385739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 38581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3859acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3860acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3861acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3862acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3863acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 38641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3867acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3868acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3869acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 38701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3873acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3874acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3875acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3876acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3877acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 38781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3880fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3881fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3882f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3883f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3884fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3885fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3886b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 38875694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 3888fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3889fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 38908c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3891fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3892fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3893fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3894fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3895fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 38966aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3897ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3898ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3899fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3900d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 39017aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3902d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 39037aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3904ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3905ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 390618da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt)) 3907d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 390818da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt)) 3909d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 391018da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg)) 3911d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 391218da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet)) 3913d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3914594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ByVal)) { 39151aa7efbd2c98e761f50992197473304b99257ca9Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 3916594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 3917594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 3918588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 3919588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 3920594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola unsigned StructSize = getTargetData()->getTypeSize(STy); 3921594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 3922594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 3923594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 392436397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Attrs && Attrs->paramHasAttr(j, ParamAttr::Nest)) 392536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 3926d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3927ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3928fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3929fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3930fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3931fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3932b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3933fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3934fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3935fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3936b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3937fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3938b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman case Expand: { 3939b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If this is an illegal type, it needs to be broken up to fit into 3940b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // registers. 3941b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 3942b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 3943b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3944b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetVals.push_back(RegisterVT); 3945b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // if it isn't first piece, alignment must be 1 3946b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (i > 0) 3947b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3948b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 3949b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3950fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3951fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3952fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3953b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3954fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 39553b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 39568c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3957fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3958fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3959f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3960f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3961bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 396227a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 396327a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 3964fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3965fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3966fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3967fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 396847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 396947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 397047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3971fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3972fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3973fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3974fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3975fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3976fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3977fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3978fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3979fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3980fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 398118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt)) 3982f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3983f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 398418da0720887527ed570e9703ae5f290beb491ee1Reid Spencer else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt)) 3985f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3986f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3987fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3988fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3989fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3990fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3991fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3992fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3993fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3994fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 399527a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 399627a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 399727a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 399827a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 399927a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned j = 0; j != NumParts; ++j) 400027a70be55f8b63181598d144d034b396402be66eDan Gohman Parts[j] = SDOperand(Result, i++); 4001532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT)); 4002fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 4003fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 400427a70be55f8b63181598d144d034b396402be66eDan Gohman } 4005fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 400627a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4007fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 4008fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4009fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4010f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4011f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4012f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4013f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4014f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4015f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 401647857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 401747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 4018f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 4019f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4020f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4021be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4022f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4023f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4024f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4025f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4026f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4027f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4028f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4029f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 403047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 403147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4032d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 40337aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4034d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 40350db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4036d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4037d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 4038d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4039d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 40400db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4041d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 40420db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4043d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 404421485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 404521485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 404621485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 404721485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 4048588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 4049588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 405021485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola unsigned StructSize = getTargetData()->getTypeSize(STy); 405121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 405221485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 405321485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 405436397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 405536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 4056d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 40570db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4058f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 4059f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 40607aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 4061f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4062b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4063f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4064f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 4065f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 4066d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 4067d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4068d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 4069d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 4070d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 4071d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 4072d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 4073f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 4074f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4075f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 4076849f214a4e3676e41168b0c5398165c4d4fb99f8Dale Johannesen Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 4077f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4078f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4079b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4080f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 408127a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 408227a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 408327a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 408427a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 4085532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT); 408627a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 408727a70be55f8b63181598d144d034b396402be66eDan Gohman // if it isn't first piece, alignment must be 1 408827a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned MyFlags = Flags; 408927a70be55f8b63181598d144d034b396402be66eDan Gohman if (i != 0) 409027a70be55f8b63181598d144d034b396402be66eDan Gohman MyFlags = (MyFlags & (~ISD::ParamFlags::OrigAlignment)) | 409127a70be55f8b63181598d144d034b396402be66eDan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 409227a70be55f8b63181598d144d034b396402be66eDan Gohman 409327a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(Parts[i]); 409427a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(DAG.getConstant(MyFlags, MVT::i32)); 4095f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4096f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4097f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 409827a70be55f8b63181598d144d034b396402be66eDan Gohman } 4099f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4100f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4101f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 4102b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType VT = getValueType(RetTy); 4103b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4104b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4105b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<MVT::ValueType, 4> RetTys(NumRegs); 4106b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4107b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetTys[i] = RegisterVT; 4108f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4109f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 4110f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4111b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4112be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4113b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getVTList(&RetTys[0], NumRegs + 1), 4114be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4115b15e49597f031fdd41fdec2887a3c24c0ea430d8Chris Lattner Chain = Res.getValue(NumRegs); 4116b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4117b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4118b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 4119b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::NodeType AssertOp = ISD::AssertSext; 4120b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!RetTyIsSigned) 4121b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 4122b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 4> Results(NumRegs); 4123b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4124b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Results[i] = Res.getValue(i); 4125532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Res = getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, AssertOp); 4126f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4127b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4128b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4129f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4130f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 413150381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4132171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4133171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4134d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4135171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4136171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 4137f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattnerstd::pair<SDOperand,SDOperand> 41381c4d492b944768ded5356587779045cc346409d7Chris LattnerTargetLowering::ExpandOperationResult(SDNode *N, SelectionDAG &DAG) { 4139f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner assert(0 && "ExpandOperation not implemented for this target!"); 4140f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner abort(); 4141f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner return std::pair<SDOperand,SDOperand>(); 4142f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner} 4143f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner 4144f58dac31690f37c8f93328f8470298e1fe7862ccChris Lattner 41450aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 41460aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 41470aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 41480aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 41490aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 41500aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 41510aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 415274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 41531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 41541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 4155a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 41561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 41571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 41581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 41591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 41621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 41661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 41681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 41711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 41721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 41731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 41741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 41791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 418274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 418374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 418474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 418574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 418674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 418774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 418874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 4189b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned MSB = MVT::getSizeInBits(VT) / 8; 419074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 419174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 419274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4193a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 419474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 419574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 419674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 419774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 419874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 41991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 42001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 42011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 42021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 42031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 42041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4206c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 420780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 420880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4209c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4210c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4211c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 42121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 42131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 42151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 42161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 42171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 42181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 42191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 42201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 42221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 42231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 42251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 42261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 42281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 42291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 423380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 423480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 423580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 423680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 42371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 423880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 423980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 424080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4241dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 42421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 4243b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 42441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 42451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 42461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 42471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 424880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 424980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 425080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 425180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 42521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 42531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 42541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 425580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 425680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 42571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42597041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 42601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 42611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 42621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 42631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 42641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 42651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 42661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42675f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // If the source and destination are known to not be aliases, we can 42685f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // lower memmove as memcpy. 42695f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (Op == ISD::MEMMOVE) { 42708806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov uint64_t Size = -1ULL; 42715f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 42725f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Size = C->getValue(); 42735f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 42745f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis::NoAlias) 42755f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Op = ISD::MEMCPY; 42765f43f92c69aae9837064cf08291db1b36a82789fDan Gohman } 42775f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 42781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 42791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 42801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 42821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4283bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 42841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4285ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 42861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4287c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4288c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 428980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 42901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 42911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 42921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 4293b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 4294a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4295786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4296864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 42978b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4298c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4299c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4300c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4301c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4302c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4303c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4304c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4305c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4306c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4307c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4308cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 430974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 431074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4311cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 431274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 431374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 431474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 431574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 431674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 431774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 431874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4319cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 432074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 432174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 432274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4323f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 43240937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4325cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4326cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4327cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4328cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4329cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 433074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 433174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4332c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4333c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4334b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 433574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 433674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4337cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 433874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 433974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 434074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4341786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4342786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43438b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 434474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 434574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 4346984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4347984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling I.getOperand(2), SrcOff, false, Align); 434874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 434974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4350786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4351786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 4352984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling I.getOperand(1), DstOff, false, Align); 435374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4354c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 435574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 435674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 43571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4359c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 43601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4362c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4363c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4364bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4365bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4366c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4367c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 43681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 43705c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola SDOperand AlwaysInline = DAG.getConstant(0, MVT::i1); 43715c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola SDOperand Node; 43725c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola switch(Op) { 43735c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola default: 43745c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola assert(0 && "Unknown Op"); 43755c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMCPY: 43765c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43775c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43785c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMMOVE: 43795c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemmove(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43805c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43815c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMSET: 43825c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemset(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43835c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43845c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola } 43855c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola DAG.setRoot(Node); 43861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43887041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43897041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43907041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 43931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 43941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4396495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4397c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4398c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4399495a0b51915eb763576874f29192820b731edc22Chris Lattner} 44001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4401c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4402bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 44031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 44045f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 44055f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 44065f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 44071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 44081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4409832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 44101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 44121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4413ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling) 4414ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 4415ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 4416ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands // Mark landing pad. 4417ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 44189fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 44199fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 44201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4421edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4422ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4423ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4424ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4425ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4426ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4427ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4428ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4429ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4430f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4431f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4432f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4433f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4434f40708223e409a152834b1553c6883ff2035b957Duncan Sands 44351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 44361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4438571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4439571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4440571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 444118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4442d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 444318c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4444d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4445d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4446b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT); 4447b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(SrcVT); 4448b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Regs(NumRegs); 4449b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 4450b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4451b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the value by legal parts into sequential virtual registers. 4452532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT); 445327a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4454b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chains[i] = DAG.getCopyToReg(getRoot(), Reg + i, Regs[i]); 4455b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 44561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4458068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 445915699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4460068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 44611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 446215699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 44630afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4464bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4465bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4466bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4467bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4468bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4469bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4470bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4471bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4472f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4473bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4474bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4475251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4476251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4477251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4478bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4479bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 44800afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4481bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4482bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4483966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4484bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4485068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4486068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4487f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4488f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4489f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(!FLI.MBBMap[SrcBB]->isLandingPad() && 4490f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Copying catch info out of a landing pad!"); 4491f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4492cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4493f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4494f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4495f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4496f40708223e409a152834b1553c6883ff2035b957Duncan Sands FLI.CatchInfoFound.insert(I); 4497f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4498f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4499f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4500f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4501c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 450248abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4503c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4504c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4505c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4506c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4507c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4508c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 4509c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 4510c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 4511c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4512c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4513c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 4514c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 4515c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer BI = prior(DAG.allnodes_end()); BI != BE; --BI) { 4516c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 4517c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 4518c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpCall(static_cast<SDNode*>(BI), 0); 4519c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 4520c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 4521c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 4522c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 452348abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 4524c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 4525c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (isMarkedTailCall && 4526c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer (Ret==NULL || 4527c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG))) { 4528c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 4529c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 4530c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 4531c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer E=OpCall.Val->op_end(); I!=E; I++, idx++) { 4532c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 4533c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 4534c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer else 4535c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 4536c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4537c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 4538c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4539c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4540c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4541c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 4542c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4543068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4544068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4545f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 45465f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo); 4547068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4548068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4549edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4550bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4551ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4552bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 45531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 45551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 45561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4557f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 45589fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 4559f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (ExceptionHandling && MMI && BB->isLandingPad()) { 4560f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4561f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4562f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4563f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4564f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.getConstant(LabelID, MVT::i32))); 4565f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4566e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4567e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4568e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4569e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4570e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4571e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4572e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4573e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4574f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4575f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4576f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4577f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4578cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4579cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4580cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4581cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4582cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4583cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4584cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4585f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4586f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4587f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4588f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4589f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4590cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4591f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4592f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4593f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4594f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4595f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 45969fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45979fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45989fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 46001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 46011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 46021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4603f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 46041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4605f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 46061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4607f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 46089f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 46091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4610ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4611571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 46121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 46151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 46161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 46171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 46181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 46191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4620edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 46218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 46221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 46241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4625d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 46268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 46278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 46288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 46298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 46308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4631532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4632532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 46331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 46341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4635d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 46368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4637d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 46388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 46398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 46408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 46418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 46428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 46438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 46451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 46461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 46481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 46491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 46501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 46518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 46528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 46538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 46548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 46568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 46573f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 46588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 46598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 46608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 46618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 46628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 46641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 46668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 46678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 46688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 46698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 46708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 46718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 46728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 46738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 46757e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 46761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 46798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 46808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 46817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4682b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 46838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 46848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 46851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 46871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4688ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 46895a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 46907436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 46917436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 46927436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 46937436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 46947436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 46957436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 46967436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 46977436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 46987436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 46997436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 47007436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 47017436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4702bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4703bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4704ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4705ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 47061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4707f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4708a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4709f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 471037efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4711f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4712f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 47133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 47143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 47154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 47164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 47174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4718a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4719a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 4720c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4721c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 4722c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 4723c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 4724c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 4725c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 47261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 47271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4728f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4729417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 4730417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4731417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4732af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 47335f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 47342300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4735417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 47361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4737f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 47381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 47391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 474001d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#if 0 // Enable this some day. 474101d029b82cb08367d81aa10cdc94d05360466649Chris Lattner DAG.LegalizeTypes(); 474201d029b82cb08367d81aa10cdc94d05360466649Chris Lattner // Someday even later, enable a dag combine pass here. 474301d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#endif 4744ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4745f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4746832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 47471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4748f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4749af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 47505f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 47512300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4752417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 4753417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4754417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4755a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4756552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4757a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4758a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 47591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4760f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4761832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 47621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4763f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4764f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4765f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4766f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4767f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4768f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 476944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4770f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4771f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4772f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4773f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4774f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 47751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4776f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4777f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4778f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 47794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 47814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 47824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 47834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 47844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4785f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4786a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 47871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 47884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4789f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4790f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4791f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4792f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 479309e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4794f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4795f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4796f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 47971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 48004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 48014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 48024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 48045f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 48054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 48074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 48094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 48104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 48175f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo); 48184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 48204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 48214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 48224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 48234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 48244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 48274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 48284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 48334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 48344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 48374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 48384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 48394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 48404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 48414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 48424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 48434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 48444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 48454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 48464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent); 48478085bcfdca515a359c746ea475a3b8e9cac1c077Anton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 48484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB); 48494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 48514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 48534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 48544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 48554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 48564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(cBB); 48574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48629453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 48639453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 48649453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 48653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 48663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 48673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 48683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 48705f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 48713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 48733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 48753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 48763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 48803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 48825f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo); 488337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 48843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 48853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 488637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 48873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 48883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 48893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 48903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 489137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 489237efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 489337efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 489437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 489537efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 489637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 48974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 48983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 489909e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 49003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4901f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 49024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4903f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 490409e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4905f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 490637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 490737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 490837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 490937efe6764568a3829fee26aba532283131d1a104Nate Begeman 4910b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4911b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4912b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4913b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4914b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4915b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4916b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4917b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4918b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4919b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4920b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4921b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4922f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4923f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4924d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 492544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4926f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 49275f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo); 4928d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4929f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4930f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4931f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4932d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4933f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4934f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4935f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4936f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4937d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4938d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4939d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4940d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4941d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 494257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4943d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4944d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4945d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4946d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4947d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4948d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4949d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4950d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4951d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4952d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4953d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4954f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4955d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4956d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 495757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 495857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4959d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4960d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 49612452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 496257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4963f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 496457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4965a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 49661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4967a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 496813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4969a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4970a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4971a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4972a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4973a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 497413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4975eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 497613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 497713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4978eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 49799373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 49804ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 498113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 49829ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4983a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 49843e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 49853e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 49863e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4987cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4988a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 49890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 499003fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 49919ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 49929ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 49939ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 49949ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4995755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4996755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4997755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4998755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4999755480681c795d585c73556c028b6143c46bda86Chris Lattner 5000755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5001755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5002755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5003755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5004755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 5005dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 5006755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 5007755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 5008755480681c795d585c73556c028b6143c46bda86Chris Lattner 5009755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5010755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5011755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5012755480681c795d585c73556c028b6143c46bda86Chris Lattner 5013755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 5014755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 5015755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5016755480681c795d585c73556c028b6143c46bda86Chris Lattner 5017755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5018755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 5019755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 5020ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5021755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5022755480681c795d585c73556c028b6143c46bda86Chris Lattner 5023755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5024755480681c795d585c73556c028b6143c46bda86Chris Lattner 5025755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5026755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5027755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5028755480681c795d585c73556c028b6143c46bda86Chris Lattner 5029755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5030755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5031755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5032755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5033755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 5034dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 5035755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 5036755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 5037755480681c795d585c73556c028b6143c46bda86Chris Lattner 5038755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5039755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5040755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5041755480681c795d585c73556c028b6143c46bda86Chris Lattner 5042755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 5043755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 5044755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5045755480681c795d585c73556c028b6143c46bda86Chris Lattner 5046755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5047755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 5048755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 5049755480681c795d585c73556c028b6143c46bda86Chris Lattner 5050755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 5051ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5052755480681c795d585c73556c028b6143c46bda86Chris Lattner 5053755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5054755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5055755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5056755480681c795d585c73556c028b6143c46bda86Chris Lattner 5057755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5058755480681c795d585c73556c028b6143c46bda86Chris Lattner 5059755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5060755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5061755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5062755480681c795d585c73556c028b6143c46bda86Chris Lattner 50639ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 50640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 50650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 50660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 50670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 50680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 50690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 50700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 50720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 50730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 50750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 50760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 50770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 50790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 50800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 50810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 50820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 50830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 50840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 50850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 50860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 50870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 50880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5089832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 50900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 50910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 50944b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 509536d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 50964b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 50970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 50980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 50990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 51030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 51040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 51050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5106794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 51071997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5108