SelectionDAGISel.cpp revision 9ce2e9d5a07cb3e0176cb32838231243829d67c5
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// 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(); 264514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(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); 5026f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall, 503070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 504dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 508f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 512dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 516dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 520dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 53337efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 536f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 538b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 539b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 542e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5435fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 5461628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 54801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 549b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5501628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5527f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 5531628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 5551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 5577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 5587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 5597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 5607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 5617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 5627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 5637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 5647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 56524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5663822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5673822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 56845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 56945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 5703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5842bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5852bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5863e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 587c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 598fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 599c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6000eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6077041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyFromParts - Create a value that contains the 6226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified legal parts combined into the value they represent. 6236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 6246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 6256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 6266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 6276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 6286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE) { 6296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 6306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val = Parts[0]; 6316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the top part. 6336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 6346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts == 2 && 6356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Cannot expand to more than 2 elts yet!"); 6366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Hi = Parts[1]; 637532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 6386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::swap(Val, Hi); 6396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 6406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Otherwise, if the value was promoted or extended, truncate it to the 6436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // appropriate type. 6446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT == ValueVT) 6456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return Val; 6466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 6486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 649a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 650a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman } 651a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman 652a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman if (MVT::isVector(ValueVT)) { 653a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman assert(NumParts == 1 && 654a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorElementType(ValueVT) == PartVT && 655a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 656a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial scalar-to-vector conversions should get here!"); 657a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 6586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isInteger(PartVT) && 6616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isInteger(ValueVT)) { 6626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (ValueVT < PartVT) { 6636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // For a truncate, see if we have any information to 6646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // indicate whether the truncated bits will always be 6656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // zero or sign-extension. 6666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (AssertOp != ISD::DELETED_NODE) 6676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(AssertOp, PartVT, Val, 6686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getValueType(ValueVT)); 6696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 6706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 6716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 6726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isFloatingPoint(PartVT) && 6766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) 6776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 6786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::getSizeInBits(PartVT) == 6806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) 6816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 6826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 6846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 6876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 6886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 6896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 6906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 6916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 6926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 6936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 6956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 6966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == Parts[0].getValueType() && 6976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Part type doesn't match part!"); 6986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Assemble the parts into intermediate operands. 7006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 7016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumIntermediates == NumParts) { 7026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, truncate or copy the value, 7036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 7046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 7056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 706532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 7086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, build the intermediate operands 7096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // from the parts. 710be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman assert(NumParts % NumIntermediates == 0 && 7116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 712be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman unsigned Factor = NumParts / NumIntermediates; 7136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 715532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 7196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // operands. 7206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(MVT::isVector(IntermediateVT) ? 7216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::CONCAT_VECTORS : 7226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::BUILD_VECTOR, 723be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman ValueVT, &Ops[0], NumIntermediates); 7246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 7256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyToParts - Create a series of nodes that contain the 7276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified value split into legal parts. 7286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 7296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 7306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 7316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 732532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman MVT::ValueType PartVT) { 73325ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 73425ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 7356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 7366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 7386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the parts. 7396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 7406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 7416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[i] = DAG.getNode(ISD::EXTRACT_ELEMENT, PartVT, Val, 74225ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 743532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 7446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::reverse(Parts, Parts + NumParts); 7456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If there is a single part and the types differ, this must be 7496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // a promotion. 7506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 7516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 7526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && 7536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Not a vector-vector cast?"); 7546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 755a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman } else if (MVT::isVector(ValueVT)) { 756a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman assert(NumParts == 1 && 757a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorElementType(ValueVT) == PartVT && 758a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 759a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 760a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 761a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 7626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 7636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT < ValueVT) 7646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::TRUNCATE, PartVT, Val); 7656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 7666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::ANY_EXTEND, PartVT, Val); 7676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isFloatingPoint(PartVT) && 7686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) { 7696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 7706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::getSizeInBits(PartVT) == 7716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) { 7726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 7736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 7746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 7756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 7786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 7826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 7836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 7846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 7856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 7866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 7876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 7886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 7896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 7916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 7926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 7946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 7956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 7976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 7986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 7996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 80025ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 8016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 8026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 8036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 80425ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 8056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 8066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 8076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 8086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 8096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 8106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 811532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 8126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 8136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 8146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 8156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 8166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 8176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 8186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 819532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 8206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 8236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 824199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 825199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 826199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 827199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 828199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 829199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 830199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 831199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 832199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 8330da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 8340da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 8350da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 836199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 837199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 838199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 839199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 840199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 8419d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 84223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 84323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 8447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR of undef nodes. 8459d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 84623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 84723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 84823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 849bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 85023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 85123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 85223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 8537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return N = DAG.getNode(ISD::BUILD_VECTOR, VT, 855bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 856199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 85743421b3dd70af5b70e71816521f37502c397cc65Dale Johannesen return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 8589d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 859199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 860199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 861199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 862199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 863199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 86407a96765daedf180a7102d39fe56c499878312b7Dan Gohman // the vector constant. 865bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 8669d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 8672bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 8682bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 869199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 87007a96765daedf180a7102d39fe56c499878312b7Dan Gohman assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!"); 871199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 872199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 873199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 874199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 875199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 876199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 877199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 878199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 8797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR node. 8807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], 8820da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 883199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 884199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 8856b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 886199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 887199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 888199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 889199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 890199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 891199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 892199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 893199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 894199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 895199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 896251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 897251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 898199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 899b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 900b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(VT); 901b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 902b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> Regs(NumRegs); 903b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 904b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Regs[i] = InReg + i; 905b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 906b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegsForValue RFV(Regs, RegisterVT, VT); 907b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 908b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 909b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 910199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 911199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 912199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 9131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 9141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 915a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 9161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 9171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 918bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 919ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 920ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 921ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 922ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 923ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 9246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // the full width of a register, since getCopyToParts and Legalize will use 9256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // ANY_EXTEND rather than sign/zero. 9268e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 9278e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 928ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 929ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 930ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 931ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 932ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 933ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 934ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 935afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands const Function *F = I.getParent()->getParent(); 936bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 937afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F->paramHasAttr(0, ParamAttr::SExt)) 9388c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 939afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F->paramHasAttr(0, ParamAttr::ZExt)) 94047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 941376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 9426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(RetOp); 9436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 9456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType VT = RetOp.getValueType(); 9466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 9476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT = TLI.getRegisterType(VT); 9486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 949532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT); 9506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i < NumParts; ++i) { 9516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(Parts[i]); 9526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 954ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 9551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 956bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 957bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 9581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 9591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 960571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 961571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 962571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 963571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 964571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 965571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 966571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 967571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 968571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 969571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 970571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 971571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 972571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 973571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 9748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 9758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 9768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 9778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 9788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 9798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 9808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 9818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 9848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 9888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 9898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 9908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 9918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 9948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 9988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 10008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 10016a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 10026a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 10036a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 10046a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 10056a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 10066a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1007571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1008571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1009571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1010571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1011571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1012571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1013571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1014e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1015571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1016e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1017e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 10186a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 10196a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 10206a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1021571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1022571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1023e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1024e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1025e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1026e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 10275a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 10285a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 10295a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 10305a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 10315a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1032e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1033e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1034e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1035e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1036e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1037e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1038e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1039e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1040e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1041e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1042e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1043e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1044e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1045e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1046e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1047e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1048e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1049e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1050e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1051e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1052e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1053e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1054e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1055e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1056e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1057e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1058e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1059e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1060e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1061e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1062e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1063e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1064e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1065e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1066e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1067e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1068e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1069e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1070e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1071e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1072e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1073e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 10740da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1075e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1077571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1078571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 10795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1080571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1081571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1082571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1083571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1084571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 10856b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 10865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1087571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1088571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1089571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1090571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1091d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1092d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1093571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1094571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1095571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1096571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1097d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1098d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1099d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1100d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1101d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1102d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1103d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1104d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1105571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1106d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1107d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1108d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1109d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1110d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1111d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1112d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1113d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1114d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1115d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1116d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1117d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1118d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1119d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1120d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1121d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1122d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1123d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1124d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1125d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1126d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1127d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1128571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1129571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1130df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1131df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1132df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1133df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1134df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1135df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1136df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11370ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 11380ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 11390ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 11400ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 11410ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 11420ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 11430ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 11440ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 11450ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1146df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1147df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1148df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 11501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 11511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 11521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 11541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 11551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 11561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 11571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 11581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 11601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 11611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1162a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1163dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 116457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 116557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 116657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 116757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 116857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 116957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 117057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 117157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 117257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 117357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1174571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1175571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1176571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1177571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1178571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1179571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1180571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1181571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1182571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1187571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1190571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1191571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1192d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1193571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1194571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 11950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 11960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 11970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 11980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 11990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1200df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1201df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1202df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1203df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1204df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1205df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1206df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1207df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1208df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1209df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1210df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 12115a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 12125a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 12130ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 12140ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 12150ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 12160ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 12170ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1218df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1219571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1220571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 12212452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 12222452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 12236b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 12245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 12252452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 12262452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 12272452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 12281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1230f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1231f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1232f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 123357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 123457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 123557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 12365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 12375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 12385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 12395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 12405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 12415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 12425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 12435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 12445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 12455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 12465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 12475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 12495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 12515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 12525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 12545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 12553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 12575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 12585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 12605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 12615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 12625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1266f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1267f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1268f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1269f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1270f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1271f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1272f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1274f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 127557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 127657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1277f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1278f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1279f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1280f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 128157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 128257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1283f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1284f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1285f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 128657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1287f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 128857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 128957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1290f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1291f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 12923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 129337efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 129437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1295f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 129637efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 12973d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 12983d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 12993d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 13003d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 13013d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 130237efe6764568a3829fee26aba532283131d1a104Nate Begeman} 130337efe6764568a3829fee26aba532283131d1a104Nate Begeman 13043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 13053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 13063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 13073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 13083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 13093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 13103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 13113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 13123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 13153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 13173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 13183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 13193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 13203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 13217f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 13223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 13233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 13253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 13283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 13293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 13313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 13323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 13333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 13353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 13363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 13433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 13453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 13463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 13483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 13493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 13514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 13524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 13553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 13574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 13584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 13594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 13604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 13614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 13644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 13664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 13684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 13694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 13717f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 13724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 13734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 13754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 13774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 13784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 13794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 13804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 13834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 13844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 13864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 13874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 13944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 13964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 13974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 13984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 14004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 14014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 14034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 14044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 14064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 14074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 14094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 14104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 14114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 14124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 14134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 14144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 14164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 14174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 14184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 14194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 14204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 14214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 14224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 14234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 14244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 14264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 14274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 14284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 14294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 14304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 14314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 14334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 14344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 14354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 14364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 14374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 14394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 14404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 14424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 14433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1444b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1445b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1446b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1447f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 14489fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1449fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1450fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1451fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 14526f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1453f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1454f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1455f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1456f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1457f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1458f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 1459f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second)); 1460f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 14619fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1462f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 1463f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1464f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1465070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1466f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1467f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1468f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1469b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1470b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1471b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1472b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1473b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1475b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1476dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1477b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1478b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1479b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1480dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1481dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1482dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1483dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 14844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1485dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 14865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1487b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1488b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1489b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1491b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1492b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1494b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1495b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1496b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1497b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1498b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1502b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 15045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1506b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1507b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 15085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1509b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1518b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1522b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1526b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1527b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 15305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 15315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 15325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 15335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 15345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 15355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 15375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 15385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 15405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1543b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1544b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1547b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1548b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1549b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1550b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1551b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1553dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1554dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1555b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15577294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 15587294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 15597294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 15607294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 15617294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1562b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1563dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1564b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1565b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1566b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1567dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1568dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1569dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 15715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 15725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 15745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 15765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1577dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15787294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1579dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1580dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 15825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1583dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1584dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 15865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 15874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 15885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1589b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1590b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1591dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1592b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1593b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1594b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1595b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1596b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1597b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1598b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1599b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1600b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1601b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1602b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1603b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1604b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1605b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1606b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1607b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1608b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1609b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1610b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1611b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 16124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1613b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1614b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1615b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 16175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 16185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 16195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 16205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 16225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 16235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 16245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1625b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1626b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1627b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1629b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1630b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 16315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1634b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1636b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1637b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1638b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1639b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1643b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1644b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1645b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1646f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1649b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1651b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1652b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1653b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1654dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1655b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1656b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1658b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1659dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1662b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1663b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1664b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1666b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1667b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1668b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1669b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1670b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1671b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1672b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1673b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1674b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1675b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1676b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1677b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1678b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1679b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1680b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 16815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 16825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 16834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 16845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1685b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1686b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1687b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 16885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 16895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 16905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 16915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 16925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 16945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 16954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 16964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 16974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1698b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 16995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 17005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 17015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 17024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1703b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1704b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 170554e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 17064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 17074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 17084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 17094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 17104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 17114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1712b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1715b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 17185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1719b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17207294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 17217294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 17227294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 17237294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 17247294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 17257294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1726b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1727b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1728b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1730b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1731b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1732b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1734b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1736b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 17395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 17405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 17415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 17425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1744b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1745b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1746b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1747b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1748b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1749b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1750b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1751b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1752b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1753b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 17545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 17555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 17565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1757b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1759b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1760b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1761b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1763b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1764b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 17665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 17675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1768b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1769b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1770b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1771b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1772b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1773dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1774dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1775b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1776b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 17833ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1784b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 17884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 17924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 17964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 17984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 17994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 18054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 18064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 18074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 18094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 18124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 18134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 18154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 18164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 18174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 18184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 18194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 18204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 18214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 18224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1823ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 18244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 18254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 18264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 18274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 18304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 18314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 18334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 18344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 18354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1836e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 18374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 18384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 18394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 18404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 18434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 18444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 18464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 18474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 18484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 18494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 18504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 18524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 18534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 18544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 18554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 18584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 18594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 1861e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 18624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 18634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 18674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 18694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 18714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 18724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 18734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 18754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 18774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 18784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 18794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 18804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 18834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 18844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 18854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 18864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1889efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 18904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 18914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 18934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 18944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 18964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 18984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 18994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 19025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 19035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 19045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 19055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 19075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 19115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 19125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1913b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 19145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 19165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 1917a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 1918a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 191927a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 19205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 19215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 19225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 19235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 19245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 19265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 19275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 19285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 19295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 19305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 19315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 19325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 19365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 19375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 19385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 19395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 19425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 19435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1945f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1946f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1947f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1948c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 19495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1950d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1951f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1952f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 19535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1954f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1955c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1956f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1957d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1958f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1959d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1960c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1961d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1962f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1963f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1964f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1965f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1966f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1967f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 19685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 19695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 19705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 19715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1972c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1973f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1974f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1975f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 19765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 197737efe6764568a3829fee26aba532283131d1a104Nate Begeman 19783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1979b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 19803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 19813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 19833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 19843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 19853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 19863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 19884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 19894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 19913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1992dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1993dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1994dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 19963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 19973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1998dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1999dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2000dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2001dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2002dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2003dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2004f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2005f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2006f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 20073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2008b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2009b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 201024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 20119d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 20127f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 20137f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 20147f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2015c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2016c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 20179e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2018c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2019c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2020c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2021c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2022c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2023c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 20247f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20267f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20277f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 202801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 20299e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 203001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 203101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 203201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 203301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 20347f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 20367f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2037b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2038b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 20397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 20401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 20411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 204224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 204324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 20441628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 20451628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2046e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2047e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2048e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2049e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 20517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2052832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2053832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2054832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2055e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 20571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 205945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2060e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2061e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2062e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2063e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2064e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2065e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2066e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 206745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2068e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 206945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 207045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 207145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 207245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 207345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 207445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 207545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 207645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 207745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 207845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 207945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 208045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 208145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 208245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 208345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 208445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 208545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 208645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 208745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2088e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2089e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2090e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2091e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2092e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2093e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2094e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2095e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2096e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2097e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2098e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2099e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2100e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2101e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2102e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2103e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2104e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2105e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2106e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2107e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2108e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2109e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2110e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2111e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2112e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 211345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 211445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2115e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 211645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 211745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2118e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2119e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2120e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2121e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2122e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 21231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 21261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 21271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 21281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 21297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 21307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 21311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 21353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 21363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 21393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 21423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 21443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 21473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 21503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 21523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 21553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 21583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 21623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 21653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 21693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 21723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 21733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 21763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 21793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 21803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 21833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 21863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 21903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 21933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 21973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 22003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 22013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 22021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2203e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 220428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 22063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 22073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 22083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 22113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 22123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 22153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 22163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 22173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 22193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 22213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 22223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 22253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 22283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 22323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 22333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 22343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 22353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 22371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22392bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2240c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2241c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2242c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2243c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2244c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 22467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2248c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2249c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22502bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2251384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2252384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2253384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 22547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2255384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2256384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2257c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22583e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 22593e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 22603e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 22613e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 22623e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 22647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 22663e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 22673e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22683e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 22701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 22711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 22721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2276c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2277b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2280b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 22811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2282dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 22831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 22851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 22861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 22877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22887c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 22897c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2290b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 229147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2292a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 22937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 22947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 22967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22977c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2298a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 22997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 23007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23017c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 23027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 23037c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 230447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 23057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 23067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 23077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 23097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 23107c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 23117c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 23127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 23136b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 23141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23157c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 23161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 23197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 23207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 23241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 23271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 23281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 23291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 23301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 23311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2333514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 233458092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2335d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 233658092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 233968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 234068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 234168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 234268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 234368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 23441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 234568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 23461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 23471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23484515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 23494515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 23504515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 23511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 23521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 23534515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 23541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 23554515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 23564515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 23574515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 23584515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 23594515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(StackAlign-1)); 23604515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 23614515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 23624515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(~(uint64_t)(StackAlign-1))); 23631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2364bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2365f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2366f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2367f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 23680da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 23690da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 23701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 23721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 23731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 23741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 23771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2378edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2379d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2380d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2381d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2382d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2383d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2384d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2385d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 238628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2387466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 238895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 238928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 239028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 239128b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2392466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 239395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 239495c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 23957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 23967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 23977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2398d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 239928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2400d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2401d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2402d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 240328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 240428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 24051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 24091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 24101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 24111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 24120b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 241395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 24141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24160eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 24170eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 24180eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 24190eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2420a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2421a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2422a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 24230eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2424bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2425e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2426e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2427e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2428e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2429e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2430e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2431e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2432e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24330eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24340eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 24350eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 24360eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24370eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 24380eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 24390eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 24400eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 24410eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 24420eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 24430eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24440eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24450eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 24460eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24470eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 24487f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 24499d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 24500eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 24510eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24520eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 24530eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 24540eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24550eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24560eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 24570eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 24580eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24590eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 24600eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 24610eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2462f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2463f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 24640eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 246548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 246648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2467f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2468f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 246948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2470f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2471f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 247248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2473f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2474f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 247548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2476e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2477e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2478e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2479e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2480e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2481e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2482e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24830eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24849d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 24857f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 24867f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 24870eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24880eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 24890eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24900eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24910eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2492b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2493cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2494b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2495b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 2496cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (GV || isa<ConstantPointerNull>(V) && 2497cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2498cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2499cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2500cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2501f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2502cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2503f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2504f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2505f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2506f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2507f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2508f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2509f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2510f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2511f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2512f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2513f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2514f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2515cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2516cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2517cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2518cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2519cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 25206590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2521cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2522cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2523cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2524cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2525cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2526cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2527cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2528cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2529cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2530cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 25316590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 25326590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 25336590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 25346590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 25356590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 25366590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 25376590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 25386590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 25396590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 25406590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 25416590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2542cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2543cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2544cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2545f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2546cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2547cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2548cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2549cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2550cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2551f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2552cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2553f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2554f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2555c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2556c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2557c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2558c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2559c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2560c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 25610eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 25620eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 25630eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 25640eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2565c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2566c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2567c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2568bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2569bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2570bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2571bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2572bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2573bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2574bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2575bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2576c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2577d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2578c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2579c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2580d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2581c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 258203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 258303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 258403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 258503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 258603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 258703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 258803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 258903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 259003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 259103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 259203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 259303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2594c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 259586cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 259644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 259743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 259844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2599bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 260036ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2601bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2602bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2603bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2604ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 260544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2606ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 260743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 260843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2609bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2610bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2611ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2612bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 261386cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 261443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2615b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 261636ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 261743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 261844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 261943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 262044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 262144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 26221ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2623bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 262443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 262543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2626b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 262743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 262843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 262944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 263043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 263144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 263244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 26331ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2634bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 263543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 263643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2637b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 263843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 263943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 264044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 264143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 264244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 264344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 264444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 26451ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2646bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 264743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 264843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2649b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 265043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 265244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 265343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 265444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 26550892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2656bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 265744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 265843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 266043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 266143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2662c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2663b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2664e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (ExceptionHandling) { 2665902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (!CurMBB->isLandingPad()) { 2666902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception register as live in. Hack for PR1508. 2667902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionAddressRegister(); 2668902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2669902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands } 2670735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2671735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2672735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2673735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2674735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2675735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2676735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 26777a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 267864ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2679735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2680b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2681b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2682b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 26838806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 26848806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2685b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 26868806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 26878806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 26888806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 2689ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2690f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2691f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2692e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2693f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2694f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2695f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2696902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2697902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2698902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2699e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2700735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2701735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 27028806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2703735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2704735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2705735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2706735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2707735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2708735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 27097a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 27108806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2711b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2712b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2713b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2714b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 27158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 27168806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 27178806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2718b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27198806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 27208806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2721735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2722735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2723735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2724cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 27253b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2726735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 27278806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 27287a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2729f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 27308806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2731b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2732b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2733b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2734b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2735b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 27362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 27372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27382365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MMI && ExceptionHandling) { 27402365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 27412365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 27422365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 27432365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getRoot(), 27442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 27452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 27462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 27472365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 27482365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27492365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27502365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27512365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27522365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27532365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 27542365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 27552365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 27562365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27572365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27582365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27592365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27602365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27612365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 27622365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (ExceptionHandling) { 27632365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 27642f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov SDOperand CfaArg; 27652f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 27662f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::TRUNCATE, 27672f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27682f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov else 27692f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 27702f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27712f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov 27722365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov SDOperand Offset = DAG.getNode(ISD::ADD, 27732365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27742365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 27752f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy()), 27762f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg); 27772365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getNode(ISD::ADD, 27782365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27792365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAMEADDR, 27802365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27812365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getConstant(0, 27822365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy())), 27832365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov Offset)); 27842365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 27852365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 27862365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27872365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27882365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27892365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27902365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27919ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 2792c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2793c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2794c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2795c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 27969ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 27976ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 27986ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 27996ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 28006ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 28016ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2802ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 2803ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 2804ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2805ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2806ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2807ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 2808ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 2809ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2810ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2811ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2812ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 2813ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 2814ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2815ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 2816ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 2817ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2818c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 2819c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 2820c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 2821c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2822c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 28238b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 2824bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2825f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 2826f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 2827f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 28288b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 28298b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 283051b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 28318b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 2832c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 28333f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 2834f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 2835f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 2836f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 2837f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 2838f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 2839f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 28403f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 2841addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 2842a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 2843d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 2844d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 2845d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 2846d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 2847a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 2848a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2849a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2850a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 2851a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2852c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2853a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2854a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 2855a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2856a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2857a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 2858a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2859c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2860a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2861a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 2862a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 2863a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 2864a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 2865a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 2866c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 2867a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 2868140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 2869bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 2870f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 2871f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 2872140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 2873140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 2874140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 2875140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 287639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 287739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 287839a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 2879140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 288039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 2881ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 2882ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 2883ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 288424e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner 288524e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 288624e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 288724e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 288836397f50343639ce9a25996f2d790c656791ab92Duncan Sands 288936397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 289036397f50343639ce9a25996f2d790c656791ab92Duncan Sands const Function *F = 289136397f50343639ce9a25996f2d790c656791ab92Duncan Sands cast<Function>(IntrinsicInst::StripPointerCasts(I.getOperand(2))); 289236397f50343639ce9a25996f2d790c656791ab92Duncan Sands 289336397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 289436397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 289536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 289636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 289736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 289836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 289936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 290036397f50343639ce9a25996f2d790c656791ab92Duncan Sands 2901f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 2902f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 2903f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 2904f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 2905f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 2906f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 2907f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 290836397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 290936397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 2910917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 2911917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov setValue(&I, DAG.getNode(ISD::FLT_ROUNDS, MVT::i32)); 2912917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 2913917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 2914c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2915c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2916c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2917c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 29186f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sandsvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee, 29191da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2920070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 29216f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 2922735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 2923070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2924070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 29256f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 2926735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2927735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 29286f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 29296f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 29306f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 29316f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands SDOperand ArgNode = getValue(*i); 29326f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 29336f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 29346f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 29356f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 29366f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 29376f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 29386f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 29396f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 29406f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 2941735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2942735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2943735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2944481dc721c37a3da0b3cc88191d01fe5b523625eeDuncan Sands bool MarkTryRange = LandingPad || 2945481dc721c37a3da0b3cc88191d01fe5b523625eeDuncan Sands // C++ requires special handling of 'nounwind' calls. 29466f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands (CS.doesNotThrow()); 2947481dc721c37a3da0b3cc88191d01fe5b523625eeDuncan Sands 2948481dc721c37a3da0b3cc88191d01fe5b523625eeDuncan Sands if (MarkTryRange && ExceptionHandling && MMI) { 2949070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 2950070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 2951070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 2952070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2953070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(BeginLabel, MVT::i32))); 2954070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 29556f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 2956735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 29576f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 29586f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 29596f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 2960735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 29616f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 29626f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 2963735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2964070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2965481dc721c37a3da0b3cc88191d01fe5b523625eeDuncan Sands if (MarkTryRange && ExceptionHandling && MMI) { 2966070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 2967070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 2968070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 2969070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2970070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(EndLabel, MVT::i32))); 2971070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 29726f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 2973070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 2974070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2975735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2976735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2977735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 29781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 297964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2980c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 298187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 2982c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2983c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2984c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2985c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 298687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 298787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 298887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 298987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 299087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 299187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 299287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 299387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 299487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 299587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 299687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 299787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 299887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 299987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 300087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 300187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 300287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 300387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 300487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 300587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 300687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 300787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 300887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 30092f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 30102f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 301187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 301287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 301387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 301487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 301587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 301687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 301787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 301887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 301987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 30202f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 30212f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 302287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 302387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 302487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 302587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 302687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 302787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 302887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 302987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 303087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 30312f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 30322f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 303387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 303487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 303587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 303687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 303787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 303887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3039f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3040c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 304187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3042ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3043fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3044ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3045c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3046edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 304764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 304864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 304964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 305064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 305164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3052070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 30536f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 30541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 30551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3056735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3057b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3058b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3059b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3060b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3061b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3062b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag)const{ 3063b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the legal parts from the registers. 3064b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3065b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 306627a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3067b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3068b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT, *Flag) : 3069b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT); 3070b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(1); 3071b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3072b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(2); 3073b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[i] = Part; 3074b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3075b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3076b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Assemble the legal parts into the final value. 3077532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman return getCopyFromParts(DAG, &Parts[0], NumParts, RegVT, ValueVT); 3078b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3079b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3080b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3081b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. 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 Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3085b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3086b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 3087b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3088b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 3089532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Val, &Parts[0], NumParts, RegVT); 3090b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3091b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 309227a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3093b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3094532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag) : 3095532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 3096b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(0); 3097b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3098b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 3099c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3100c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3101864635ad7b3046d3042311423071152c613961deChris Lattner 3102c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3103c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3104c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3105c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 31069f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 31074b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 31084b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 3109c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 3110c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 3111c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3112864635ad7b3046d3042311423071152c613961deChris Lattner 3113864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3114864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3115864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3116864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 31179b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 31189b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 3119f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3120f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 31219b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 31229b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 3123f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3124f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 31259b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 31269b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 31279b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 31289b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 31299b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 31309b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3131f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3132f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3133f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3134f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3135f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3136f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3137f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3138f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 31399b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 31409b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 31419b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3142f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 31439b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3144864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3145864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3146864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3147864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 31489b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 31499b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3150f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3151f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3152f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3153f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3154f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3155f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3156f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3157864635ad7b3046d3042311423071152c613961deChris Lattner } 3158f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3159864635ad7b3046d3042311423071152c613961deChris Lattner} 3160864635ad7b3046d3042311423071152c613961deChris Lattner 3161bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3162bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3163bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3164bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 3165bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstruct AsmOperandInfo : public InlineAsm::ConstraintInfo { 3166bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintCode - This contains the actual string for the code, like "m". 3167bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string ConstraintCode; 3168bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3169bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintType - Information about the constraint code, e.g. Register, 3170bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// RegisterClass, Memory, Other, Unknown. 3171bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ConstraintType; 3172bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3173bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallOperand/CallOperandval - If this is the result output operand or a 3174bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// clobber, this is null, otherwise it is the incoming operand to the 3175bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// CallInst. This gets modified as the asm is processed. 3176bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 3177bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Value *CallOperandVal; 3178bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3179bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner /// ConstraintVT - The ValueType for the operand value. 3180bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ConstraintVT; 3181bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3182e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3183e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3184e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3185e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3186bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner AsmOperandInfo(const InlineAsm::ConstraintInfo &info) 3187bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner : InlineAsm::ConstraintInfo(info), 3188bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType(TargetLowering::C_Unknown), 3189bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CallOperand(0,0), CallOperandVal(0), ConstraintVT(MVT::Other) { 3190bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3191bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3192bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner void ComputeConstraintToUse(const TargetLowering &TLI); 3193e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3194e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3195e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3196e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3197e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 3198e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs) const { 3199e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isOutReg) 3200e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OutputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3201e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (isInReg) 3202e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner InputRegs.insert(AssignedRegs.Regs.begin(), AssignedRegs.Regs.end()); 3203e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3204bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3205bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3206bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3207bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// getConstraintGenerality - Return an integer indicating how general CT is. 3208bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnerstatic unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) { 3209bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner switch (CT) { 3210bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner default: assert(0 && "Unknown constraint type!"); 3211bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Other: 3212bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Unknown: 3213bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 0; 3214bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Register: 3215bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 1; 3216bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_RegisterClass: 3217bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 2; 3218bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner case TargetLowering::C_Memory: 3219bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return 3; 3220bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3221bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3222bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3223bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnervoid AsmOperandInfo::ComputeConstraintToUse(const TargetLowering &TLI) { 3224bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner assert(!Codes.empty() && "Must have at least one constraint"); 3225bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3226bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner std::string *Current = &Codes[0]; 3227bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType CurType = TLI.getConstraintType(*Current); 3228bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (Codes.size() == 1) { // Single-letter constraints ('r') are very common. 3229bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3230bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3231bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner return; 3232bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3233bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3234bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned CurGenerality = getConstraintGenerality(CurType); 3235bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3236bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // If we have multiple constraints, try to pick the most general one ahead 3237bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // of time. This isn't a wonderful solution, but handles common cases. 3238bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner for (unsigned j = 1, e = Codes.size(); j != e; ++j) { 3239bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner TargetLowering::ConstraintType ThisType = TLI.getConstraintType(Codes[j]); 3240bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned ThisGenerality = getConstraintGenerality(ThisType); 3241bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (ThisGenerality > CurGenerality) { 3242bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // This constraint letter is more general than the previous one, 3243bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner // use it. 3244bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurType = ThisType; 3245bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner Current = &Codes[j]; 3246bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner CurGenerality = ThisGenerality; 3247bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3248bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3249bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3250bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintCode = *Current; 3251bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner ConstraintType = CurType; 3252bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} 3253bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3254bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3255e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 3256e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris LattnerGetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 3257864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 32584e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3259e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3260e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3261e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3262e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3263e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3264e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3265e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3266e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3267e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3268e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3269e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3270e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3271e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3272e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3273e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3274e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3275e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3276e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3277e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3278e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3279e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3280e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3281e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3282e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3283e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3284864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3286e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3287e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3288e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3289e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3290e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3291864635ad7b3046d3042311423071152c613961deChris Lattner 3292bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3293bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3294b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3295864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3296bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3297864635ad7b3046d3042311423071152c613961deChris Lattner 3298bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 32992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 33002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3301864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3302bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3303864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3304cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3305cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3306cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3307cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3308cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3309864635ad7b3046d3042311423071152c613961deChris Lattner 3310864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3311864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3312864635ad7b3046d3042311423071152c613961deChris Lattner 3313864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3314864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3315864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3316864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3317864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3318864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3319864635ad7b3046d3042311423071152c613961deChris Lattner 3320864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3321864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3322864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3323864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3324864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3325864635ad7b3046d3042311423071152c613961deChris Lattner } 3326864635ad7b3046d3042311423071152c613961deChris Lattner } 3327e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3328e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3329e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3330864635ad7b3046d3042311423071152c613961deChris Lattner } 3331864635ad7b3046d3042311423071152c613961deChris Lattner 33322a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 33332a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 33342a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3335c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3336c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 33372a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 33382a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 33392a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3340e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3341e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3342e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3343e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3344e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 33452a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 33463a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3347bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 33483a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 33492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 3351bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SSARegMap *RegMap = MF.getSSARegMap(); 33522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 33532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner Regs.push_back(RegMap->createVirtualRegister(PhysReg.second)); 33542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 3355e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3356e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3357e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 33582a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 33592a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 33612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 33622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 33632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 33642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 33652a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 33662a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 33672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3368bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3369bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 33702a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3371e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 33724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 3373864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3374864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3375864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 33764e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3377864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3378864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3379864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3380864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3381864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3382864635ad7b3046d3042311423071152c613961deChris Lattner } 3383864635ad7b3046d3042311423071152c613961deChris Lattner 33844e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 33854e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3386c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 3387c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner RC = isAllocatableRegister(Reg, MF, TLI, MRI); 3388c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3389c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3390c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3391c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3392c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 33934e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 33944e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3395864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3396864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3397864635ad7b3046d3042311423071152c613961deChris Lattner 3398e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3399864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3400864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3401864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3402864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3403e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3404e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3405864635ad7b3046d3042311423071152c613961deChris Lattner 3406e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(), 3407e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3408e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs); 3409e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3410864635ad7b3046d3042311423071152c613961deChris Lattner } 34114e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3412864635ad7b3046d3042311423071152c613961deChris Lattner 3413864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3414e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 34154e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 34164e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 34173ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3418ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3419ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3420fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 3421fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 3422ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34230c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 34240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<AsmOperandInfo> ConstraintOperands; 3425ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3426ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3427ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3428ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 34294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 34300c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 34320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 34330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 34340c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3435e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3436e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3437e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3438e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3439e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3440e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3441fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 34420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 34430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i])); 34440c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands.back(); 34450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34460c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 34471efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 34480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 34490c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 34501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 34510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 34520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // The return value of the call is this value. As such, there is no 34530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // corresponding argument. 3454fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3455fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpVT = TLI.getValueType(CS.getType()); 34561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 3457fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 34581efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 34591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34601efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 3461fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 34621efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34631efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 34640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 34651efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34661efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 34670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 34680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 3469eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 34700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 3471eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (isa<BasicBlock>(OpInfo.CallOperandVal)) 3472eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = 3473eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen DAG.getBasicBlock(FuncInfo.MBBMap[cast<BasicBlock>(OpInfo.CallOperandVal)]); 3474eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 3475eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 3476eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 3477eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 3478eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 3479eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 3480eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 3481eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3482eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If OpTy is not a first-class value, it may be a struct/union that we 3483eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 3484eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (!OpTy->isFirstClassType() && OpTy->isSized()) { 3485eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 3486eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 3487eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 3488eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 3489eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 3490eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 3491eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 3492eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 3493eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 3494eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 3495eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 34966995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 3497eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3498eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 34990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35011efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 35020c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 35032a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 35043ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 35053ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 35061efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3507e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3508e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 350909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 351009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 351109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 351209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 351309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 351409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 351509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 351609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 351709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 351809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 351909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 352009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 352109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 352209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 352309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 352409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 352509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 352609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 352709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 352809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 352909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 353009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 353109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 3532514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 353309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 353409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 353509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 353609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 353709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 353809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 353909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 354009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 354109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 354209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 354309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 354409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 354509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 354609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3547e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3548e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3549e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3550e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 35510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 35530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3555e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3556e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3557e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 3558e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 3559e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3560e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3561e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3562e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3563e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3564e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3565e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 35660c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 35670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 35680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 35690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 35700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 35710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35722cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 35730f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 35740f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3575864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 35760c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3578864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 35790f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 35800c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 35810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 35821efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 35830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 35842cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3585c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3586c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3587f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 358809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 358922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 359022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 359122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3592c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3593c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 359409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 359522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 359622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 359722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 35982a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 359922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3600864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3601864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3602e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3603832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 36040c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3605d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3606d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 36072cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 36080c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 36090c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3610864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 36112cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 3612fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3613e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 36142cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3615e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 36160c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 36172cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 36186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 36206656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3621e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3622e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 36236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 36246656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 36256656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 36260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 36273d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 36280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 36292223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 36302223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 36310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 36323d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3633c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3634c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3635c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3636c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3637c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3638c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3639c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3640a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3641a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3642c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3643c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3644c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3645c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3646c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3647c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3648527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3649527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3650527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3651527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3652527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3653527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3654527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3655527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3656527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3657527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3658c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3659527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3660b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 3661527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3662527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3663527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3664527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3665527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3666c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 366787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 366887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 36692a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 36700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 367144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 367244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 367348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 367448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 367548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 367648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 3677832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 36780c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 367953069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 368053069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3681c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 368287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 368348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 3684c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3685c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 368648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 368787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 36882a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 368909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 369044b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 369144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 369244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 369387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 369487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3695c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3696c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 369787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3698c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 36992223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 370087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 37012a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 37022a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 37032a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 37040c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 370544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 370687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 370787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3708e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3709e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 371087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3711b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 371287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3713e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3714e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37156656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37166656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3717c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3718c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3719c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3720e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3721e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3722e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37246656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3725c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 37266656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3727ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3728ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3729ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3730ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3731ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3732f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3733f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3734bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3735ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3736ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 37386656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 37393a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 3740b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 37413a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37423a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 37433a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 37447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 37457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 3746fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands const VectorType *VTy = cast<VectorType>(CS.getType()); 37477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 37483a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 37503a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37513a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3752fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 37533a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 37566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37576656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 37586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 37596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3760864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 37616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3762b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 3763864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 37646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3765ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3767bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 37686656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 37690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 37706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 37718b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 37726656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3773bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3774bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3775ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3776ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3777ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3778ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 37801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 37811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 378368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 378468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 378568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 378668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 378768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 37881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3790514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 37911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 37921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 37931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 379447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 379547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 379647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 379747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 379847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3799cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3800cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 380147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3802cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3803cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3804cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3805cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 380947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 381047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 381147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 381247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 381347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 38141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3815cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 381647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3817cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3818cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3821025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3822025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3823025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3824025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3825025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3826025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3827025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3828832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3829832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3830832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3831025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3832025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3833025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3834025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 383539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3836acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3837acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3838acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 383939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 384039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 38411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3842acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3843acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3844acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3845acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3846acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 38471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3850acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3851acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3852acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 38531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3856acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3857acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3858acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3859acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3860acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 38611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3863fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3864fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3865f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3866f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3867fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3868fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3869fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3870fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 38718c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3872fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3873fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3874fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3875fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3876fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 38776aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3878ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3879ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3880fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3881d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 38827aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3883d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 38847aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3885ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3886ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 3887afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ZExt)) 3888d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 3889afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::SExt)) 3890d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 3891afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::InReg)) 3892d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 3893afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::StructRet)) 3894d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3895afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ByVal)) { 38961aa7efbd2c98e761f50992197473304b99257ca9Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 3897594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 3898594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 3899588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 3900588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 3901514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands unsigned StructSize = getTargetData()->getABITypeSize(STy); 3902594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 3903594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 3904594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 3905afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::Nest)) 390636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 3907d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3908ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3909fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3910fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3911fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3912fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3913b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3914fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3915fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3916fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3917b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3918fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3919b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman case Expand: { 3920b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If this is an illegal type, it needs to be broken up to fit into 3921b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // registers. 3922b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 3923b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 3924b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3925b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetVals.push_back(RegisterVT); 3926b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // if it isn't first piece, alignment must be 1 3927b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (i > 0) 3928b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3929b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 3930b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3931fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3932fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3933fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3934b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3935fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 39363b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 39378c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3938fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3939fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3940f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3941f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3942bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 394327a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 394427a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 3945fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3946fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3947fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3948fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 394947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 395047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 395147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3952fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3953fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3954fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3955fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3956fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3957fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3958fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3959fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3960fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3961fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 3962afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(Idx, ParamAttr::SExt)) 3963f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3964f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3965afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 3966f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3967f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3968fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3969fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3970fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3971fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3972fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3973fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3974fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3975fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 397627a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 397727a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 397827a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 397927a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 398027a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned j = 0; j != NumParts; ++j) 398127a70be55f8b63181598d144d034b396402be66eDan Gohman Parts[j] = SDOperand(Result, i++); 3982532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT)); 3983fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3984fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 398527a70be55f8b63181598d144d034b396402be66eDan Gohman } 3986fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 398727a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 3988fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3989fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3990fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3991f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3992f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3993f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3994f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3995f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3996f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 399747857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 399847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3999f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 4000f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4001f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4002be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4003f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4004f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4005f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4006f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4007f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4008f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4009f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4010f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 401147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 401247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4013d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 40147aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4015d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 40160db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4017d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4018d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 4019d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4020d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 40210db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4022d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 40230db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4024d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 402521485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 402621485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 402721485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 402821485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 4029588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 4030588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 4031514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands unsigned StructSize = getTargetData()->getABITypeSize(STy); 403221485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 403321485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 403421485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 403536397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 403636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 4037d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 40380db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4039f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 4040f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 40417aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 4042f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4043b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4044f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4045f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 4046f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 4047d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 4048d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4049d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 4050d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 4051d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 4052d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 4053d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 4054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 4055f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4056f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 4057849f214a4e3676e41168b0c5398165c4d4fb99f8Dale Johannesen Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 4058f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4059f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4060b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4061f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 406227a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 406327a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 406427a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 406527a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 4066532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT); 406727a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 406827a70be55f8b63181598d144d034b396402be66eDan Gohman // if it isn't first piece, alignment must be 1 406927a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned MyFlags = Flags; 407027a70be55f8b63181598d144d034b396402be66eDan Gohman if (i != 0) 407127a70be55f8b63181598d144d034b396402be66eDan Gohman MyFlags = (MyFlags & (~ISD::ParamFlags::OrigAlignment)) | 407227a70be55f8b63181598d144d034b396402be66eDan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 407327a70be55f8b63181598d144d034b396402be66eDan Gohman 407427a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(Parts[i]); 407527a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(DAG.getConstant(MyFlags, MVT::i32)); 4076f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4077f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4078f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 407927a70be55f8b63181598d144d034b396402be66eDan Gohman } 4080f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4081f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4082f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 4083b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType VT = getValueType(RetTy); 4084b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4085b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4086b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<MVT::ValueType, 4> RetTys(NumRegs); 4087b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4088b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetTys[i] = RegisterVT; 4089f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4090f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 4091f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4092b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4093be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4094b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getVTList(&RetTys[0], NumRegs + 1), 4095be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4096b15e49597f031fdd41fdec2887a3c24c0ea430d8Chris Lattner Chain = Res.getValue(NumRegs); 4097b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4098b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4099b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 4100b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::NodeType AssertOp = ISD::AssertSext; 4101b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!RetTyIsSigned) 4102b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 4103b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 4> Results(NumRegs); 4104b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4105b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Results[i] = Res.getValue(i); 4106532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Res = getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, AssertOp); 4107f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4108b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4109b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4110f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4111f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 411250381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4113171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4114171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4115d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4116171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4117171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 41180aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 41190aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 41200aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 41210aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 41220aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 41230aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 41240aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 412574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 41261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 41271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 4128a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 41291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 41301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 41311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 41321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 41351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 41391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 41411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 41441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 41451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 41461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 41471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 41521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 415574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 415674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 415774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 415874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 415974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 416074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 416174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 4162b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned MSB = MVT::getSizeInBits(VT) / 8; 416374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 416474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 416574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4166a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 416774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 416874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 416974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 417074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 417174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 41721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 41731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 41741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 41751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 41761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 41771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4179c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 418080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 418180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4182c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4183c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4184c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 41851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 41861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 41881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 41911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 41921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 41951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 41961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 41981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 41991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 42011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 42021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 42031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 420680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 420780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 420880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 420980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 42101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 421180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 421280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 421380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4214dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 42151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 4216b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 42171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 42181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 42191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 42201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 422180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 422280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 422380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 422480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 42251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 42261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 42271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 422880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 422980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 42301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42327041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 42331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 42341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 42351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 42361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 42371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 42381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 42391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42405f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // If the source and destination are known to not be aliases, we can 42415f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // lower memmove as memcpy. 42425f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (Op == ISD::MEMMOVE) { 42438806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov uint64_t Size = -1ULL; 42445f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 42455f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Size = C->getValue(); 42465f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 42475f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis::NoAlias) 42485f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Op = ISD::MEMCPY; 42495f43f92c69aae9837064cf08291db1b36a82789fDan Gohman } 42505f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 42511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 42521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 42531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 42551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4256bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 42571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4258ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 42591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4260c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4261c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 426280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 42631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 42641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 42651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 4266b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 4267a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4268786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4269864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 42708b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4271c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4272c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4273c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4274c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4275c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4276c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4277c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4278c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4279c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4280c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4281cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 428274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 428374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4284cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 428574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 428674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 428774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 428874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 428974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 429074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 429174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4292cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 429374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 429474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 429574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4296f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 42970937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4298cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4299cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4300cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4301cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4302cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 430374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 430474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4305c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4306c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4307b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 430874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 430974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4310cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 431174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 431274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 431374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4314786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4315786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43168b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 431774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 431874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 4319984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4320984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling I.getOperand(2), SrcOff, false, Align); 432174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 432274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4323786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4324786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 4325984e986929c34f9fa41ad33e3a4f19816f80c1adBill Wendling I.getOperand(1), DstOff, false, Align); 432674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4327c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 432874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 432974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 43301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4332c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 43331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4335c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4336c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4337bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4338bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4339c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4340c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 43411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 43435c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola SDOperand AlwaysInline = DAG.getConstant(0, MVT::i1); 43445c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola SDOperand Node; 43455c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola switch(Op) { 43465c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola default: 43475c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola assert(0 && "Unknown Op"); 43485c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMCPY: 43495c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43505c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43515c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMMOVE: 43525c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemmove(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43535c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43545c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola case ISD::MEMSET: 43555c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola Node = DAG.getMemset(getRoot(), Op1, Op2, Op3, Op4, AlwaysInline); 43565c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola break; 43575c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola } 43585c0d6ed325417baa5d119af9c2b6790231d8565fRafael Espindola DAG.setRoot(Node); 43591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43617041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43627041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43637041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 43661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 43671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4369495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4370c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4371c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4372495a0b51915eb763576874f29192820b731edc22Chris Lattner} 43731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4374c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4375bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 43761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 43775f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 43785f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 43795f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 43801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 43811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4382832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 43831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 43851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4386ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling) 4387ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 4388ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 4389ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands // Mark landing pad. 4390ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 43919fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 43929fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 43931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4394edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4395ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4396ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4397ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4398ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4399ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4400ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4401ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4402ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4403f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4404f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4405f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4406f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4407f40708223e409a152834b1553c6883ff2035b957Duncan Sands 44081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 44091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4411571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4412571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4413571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 441418c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4415d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 441618c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4417d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4418d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4419b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT); 4420b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(SrcVT); 4421b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Regs(NumRegs); 4422b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 4423b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4424b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the value by legal parts into sequential virtual registers. 4425532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT); 442627a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4427b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chains[i] = DAG.getCopyToReg(getRoot(), Reg + i, Regs[i]); 4428b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 44291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4431068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 443215699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4433068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 44341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 443515699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 44360afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4437bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4438bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4439bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4440bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4441bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4442bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4443bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4444bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4445f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4446bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4447bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4448251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4449251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4450251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4451bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4452bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 44530afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4454bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4455bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4456966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4457bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4458068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4459068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4460f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4461f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4462f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4463cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4464f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4465f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4466f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4467560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4468560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4469f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4470f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4471f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4472f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4473c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 447448abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4475c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4476c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4477c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4478c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4479c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4480c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 4481c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 4482c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 4483c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4484c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4485c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 4486c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 4487c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer BI = prior(DAG.allnodes_end()); BI != BE; --BI) { 4488c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 4489c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 4490c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpCall(static_cast<SDNode*>(BI), 0); 4491c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 4492c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 4493c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 4494c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 449548abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 4496c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 4497c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (isMarkedTailCall && 4498c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer (Ret==NULL || 4499c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG))) { 4500c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 4501c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 4502c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 4503c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer E=OpCall.Val->op_end(); I!=E; I++, idx++) { 4504c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 4505c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 4506c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer else 4507c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 4508c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4509c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 4510c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4511c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4512c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4513c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 4514c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4515068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4516068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4517f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 45185f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo); 4519068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4520068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4521edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4522bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4523ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4524bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 45251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 45281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4529f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 45309fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 4531f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (ExceptionHandling && MMI && BB->isLandingPad()) { 4532f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4533f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4534f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4535f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4536f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.getConstant(LabelID, MVT::i32))); 4537f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4538e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4539e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4540e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4541e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4542e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4543e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4544e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4545e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4546f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4547f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4548f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4549f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4550cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4551cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4552cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4553cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4554cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4555cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4556cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4557f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4558f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4559f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4560f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4561f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4562cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4563f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4564f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4565f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4566f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4567f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 45689fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45699fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45709fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 45721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 45731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 45741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4575f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 45761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4577f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 45781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4579f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 45809f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 45811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4582ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4583571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 45841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 45871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 45881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 45891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 45901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 45911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4592edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 45938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 45941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 45961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4597d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 45998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 46008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 46018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 46028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4603532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4604532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 46051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 46061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4607d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 46088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4609d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 46108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 46118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 46128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 46138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 46148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 46158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 46171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 46181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 46201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 46211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 46221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 46238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 46248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 46258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 46268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 46288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 46293f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 46308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 46318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 46328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 46338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 46348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 46361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 46388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 46398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 46408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 46418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 46428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 46438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 46448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 46458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 46468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 46477e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 46481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 46518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 46528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 46537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4654b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 46558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 46568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 46571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 46591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4660ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 46615a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 46627436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 46637436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 46647436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 46657436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 46667436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 46677436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 46687436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 46697436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 46707436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 46717436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 46727436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 46737436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4674bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4675bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4676ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4677ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 46781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4679f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4680a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4681f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 468237efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4683f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4684f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 46853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 46863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 46874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 46884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 46894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4690a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4691a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 4692c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4693c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 4694c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 4695c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 4696c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 4697c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 46981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4700f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4701417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 4702417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4703417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4704af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 47055f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 47062300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4707417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 47081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4709f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 47101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 47111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 471201d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#if 0 // Enable this some day. 471301d029b82cb08367d81aa10cdc94d05360466649Chris Lattner DAG.LegalizeTypes(); 471401d029b82cb08367d81aa10cdc94d05360466649Chris Lattner // Someday even later, enable a dag combine pass here. 471501d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#endif 4716ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4717f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4718832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 47191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4720f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4721af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 47225f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 47232300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4724417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 4725417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4726417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4727a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4728552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4729a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4730a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 47311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4732f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4733832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 47341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4735f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4736f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4737f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4738f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4739f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4740f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 474144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4742f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4743f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4744f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4745f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4746f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 47471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4748f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4749f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4750f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 47514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 47534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 47544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 47554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 47564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4757f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4758a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 47591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 47604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4761f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4762f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4763f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4764f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 47659ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 47669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 47679ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4768f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4769f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 47701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 47734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 47744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 47754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 47775f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 47784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 47804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 47834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 47905f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo); 47914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 47934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 47944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 47964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 47974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 48004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 48014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 48064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 48074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 48104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 48114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 48124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 48134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 48144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 48154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 48164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 48174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 48189ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48199ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48209ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 48219ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48229ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48239ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 48249ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 48254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 48274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 48294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 48304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 48319ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48329ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48339ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 48344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48399453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 48409453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 48419453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 48423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 48433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 48443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 48453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 48475f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 48483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 48503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 48523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 48533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 48573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 48595f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo); 486037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 48613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 48623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 486337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 48643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 48653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 48663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 48673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 486837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 486937efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 487037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 487137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 487237efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 487337efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 48744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 48753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 48769ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48779ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48789ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 4879f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 48804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4881f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 48829ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48839ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48849ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 488537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488837efe6764568a3829fee26aba532283131d1a104Nate Begeman 4889b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4890b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4891b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4892b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4893b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4894b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4895b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 48969ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 48979ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48989ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4899b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4900b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4901b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4902f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4903f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4904d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 490544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4906f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 49075f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo); 4908d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4909f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4910f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4911f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4912d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4913f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4914f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4915f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4916f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4917d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4918d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4919d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4920d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4921d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 492257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4923d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4924d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4925d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4926d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4927d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4928d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 49299ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 49309ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 49319ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 4932d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4933d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4934d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4935f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4936d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4937d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 493857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 493957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4940d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4941d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 49422452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 494357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4944f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 494557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4946a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 49471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4948a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 494913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4950a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4951a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4952a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4953a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4954a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 495513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4956eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 495713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 495813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4959eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 49609373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 49614ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 496213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 49639ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4964a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 49653e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 49663e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 49673e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4968cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4969a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 49700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 497103fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 49729ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 49739ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 49749ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 49759ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4976755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4977755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4978755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4979755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4980755480681c795d585c73556c028b6143c46bda86Chris Lattner 4981755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4982755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4983755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4984755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4985755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4986dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 4987755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4988755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4989755480681c795d585c73556c028b6143c46bda86Chris Lattner 4990755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4991755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4992755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4993755480681c795d585c73556c028b6143c46bda86Chris Lattner 4994755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4995755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4996755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4997755480681c795d585c73556c028b6143c46bda86Chris Lattner 4998755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4999755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 5000755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 5001ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5002755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5003755480681c795d585c73556c028b6143c46bda86Chris Lattner 5004755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5005755480681c795d585c73556c028b6143c46bda86Chris Lattner 5006755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5007755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5008755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5009755480681c795d585c73556c028b6143c46bda86Chris Lattner 5010755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5011755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5012755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5013755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5014755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 5015dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 5016755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 5017755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 5018755480681c795d585c73556c028b6143c46bda86Chris Lattner 5019755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5020755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5021755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5022755480681c795d585c73556c028b6143c46bda86Chris Lattner 5023755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 5024755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 5025755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5026755480681c795d585c73556c028b6143c46bda86Chris Lattner 5027755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5028755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 5029755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 5030755480681c795d585c73556c028b6143c46bda86Chris Lattner 5031755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 5032ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5033755480681c795d585c73556c028b6143c46bda86Chris Lattner 5034755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5035755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5036755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5037755480681c795d585c73556c028b6143c46bda86Chris Lattner 5038755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5039755480681c795d585c73556c028b6143c46bda86Chris Lattner 5040755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5041755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5042755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5043755480681c795d585c73556c028b6143c46bda86Chris Lattner 50449ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 50450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 50460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 50470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 50480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 50490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 50500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 50510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 50530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 50540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 50560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 50570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 50580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 50600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 50610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 50620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 50630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 50640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 50650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 50660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 50670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 50680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 50690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5070832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 50710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 50720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 50754b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 507636d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 50774b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 50780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 50790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 50800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 50840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 50850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 50860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5087794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 50881997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5089