SelectionDAGISel.cpp revision a7ac2bd4076096bb3a9986dd5a44f20c7f715518
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 51c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This file was developed by the LLVM research group and is distributed under 61c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 16c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 2944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey#include "llvm/CodeGen/MachineModuleInfo.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3237efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 34eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 37fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 43124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 46a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 477e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 517944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 52a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 53a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 55a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 56a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 573e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 583e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 593e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman cl::desc("Pop up a window to show SUnit dags after they are processed")); 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 613e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0; 627944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 637944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 64eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 77eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 78eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 79e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen ISHeuristic("pre-RA-sched", 803700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 81e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen cl::desc("Instruction schedulers available (before register allocation):")); 8213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 839ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 849373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 859373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 864ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 874ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 88bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { struct AsmOperandInfo; } 89bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 90864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 91864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 92864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 93864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 94864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 959525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 96b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// Regs - This list holds the register (for legal and promoted values) 97864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 98864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 99864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 100864635ad7b3046d3042311423071152c613961deChris Lattner 101864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 102864635ad7b3046d3042311423071152c613961deChris Lattner /// 103864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 104864635ad7b3046d3042311423071152c613961deChris Lattner 105864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 106864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 107864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 108864635ad7b3046d3042311423071152c613961deChris Lattner 109864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 110864635ad7b3046d3042311423071152c613961deChris Lattner 111864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 112864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 113864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 114864635ad7b3046d3042311423071152c613961deChris Lattner } 115864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 116864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 117864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 118864635ad7b3046d3042311423071152c613961deChris Lattner } 119864635ad7b3046d3042311423071152c613961deChris Lattner 120864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 121864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 122864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 123b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 124864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 125b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 127c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 130b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 132b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1389f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 139864635ad7b3046d3042311423071152c613961deChris Lattner }; 140864635ad7b3046d3042311423071152c613961deChris Lattner} 1414ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1589373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1599373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1609373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1619373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 164f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 165f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1799f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 186f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 187f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 188f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 189f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 190f40708223e409a152834b1553c6883ff2035b957Duncan Sands 1911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 194571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 195571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 196571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 197571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 198571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 199571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 200edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 2023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 211cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 212cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 213cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 214f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 2158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 2168806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 217f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 218f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 219f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 221f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 227f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 228571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 229f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 234bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 235f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 236f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 237bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 238bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 240f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 241bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 242bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 243bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 244bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 246edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 249bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 250bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 25116ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 25216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 253bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 254bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 256bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 257bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 258bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2592aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 262b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 264a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 265ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 266d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 267ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 268a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 269b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 270d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 2726266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2752aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2762aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2852aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 2988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 2998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 300c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 301b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 302c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 313b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 314b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 31595b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 3168c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman unsigned R = MakeReg(RegisterVT); 3178c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman for (unsigned i = 1; i != NumRegisters; ++i) 3188c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman MakeReg(RegisterVT); 3198c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3320da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 334d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 335d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 336d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 337d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 338d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 339d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 3405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 387b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 388b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 3895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 3915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 3934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 3945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 3955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 3965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 3975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 415a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 418f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 419f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 420f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 425f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 4315f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 432edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4335f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 4343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov FuncInfo(funcinfo) { 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 437a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 438a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 439a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 440d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 441d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 442edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 443d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 444d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 445d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 446d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 447d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 448d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 449d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 450d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 451bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 452bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 453d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 454d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 455d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 456a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 457a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 458571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand CopyValueToVirtualRegister(Value *V, unsigned Reg); 459571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4631e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 4641e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 478466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 47995c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 485199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4870da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4900da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4924e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 493e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void GetRegistersForValue(AsmOperandInfo &OpInfo, bool HasEarlyClobber, 494e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 495e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 496f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 497571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 498571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 499571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 501571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5021da20a71d1bbabc472f281208be77475550be751Jim Laskey void LowerCallTo(Instruction &I, 5031da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, unsigned CallingConv, 504070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov bool IsTailCall, SDOperand Callee, unsigned OpIdx, 505070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 506070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 510f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 514dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 518dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 519b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 520b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 521b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 522dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 523b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 524b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 525b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 530f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 53537efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 540b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 541b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 544e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5455fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 5481628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 55001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 551b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5521628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 5551628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 5571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 5597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 5607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 5617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 5627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 5637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 5647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 5657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 5667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 56724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 5683822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 5693822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 57045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 57145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 5723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 5733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 5743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 5753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 5763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 5773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 5783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 5793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 5803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 5813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 5823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 5833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 5843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5862bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5872bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5883e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 589c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 600ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 601c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6020eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6097041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 6101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyFromParts - Create a value that contains the 6246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified legal parts combined into the value they represent. 6256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 6266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 6276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 6286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 6296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 6306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE) { 6316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 6326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val = Parts[0]; 6336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the top part. 6356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 6366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts == 2 && 6376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Cannot expand to more than 2 elts yet!"); 6386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Hi = Parts[1]; 639532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 6406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::swap(Val, Hi); 6416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 6426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Otherwise, if the value was promoted or extended, truncate it to the 6456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // appropriate type. 6466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT == ValueVT) 6476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return Val; 6486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 6506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 6516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 6526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isInteger(PartVT) && 6556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isInteger(ValueVT)) { 6566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (ValueVT < PartVT) { 6576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // For a truncate, see if we have any information to 6586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // indicate whether the truncated bits will always be 6596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // zero or sign-extension. 6606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (AssertOp != ISD::DELETED_NODE) 6616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(AssertOp, PartVT, Val, 6626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getValueType(ValueVT)); 6636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 6646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 6656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 6666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isFloatingPoint(PartVT) && 6706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) 6716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 6726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::getSizeInBits(PartVT) == 6746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) 6756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 6766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 6786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 6796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 6816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 6826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 6836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 6846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 6856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 6866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 6876183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 6896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 6906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == Parts[0].getValueType() && 6916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Part type doesn't match part!"); 6926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 6936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Assemble the parts into intermediate operands. 6946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 6956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumIntermediates == NumParts) { 6966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, truncate or copy the value, 6976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 6986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 6996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 700532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 7026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, build the intermediate operands 7036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // from the parts. 704be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman assert(NumParts % NumIntermediates == 0 && 7056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 706be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman unsigned Factor = NumParts / NumIntermediates; 7076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 709532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman PartVT, IntermediateVT); 7106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 7136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // operands. 7146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return DAG.getNode(MVT::isVector(IntermediateVT) ? 7156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::CONCAT_VECTORS : 7166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman ISD::BUILD_VECTOR, 717be444ed6dbc2a6f36feab84b527a21aa0df9f808Dan Gohman ValueVT, &Ops[0], NumIntermediates); 7186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 7196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// getCopyToParts - Create a series of nodes that contain the 7216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman/// specified value split into legal parts. 7226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 7236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 7246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 7256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 726532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman MVT::ValueType PartVT) { 72725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 72825ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 7296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 7306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (!MVT::isVector(ValueVT) || NumParts == 1) { 7326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the value was expanded, copy from the parts. 7336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts > 1) { 7346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 7356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[i] = DAG.getNode(ISD::EXTRACT_ELEMENT, PartVT, Val, 73625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 737532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman if (!DAG.getTargetLoweringInfo().isLittleEndian()) 7386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman std::reverse(Parts, Parts + NumParts); 7396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If there is a single part and the types differ, this must be 7436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // a promotion. 7446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 7456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 7466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(MVT::isVector(ValueVT) && 7476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Not a vector-vector cast?"); 7486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 7496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 7506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT < ValueVT) 7516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::TRUNCATE, PartVT, Val); 7526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 7536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::ANY_EXTEND, PartVT, Val); 7546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::isFloatingPoint(PartVT) && 7556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::isFloatingPoint(ValueVT)) { 7566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 7576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (MVT::getSizeInBits(PartVT) == 7586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::getSizeInBits(ValueVT)) { 7596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 7606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 7616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(0 && "Unknown mismatch!"); 7626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 7656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 7666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 7696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 7706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 7716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 7726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 7736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 7746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 7756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 7766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 7786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 7796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 7816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 7826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 7836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 7846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 7856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 7866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 78725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 7886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 7896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 7906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 79125ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 7926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 7936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 7946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 7956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 7966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 7976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 798532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 7996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 8006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 8016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 8026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 8036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 8046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 8056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 806532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 8076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 8106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 811199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 812199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 813199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 814199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 815199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 816199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 817199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 818199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 819199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 8200da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 8210da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 8220da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 823199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 824199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 825199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 826199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 827199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 8289d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 82923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 83023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 8317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR of undef nodes. 8329d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 83323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 83423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 83523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 836bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 83723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 83823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 83923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 8407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return N = DAG.getNode(ISD::BUILD_VECTOR, VT, 842bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 843199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 84443421b3dd70af5b70e71816521f37502c397cc65Dale Johannesen return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 8459d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 846199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 847199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 848199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 849199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 850199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 85107a96765daedf180a7102d39fe56c499878312b7Dan Gohman // the vector constant. 852bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 8539d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 8542bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 8552bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 856199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 85707a96765daedf180a7102d39fe56c499878312b7Dan Gohman assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!"); 858199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 859199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 860199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 861199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 862199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 863199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 864199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 865199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 8667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR node. 8677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 8687f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], 8690da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 870199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 871199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 8726b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng return N = DAG.getConstant(cast<ConstantInt>(C)->getZExtValue(),VT); 873199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 874199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 875199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 876199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 877199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 878199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 879199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 880199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 881199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 882199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 883251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 884251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 885199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 886b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 887b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(VT); 888b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 889b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> Regs(NumRegs); 890b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 891b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Regs[i] = InReg + i; 892b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 893b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegsForValue RFV(Regs, RegisterVT, VT); 894b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 895b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 896b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 897199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 898199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 899199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 9001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 9011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 902a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 9031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 9041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 905bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 906ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 907ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 908ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 909ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 910ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 9116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // the full width of a register, since getCopyToParts and Legalize will use 9126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // ANY_EXTEND rather than sign/zero. 9138e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 9148e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 915ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 916ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 917ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 918ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 919ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 920ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 921ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 92247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer const FunctionType *FTy = I.getParent()->getParent()->getFunctionType(); 9235694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 924bcca3405bd6698af82eeed20e24744d0625aa1b3Reid Spencer ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 92518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt)) 9268c57dfb1aea24132bd5b58c4ed4893ea967ba131Reid Spencer ExtendKind = ISD::SIGN_EXTEND; 92718da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(0, ParamAttr::ZExt)) 92847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ExtendKind = ISD::ZERO_EXTEND; 929376dd212f9142cd0f0b03e0b6296b2df7208bb9aReid Spencer RetOp = DAG.getNode(ExtendKind, TmpVT, RetOp); 9306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(RetOp); 9316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 9336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType VT = RetOp.getValueType(); 9346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 9356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT = TLI.getRegisterType(VT); 9366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 937532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT); 9386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i < NumParts; ++i) { 9396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(Parts[i]); 9406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman NewValues.push_back(DAG.getConstant(false, MVT::i32)); 9416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 942ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 9431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 944bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 945bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 9461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 9471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 948571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 949571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 950571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 951571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 952571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 953571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 954571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 955571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 956571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 957571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 958571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 959571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner PendingLoads.push_back(CopyValueToVirtualRegister(V, Reg)); 960571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 961571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 9628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 9638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 9648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 9658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 9668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 9678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 9688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 9698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 9728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 9768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 9778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 9788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 9798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 9828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 9838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 9848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 9868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 9878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 9888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 9896a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 9906a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 9916a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 9926a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 9936a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 9946a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 995571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 996571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 997571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 998571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 999571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1000571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1001571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1002e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1003571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1004e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1005e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 10066a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 10076a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 10086a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1009571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1010571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1011e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1012e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1013e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1014e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 10155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 10165a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 10175a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 10185a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 10195a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1020e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1021e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1022e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1023e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1024e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1025e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1026e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1027e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1028e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1029e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1030e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1031e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1032e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1033e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1034e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1035e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1036e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1037e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1038e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1039e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1040e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1041e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1042e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1043e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1044e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1045e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1046e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1047e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1048e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1049e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1050e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1051e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1052e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1053e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1054e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1055e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1056e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1057e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1058e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1059e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1060e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1061e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 10620da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1063e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1064571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1065571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1066571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 10675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1068571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1069571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1070571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1071571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1072571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 10736b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 10745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1075571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1076571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1077571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1078571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1079d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1080d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1081571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1082571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1083571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1084571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1085d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1086d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1087d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1088d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1089d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1090d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1091d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1092d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1093571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1094d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1095d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1096d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1097d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1098d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1099d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1100d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1101d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1102d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1103d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1104d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1105d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1106d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1107d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1108d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1109d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1110d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1111d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1112d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1113d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1114d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1115d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1116571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1117571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1118df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1119df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1120df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1121df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1122df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1123df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1124df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11250ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 11260ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 11270ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 11280ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 11290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 11300ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 11310ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 11320ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 11330ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1134df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1135df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1136df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 11371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 11381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 11391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 11401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 11421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 11431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 11441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 11451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 11461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 11481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 11491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 1150a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1151dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 115257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 115357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 115457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 115557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 115657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 115757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 115857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 115957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 116057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 116157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 116257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1163571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1164571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1165571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1166571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1167571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1168571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1169571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1170571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1171571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1172571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1173571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1174571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1175571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1176571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1177571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1178571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1179571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1180571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1181d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1182571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 11840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 11850ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 11860ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 11870ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 11880ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1189df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1190df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1191df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1192df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1193df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1194df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1195df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1196df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1197df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1198df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1199df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 12005a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 12015a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 12020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 12030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 12040ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 12050ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 12060ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1207df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1208571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1209571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 12102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 12112452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 12126b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 12135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 12142452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 12152452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 12162452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 12171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1219f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1220f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1221f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 122257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 122357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 122457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 12255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 12265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 12275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 12285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 12295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 12305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 12315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 12325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 12335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 12345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 12355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 12365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 12385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 12405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 12415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 12435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 12443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 12455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 12465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 12475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 12485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 12495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 12505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 12515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 12535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 12545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1255f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1256f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1257f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1258f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1259f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1260f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1261f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1262f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1263f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 126457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 126557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1266f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1267f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1268f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1269f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 127057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 127157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1272f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1274f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 127557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1276f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 127757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 127857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1279f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1280f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 12813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 128237efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 128337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1284f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 128537efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 12863d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Index = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 12873d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 12883d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 12893d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 12903d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 129137efe6764568a3829fee26aba532283131d1a104Nate Begeman} 129237efe6764568a3829fee26aba532283131d1a104Nate Begeman 12933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 12943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 12953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 12963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 12973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 12983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 12993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 13003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 13013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 13043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 13063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 13073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 13083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 13093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 13107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 13113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 13123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 13143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 13173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 13183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 13203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 13213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 13223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 13243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 13253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 13323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 13343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 13353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 13373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 13383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 13393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 13404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 13414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 13443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 13454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 13464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 13474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 13484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 13494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 13504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 13514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 13524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 13534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 13554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 13564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 13574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 13584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 13607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 13614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 13624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 13644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 13664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 13674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 13684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 13694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 13714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand CopyTo = DAG.getCopyToReg(getRoot(), SwitchReg, SwitchVal); 13724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 13734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 13754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 13764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 13784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 13794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 13804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 13814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 13824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 13834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 13854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 13864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 13874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 13884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 13894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 13904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 13924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 13934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 13954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 13964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 13974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 13984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 13994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 14004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 14014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 14024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getCopyFromReg(getRoot(), Reg, TLI.getPointerTy()); 14034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 14054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 14064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 14074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 14084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultTy(), AndOp, 14094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 14104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 14114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 14124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 14134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 14154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 14164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 14174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 14184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 14194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 14204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 14224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 14234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 14244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 14254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 14264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 14284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 14294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 14304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 14314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 14323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1433b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1434b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1435b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1436f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 14379fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1438f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands LowerCallTo(I, I.getCalledValue()->getType(), 1439f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands I.getCallingConv(), 1440f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands false, 1441f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands getValue(I.getOperand(0)), 1442f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 3, LandingPad); 1443f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1444f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1445f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1446f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1447f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1448f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 1449f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(CopyValueToVirtualRegister(&I, VMI->second)); 1450f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 14519fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1452f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 1453f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1454f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1455070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1456f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1457f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1458f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1459b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1460b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1461b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1462b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1463b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 14645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1465b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1466dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1467b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1468b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1469b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1470dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1471dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1472dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1473dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 14744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1475dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 14765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1477b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1478b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1479b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1480b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1481b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1482b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1483b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1484b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1485b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1486b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1487b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1488b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1489b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1490b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1491b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1492b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1493b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 14945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1495b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1496b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1497b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 14985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1499b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1500b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1501b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1502b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1503b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1504b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1505b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1506b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1507b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1508b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1509b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1510b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1511b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1512b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1513b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1514b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1515b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1516b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1517b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 15185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 15205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 15215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 15225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 15235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 15245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 15255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 15275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 15285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 15295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 15305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1531b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1532b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1533b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1534b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1535b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1538b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1539b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1540b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1541b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1542b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1543dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1544dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1545b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1546b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 15477294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 15487294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 15497294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 15507294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 15517294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1552b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1553dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1555b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1557dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1558dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1559dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 15615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 15625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 15645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 15655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 15665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1567dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15687294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1569dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1570dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 15725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1573dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1574dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 15755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 15765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 15774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 15785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1579b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1580b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1581dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1582b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1583b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1584b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1585b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1586b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1587b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1588b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1589b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1590b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1591b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1592b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1593b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1594b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1595b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1596b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1597b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1598b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1599b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1600b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1601b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 16024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1603b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1604b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1605b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1606b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 16085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 16095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 16105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 16125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 16135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 16145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1615b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1617b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1619b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1620b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 16215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1622b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1623b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1624b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1625b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1626b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1627b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1628b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1629b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1630b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1631b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1634b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1636f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1637b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1638b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1639b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1643b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1644dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1645b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1646b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1649dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1651b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1652b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1653b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1654b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1655b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1656b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1658b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1659b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1662b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1663b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1664b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1666b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1667b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1668b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1669b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1670b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 16715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 16725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 16734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 16745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1675b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1676b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1677b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 16785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 16795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 16805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 16815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 16825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 16845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 16854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 16864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 16874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1688b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 16895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 16905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 16915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 16924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1693b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1694b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 169554e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 16964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 16974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 16984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 16994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 17014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1702b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 17034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 17044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1705b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 17085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1709b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17107294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 17117294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 17127294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 17137294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 17147294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 17157294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1716b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1717b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1718b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 17195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1720b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1721b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1722b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1723b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1724b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1725b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1726b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1727b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1728b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 17305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 17315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 17325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1734b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1736b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1739b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1740b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1741b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1742b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 17445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 17455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 17465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1747b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1748b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1749b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1750b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1751b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1752b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1753b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1754b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1755b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 17565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 17575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1759b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1760b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1761b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1763dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1764dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1766b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 17684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 17694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 17704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 17733ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1774b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 17884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 17894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 17924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 17964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 17984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 17994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 18054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 18064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 18074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 18094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 18104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 18114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 18124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1813ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 18144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 18154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 18164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 18174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 18184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 18204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 18214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 18234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 18244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 18254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1826e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 18274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 18284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 18294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 18304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 18334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 18344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 18364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 18374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 18384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 18394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 18404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 18424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 18434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 18444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 18454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 18484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 18494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 1851e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 18524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 18534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 18574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 18594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 18614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 18624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 18634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 18654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 18674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 18684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 18694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 18704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 18724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 18734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 18744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 18754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 18764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 18774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 1879efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 18804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 18814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 18834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 18844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 18864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 18884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 18894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov// Clusterify - Transform simple list of Cases into list of CaseRange's 18925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 18935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 18945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 18955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 18975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 18985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 18995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 19005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 19015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 19025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov sort(Cases.begin(), Cases.end(), CaseCmp()); 19045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 1907a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 1908a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 1909cfacc8f5d25f38112eee836530004f7816439765David Greene for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 19115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 19125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 19135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 19145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 19165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 19175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 19185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 19195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 19205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 19215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 19225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 19265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 19275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 19285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 19295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 19325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 1935f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 1936f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1937f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1938c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 19395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1940d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 1941f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 1942f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 19435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 1944f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 1945c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1946f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 1947d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 1948f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 1949d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 1950c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1951d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 1952f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 1953f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1954f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1955f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 1956f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 1957f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 19585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 19595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 19605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 19615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 1962c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 1963f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 1964f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 1965f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 19665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 196737efe6764568a3829fee26aba532283131d1a104Nate Begeman 19683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 1969b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 19703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 19713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 19733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 19743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 19753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 19763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 19774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 19784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 19794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 19813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 1982dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 1983dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1984dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 19863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 19873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 1988dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 1989dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 1990dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1991dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 1992dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 1993dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 1994f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1995f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 19973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1998b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1999b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 200024d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 20019d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 20027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 20037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 20047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2005c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2006c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 20079e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2008c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2009c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2010c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2011c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2012c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2013c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 20147f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20157f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20167f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20177f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 201801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 20199e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 202001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 202101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 202201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 202301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 20247f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 20257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 20267f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2027b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2028b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 20297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 20301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 20311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 203224d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 203324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 20341628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 20351628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2036e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2037e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2038e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2039e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 20417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2042832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2043832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2044832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2045e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 20461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 20471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 20481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 204945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2050e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2051e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2052e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2053e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2054e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2055e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2056e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 205745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2058e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 205945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 206045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 206145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 206245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 206345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 206445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 206545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 206645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 206745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 206845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 206945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 207045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 207145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 207245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 207345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 207445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 207545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 207645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 207745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2078e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2079e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2080e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2081e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2082e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2083e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2084e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2085e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2086e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2087e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2088e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2089e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2090e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2091e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2092e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2093e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2094e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2095e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2096e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2097e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2098e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2099e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2100e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2101e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2102e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 210345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 210445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2105e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 210645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 210745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2108e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2109e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2110e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2111e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2112e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 21131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 21161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 21171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 21181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 21197f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 21207f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 21211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 21221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 21233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 21253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 21263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 21293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 21323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 21343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 21373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 21403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 21413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 21423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 21453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 21483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 21523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 21553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 21563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 21593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 21623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 21633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 21663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 21693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 21703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 21733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 21763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 21803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 21833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 21843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 21853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 21873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 21883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 21893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 21903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 21913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 21921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2193e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 219428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 21953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 21963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 21973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 21983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 21993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 22013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 22023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 22053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 22063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 22073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 22093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 22113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 22123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 22143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 22153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 22183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 22223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 22233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 22243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 22253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 22263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 22271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22292bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2230c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2231c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2232c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2233c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2234c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 22367f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22377f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2238c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2239c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22402bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2241384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2242384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2243384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 22447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2245384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2246384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2247c7029805ef35ce9805931067b841e6af11db382eChris Lattner 22483e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 22493e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 22503e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 22513e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 22523e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22537f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 22547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 22557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 22563e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 22573e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22583e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 22591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 22601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 22611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 22621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 22641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 22651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2266c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2267b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 22681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 22691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2270b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 22711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 2272dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 22731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 22761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 22777c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22787c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 22797c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2280b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 228147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2282a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 22837c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 22847c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 22857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 22867c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2288a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 22897c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 22907c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22917c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 22927c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 22937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 229447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 22957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 22967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 22977c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 22987c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 22997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 23007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 23017c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 23027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 23036b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 23041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 23061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 23087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 23097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 23107c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 23111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 23131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 23141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 23171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 23181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 23191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 23201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 23211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2323a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 232458092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2325d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 232658092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 23271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 232968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 233068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 233168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 233268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 233368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 23341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 233568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23384515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 23394515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 23404515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 23411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 23421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 23434515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 23441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 23454515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 23464515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 23474515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 23484515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 23494515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(StackAlign-1)); 23504515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 23514515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 23524515779fa39481649780bdd24fc966e89ec76edfEvan Cheng getIntPtrConstant(~(uint64_t)(StackAlign-1))); 23531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2354bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[] = { getRoot(), AllocSize, getIntPtrConstant(Align) }; 2355f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2356f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2357f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 23580da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 23590da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 23601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 23621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 23631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 23641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 23671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2368edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2369d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2370d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2371d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2372d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2373d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2374d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2375d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 237628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2377466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 237895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 237928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 238028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 238128b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2382466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 238395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 238495c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 23857f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 23867f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 23877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2388d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 238928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2390d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2391d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2392d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 239328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 239428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 23951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 23991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 24001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 24011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 24020b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 240395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 24041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24060eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 24070eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 24080eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 24090eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 24100eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 24110eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 24120eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 24130eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24140eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2415e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 2416e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 2417e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 2418e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 2419e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 2420e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 2421e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 2422e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 2423e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 24240eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 24250eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 24260eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 24270eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 24287255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 2429e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 24300eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24310eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2432bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2433e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2434e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2435e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2436e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2437e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2438e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2439e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2440e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24410eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24420eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 24430eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 24440eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24450eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 24460eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 24470eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 24480eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 24490eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 24500eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 24510eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24520eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24530eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 24540eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24550eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 24567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 24579d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 24580eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 24590eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24600eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 24610eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 24620eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24630eade319cdb72e24c11d068728a98083737c6435Chris Lattner 24640eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 24650eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 24660eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24670eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 24680eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 24690eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2470f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2471f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 24720eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 247348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 247448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2475f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2476f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 247748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2478f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2479f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 248048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2481f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2482f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 248348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2484e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2485e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2486e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2487e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2488e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2489e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2490e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 24910eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 24929d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 24937f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 24947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 24950eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24960eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 24970eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 24980eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 24990eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2500b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2501cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2502b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2503b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 2504cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (GV || isa<ConstantPointerNull>(V) && 2505cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2506cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2507cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2508cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2509f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2510cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2511f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2512f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2513f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2514f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2515f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2516f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2517f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2518f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2519f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2520f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2521f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2522f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2523cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2524cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2525cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2526cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2527cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 25286590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2529cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2530cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2531cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2532cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2533cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2534cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2535cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2536cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2537cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2538cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 25396590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 25406590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 25416590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 25426590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 25436590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 25446590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 25456590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 25466590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 25476590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 25486590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 25496590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2550cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2551cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2552cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2553f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2554cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2555cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2556cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2557cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2558cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2559f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2560cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2561f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2562f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2563c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2564c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2565c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2566c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2567c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2568c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 25690eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 25700eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 25710eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 25720eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2573c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2574c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2575c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2576bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2577bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2578bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2579bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2580bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2581bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2582bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2583bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2584c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2585d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2586c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2587c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2588d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2589c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 259003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 259103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 259203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 259303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 259403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 259503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 259603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 259703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 259803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 259903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 260003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 260103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2602c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 260386cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 260444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 260543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 260644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2607bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 260836ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2609bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2610bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2611bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2612ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 261344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2614ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 261543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 261643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2617bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2618bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2619ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2620bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 262186cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 262243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2623b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 262436ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 262543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 262644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 262743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 262844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 262944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 26301ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2631bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.getConstant(LabelID, MVT::i32))); 263243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 263343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2634b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 263543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 263643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 263744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 263843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 263944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 264044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 26411ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2642bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 264343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 264443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2645b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 264643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 264743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 264844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 264943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 265044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && FSI.getSubprogram() && 265144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->Verify(FSI.getSubprogram())) { 265244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(FSI.getSubprogram()); 26531ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, 2654bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner getRoot(), DAG.getConstant(LabelID, MVT::i32))); 265543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2657b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 265843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 265943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 266044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 266143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 266244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && DI.getVariable() && MMI->Verify(DI.getVariable())) { 26630892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 2664bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) 266544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MMI->RecordVariable(DI.getVariable(), FI->getIndex()); 266643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 266743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 266843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 266943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2670c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2671b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 2672e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (ExceptionHandling) { 2673902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (!CurMBB->isLandingPad()) { 2674902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception register as live in. Hack for PR1508. 2675902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionAddressRegister(); 2676902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2677902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands } 2678735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EXCEPTIONADDR instruction. 2679735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 2680735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[1]; 2681735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = DAG.getRoot(); 2682735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 2683735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2684735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 26857a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 268664ce0ca90d358da4984a089404dc2dabe45d05f1Jim Laskey setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 2687735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2688b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2689b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2690b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 26918806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 26928806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2693b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 26948806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 26958806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 26968806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 2697ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling && MMI) { 2698f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2699f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2700e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2701f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2702f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2703f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2704902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2705902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2706902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2707e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2708735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2709735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 27108806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2711735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2712735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2713735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2714735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2715735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2716735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 27177a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 27188806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2719b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2720b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2721b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2722b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 27238806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 27248806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 27258806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2726b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27278806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 27288806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2729735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2730735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2731735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2732cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 27333b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2734735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 27358806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 27367a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2737f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 27388806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2739b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2740b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2741b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2742b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2743b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 27442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 27452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 27462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27472365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MMI && ExceptionHandling) { 27482365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 27492365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 27502365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 27512365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getRoot(), 27522365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 27532365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 27542365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 27552365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 27562365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27572365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27582365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27592365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27602365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27612365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 27622365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 27632365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 27642365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27652365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27662365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27672365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27682365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27692365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 27702365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (ExceptionHandling) { 27712365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 27722f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov SDOperand CfaArg; 27732f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 27742f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::TRUNCATE, 27752f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27762f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov else 27772f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 27782f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy(), getValue(I.getOperand(1))); 27792f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov 27802365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov SDOperand Offset = DAG.getNode(ISD::ADD, 27812365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27822365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 27832f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov TLI.getPointerTy()), 27842f597bd09ec0a55689c9fd6d8999bde4fdf8688eAnton Korobeynikov CfaArg); 27852365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getNode(ISD::ADD, 27862365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27872365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getNode(ISD::FRAMEADDR, 27882365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy(), 27892365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.getConstant(0, 27902365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov TLI.getPointerTy())), 27912365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov Offset)); 27922365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 27932365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 27942365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27952365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27962365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 27972365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 27982365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 27990b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 28000b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 2801317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::sqrt_f80: 2802317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::sqrt_f128: 2803317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::sqrt_ppcf128: 2804c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2805c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2806c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2807c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 28086ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f32: 28096ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner case Intrinsic::powi_f64: 2810317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::powi_f80: 2811317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::powi_f128: 2812317096ab3710fda0960be58804e9f80c800340f6Dale Johannesen case Intrinsic::powi_ppcf128: 28136ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 28146ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 28156ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 28166ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 28176ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner 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 } 2910c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 2911c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 2912c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2913c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 29141da20a71d1bbabc472f281208be77475550be751Jim Laskeyvoid SelectionDAGLowering::LowerCallTo(Instruction &I, 29151da20a71d1bbabc472f281208be77475550be751Jim Laskey const Type *CalledValueTy, 29161da20a71d1bbabc472f281208be77475550be751Jim Laskey unsigned CallingConv, 29171da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 2918070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov SDOperand Callee, unsigned OpIdx, 2919070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 29201da20a71d1bbabc472f281208be77475550be751Jim Laskey const PointerType *PT = cast<PointerType>(CalledValueTy); 2921735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 29225694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 2923070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 2924070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 2925070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2926735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 2927735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 2928735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.reserve(I.getNumOperands()); 2929735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey for (unsigned i = OpIdx, e = I.getNumOperands(); i != e; ++i) { 2930735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Value *Arg = I.getOperand(i); 2931735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand ArgNode = getValue(Arg); 2932735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Entry.Node = ArgNode; Entry.Ty = Arg->getType(); 29334fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands 29344fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands unsigned attrInd = i - OpIdx + 1; 29354fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::SExt); 29364fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isZExt = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ZExt); 29374fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isInReg = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::InReg); 29384fee7034d5a9dae46e78ff300fd6dbf2cdfcb8f9Duncan Sands Entry.isSRet = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::StructRet); 293936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Entry.isNest = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::Nest); 294021485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Entry.isByVal = Attrs && Attrs->paramHasAttr(attrInd, ParamAttr::ByVal); 2941735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 2942735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 2943735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 294457810cdac4c842b4b395d2a0b2fae406aacb3ee4Duncan Sands if (ExceptionHandling && MMI && LandingPad) { 2945070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 2946070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 2947070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 2948070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2949070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(BeginLabel, MVT::i32))); 2950070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2951070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2952735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 2953735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TLI.LowerCallTo(getRoot(), I.getType(), 295418da0720887527ed570e9703ae5f290beb491ee1Reid Spencer Attrs && Attrs->paramHasAttr(0, ParamAttr::SExt), 29551da20a71d1bbabc472f281208be77475550be751Jim Laskey FTy->isVarArg(), CallingConv, IsTailCall, 2956735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 2957735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (I.getType() != Type::VoidTy) 2958735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Result.first); 2959735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 2960070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 296157810cdac4c842b4b395d2a0b2fae406aacb3ee4Duncan Sands if (ExceptionHandling && MMI && LandingPad) { 2962070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 2963070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 2964070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 2965070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2966070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.getConstant(EndLabel, MVT::i32))); 2967070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 2968070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Inform MachineModuleInfo of range. 2969070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 2970070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 2971735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 2972735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2973735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 29741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 297564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 2976c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 297787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 2978c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 2979c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 2980c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 2981c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 298287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 298387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 298487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 298587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 298687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 298787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 298887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 298987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 299087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 299187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 299287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 299387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 299487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 299587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 299687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 299787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 299887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 299987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 300087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 300187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 300287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 300387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 300487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 30052f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 30062f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 300787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 300887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 300987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 301087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 301187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 301287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 301387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 301487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 301587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 30162f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 30172f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 301887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 301987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 302087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 302187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 302287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 302387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 302487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 302587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 302687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 30272f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 30282f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 302987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 303087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 303187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 303287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 303387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 303487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3035f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3036c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 303787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3038ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3039ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 3040ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3041c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3042edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 304364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 304464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 304564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 304664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 304764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3048070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 30491da20a71d1bbabc472f281208be77475550be751Jim Laskey LowerCallTo(I, I.getCalledValue()->getType(), 3050070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.getCallingConv(), 3051070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov I.isTailCall(), 3052070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov Callee, 3053070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1); 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/// 3420ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 3421ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 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 3441e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner unsigned OpNo = 1; // OpNo - The operand 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. 34541efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 34551efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 34561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 34570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 34581efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 34591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 34601efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 34610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal = I.getOperand(OpNo++); 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. 34690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 34700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 34710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner const Type *OpTy = OpInfo.CallOperandVal->getType(); 34726995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If this is an indirect operand, the operand is a pointer to the 34736995cf6015580eeab07a1c671fca180084a1325eChris Lattner // accessed type. 34746995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (OpInfo.isIndirect) 34756995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = cast<PointerType>(OpTy)->getElementType(); 34766995cf6015580eeab07a1c671fca180084a1325eChris Lattner 34776995cf6015580eeab07a1c671fca180084a1325eChris Lattner // If OpTy is not a first-class value, it may be a struct/union that we 34786995cf6015580eeab07a1c671fca180084a1325eChris Lattner // can tile with integers. 34796995cf6015580eeab07a1c671fca180084a1325eChris Lattner if (!OpTy->isFirstClassType() && OpTy->isSized()) { 34806995cf6015580eeab07a1c671fca180084a1325eChris Lattner unsigned BitSize = TD->getTypeSizeInBits(OpTy); 34816995cf6015580eeab07a1c671fca180084a1325eChris Lattner switch (BitSize) { 34826995cf6015580eeab07a1c671fca180084a1325eChris Lattner default: break; 34836995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 1: 34846995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 8: 34856995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 16: 34866995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 32: 34876995cf6015580eeab07a1c671fca180084a1325eChris Lattner case 64: 34886995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpTy = IntegerType::get(BitSize); 34896995cf6015580eeab07a1c671fca180084a1325eChris Lattner break; 34906995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 34910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 34926995cf6015580eeab07a1c671fca180084a1325eChris Lattner 34936995cf6015580eeab07a1c671fca180084a1325eChris Lattner OpVT = TLI.getValueType(OpTy, true); 34940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 34951efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 34960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 34972a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 34983ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 34993ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 35001efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3501e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3502e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 350309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 350409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 350509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 350609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 350709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 350809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 350909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 351009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 351109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 351209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 351309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 351409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 351509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 351609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 351709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 351809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 351909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 352009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 352109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 352209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 352309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 352409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 352509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 352609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 352709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 352809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 352909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 353009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 353109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 353209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 353309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 353409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 353509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 353609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 353709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 353809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 353909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 354009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3541e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3542e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3543e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3544e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 35450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 35460c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 35470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3549e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3550e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3551e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 3552e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 3553e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3554e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3555e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3556e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3557e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3558e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3559e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 35600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 35610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 35620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 35630c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 35640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 35650c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35662cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 35670f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 35680f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3569864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 35700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 35710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3572864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 35730f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 35740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 35750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmOperandInfo &OpInfo = ConstraintOperands[i]; 35761efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 35770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 35782cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3579c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3580c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3581f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 358209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 358322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 358422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 358522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3586c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3587c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 358809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 358922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 359022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 359122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 35922a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 359322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3594864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3595864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3596e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3597832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 35980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3599d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3600d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 36012cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 36020c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 36030c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3604864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 36052cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 36062cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 3607e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 36082cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3609e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 36100c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 36112cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 36126656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 36136656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 36146656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3615e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3616e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 36176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 36186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 36196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 36200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 36213d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 36220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 36232223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 36242223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 36250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 36263d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3627c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3628c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3629c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3630c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3631c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3632c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3633c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3634a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3635a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3636c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3637c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3638c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3639c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3640c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3641c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3642527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3643527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3644527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3645527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3646527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3647527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3648527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3649527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3650527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3651527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3653527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3654b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 3655527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3656527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3657527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3658527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3659527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert(0 && "matching constraints for memory operands unimp"); 3660c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 366187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 366287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 36632a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 36640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 366544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 366644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 366748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 366848884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 366948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 367048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 3671832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 36720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 367353069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 367453069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3675c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 367687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 367748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 3678c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3679c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 368048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 368187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 36822a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 368309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 368444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 368544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 368644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 368787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 368887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3689c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3690c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 369187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3692c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 36932223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 369487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 36952a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 36962a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 36972a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 36980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 369944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 370087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 370187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3702e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3703e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 370487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3705b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 370687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3707e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3708e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37106656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3711c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3712c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3713c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3714e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3715e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3716e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 37176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 37186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3719c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 37206656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3721ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3722ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3723ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3724ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3725ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3726f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3727f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3728bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3729ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3730ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37316656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 37326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 37333a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 3734b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 37353a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37363a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 37373a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 37387f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 37397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 37403a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner const VectorType *VTy = cast<VectorType>(I.getType()); 37417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 37423a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 37443a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37453a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 37463a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner setValue(&I, Val); 37473a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 37486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37496656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 37506656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 37516656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 37526656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 37536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 3754864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 37556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 3756b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 3757864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 37586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3759ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 3761bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 37626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 37630c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 37646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 37658b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 37666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 3767bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 3768bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 3769ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 3770ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 3771ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3772ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 37741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 37751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 377768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 377868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 377968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 378068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 378168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 37821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 37831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 3784a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 37851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 37861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 37871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 378847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 378947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 379047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 379147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 379247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 3793cf5734dddd66af9388a171b44996505ede47feedChris Lattner 3794cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 379547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), I.getType(), false, false, CallingConv::C, true, 3796cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 3797cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 3798cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 3799cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 380347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 380447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 380547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 380647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 380747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 38081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 3809cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 381047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, CallingConv::C, true, 3811cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 3812cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 38131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3815025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 3816025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 3817025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 3818025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 3819025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 3820025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 3821025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 3822832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 3823832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 3824832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "TargetLowering::InsertAtEndOfBasicBlock!\n"; 3825025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 3826025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 3827025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 3828025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 382939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 3830acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 3831acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3832acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 383339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 383439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 38351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 3836acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 3837acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 3838acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 3839acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 3840acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 38411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 3844acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 3845acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3846acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 38471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 38491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 3850acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 3851acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 3852acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 3853acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 3854acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 38551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 38561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3857fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 3858fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 3859f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 3860f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 3861fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 3862fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 3863b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov const FunctionType *FTy = F.getFunctionType(); 38645694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer const ParamAttrsList *Attrs = FTy->getParamAttrs(); 3865fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 3866fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 38678c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 3868fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 3869fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 3870fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3871fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 3872fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 38736aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 3874ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 3875ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 3876fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3877d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 38787aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 3879d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 38807aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 3881ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // FIXME: Distinguish between a formal with no [sz]ext attribute from one 3882ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner // that is zero extended! 388318da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ZExt)) 3884d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags &= ~(ISD::ParamFlags::SExt); 388518da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::SExt)) 3886d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 388718da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::InReg)) 3888d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 388918da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(j, ParamAttr::StructRet)) 3890d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 3891594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola if (Attrs && Attrs->paramHasAttr(j, ParamAttr::ByVal)) { 38921aa7efbd2c98e761f50992197473304b99257ca9Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 3893594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 3894594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 3895588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 3896588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 3897594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola unsigned StructSize = getTargetData()->getTypeSize(STy); 3898594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 3899594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 3900594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 390136397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Attrs && Attrs->paramHasAttr(j, ParamAttr::Nest)) 390236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 3903d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= (OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs); 3904ddf53e45b29087c57e0c864c93f86d5e99182d55Chris Lattner 3905fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3906fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3907fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3908fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 3909b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3910fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3911fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 3912fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 3913b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3914fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3915b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman case Expand: { 3916b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // If this is an illegal type, it needs to be broken up to fit into 3917b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // registers. 3918b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 3919b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 3920b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3921b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetVals.push_back(RegisterVT); 3922b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // if it isn't first piece, alignment must be 1 3923b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (i > 0) 3924b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Flags = (Flags & (~ISD::ParamFlags::OrigAlignment)) | 3925b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 3926b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 3927fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3928fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3929fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3930b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3931fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 39323b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 39338c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 3934fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3935fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 3936f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 3937f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(RetVals), RetVals.size(), 3938bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 393927a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 394027a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 3941fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3942fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 3943fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 3944fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 394547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 394647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 394747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 3948fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 3949fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3950fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 3951fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 3952fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 3953fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 3954fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3955fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 3956fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 3957fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 395818da0720887527ed570e9703ae5f290beb491ee1Reid Spencer if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::SExt)) 3959f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertSext, Op.getValueType(), Op, 3960f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 396118da0720887527ed570e9703ae5f290beb491ee1Reid Spencer else if (Attrs && Attrs->paramHasAttr(Idx, ParamAttr::ZExt)) 3962f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner Op = DAG.getNode(ISD::AssertZext, Op.getValueType(), Op, 3963f8e7a219121b7d6f8bcf1e22828648a243384fbbChris Lattner DAG.getValueType(VT)); 3964fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 3965fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 3966fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 3967fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 3968fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 3969fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 3970fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3971fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 397227a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 397327a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 397427a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 397527a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 397627a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned j = 0; j != NumParts; ++j) 397727a70be55f8b63181598d144d034b396402be66eDan Gohman Parts[j] = SDOperand(Result, i++); 3978532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT)); 3979fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 3980fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 398127a70be55f8b63181598d144d034b396402be66eDan Gohman } 3982fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 398327a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 3984fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 3985fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 3986fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 3987f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 3988f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 3989f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 3990f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 3991f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 3992f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 399347857812e29324a9d1560796a05b53d3a9217fd9Reid SpencerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 399447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer bool RetTyIsSigned, bool isVarArg, 3995f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 3996f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 3997f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 3998be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 3999f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4000f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4001f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4002f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4003f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4004f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4005f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4006f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 400747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 400847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4009d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned Flags = ISD::ParamFlags::NoFlagSet; 40107aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4011d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 40120db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4013d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4014d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::SExt; 4015d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4016d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::ZExt; 40170db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4018d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::InReg; 40190db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4020d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= ISD::ParamFlags::StructReturn; 402121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 402221485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= ISD::ParamFlags::ByVal; 402321485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 402421485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const StructType *STy = cast<StructType>(Ty->getElementType()); 4025588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola unsigned StructAlign = 4026588af2fb99bf255c350fcfc582e475cf4840c606Rafael Espindola Log2_32(getTargetData()->getCallFrameTypeAlignment(STy)); 402721485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola unsigned StructSize = getTargetData()->getTypeSize(STy); 402821485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructAlign << ISD::ParamFlags::ByValAlignOffs); 402921485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola Flags |= (StructSize << ISD::ParamFlags::ByValSizeOffs); 403021485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 403136397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 403236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Flags |= ISD::ParamFlags::Nest; 4033d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov Flags |= OriginalAlignment << ISD::ParamFlags::OrigAlignmentOffs; 40340db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov 4035f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 4036f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 40377aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio case Legal: 4038f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4039b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4040f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4041f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 4042f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 4043d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov unsigned ExtOp; 4044d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isSExt) 4045d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::SIGN_EXTEND; 4046d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else if (Args[i].isZExt) 4047d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ZERO_EXTEND; 4048d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov else 4049d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov ExtOp = ISD::ANY_EXTEND; 4050f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 4051f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 4052f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 4053849f214a4e3676e41168b0c5398165c4d4fb99f8Dale Johannesen Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 4054f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4055f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 4056b10308e440c80dd6ffb4b478f741ff7e5f30cb48Anton Korobeynikov Ops.push_back(DAG.getConstant(Flags, MVT::i32)); 4057f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 405827a70be55f8b63181598d144d034b396402be66eDan Gohman case Expand: { 405927a70be55f8b63181598d144d034b396402be66eDan Gohman MVT::ValueType PartVT = getRegisterType(VT); 406027a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumParts = getNumRegisters(VT); 406127a70be55f8b63181598d144d034b396402be66eDan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 4062532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT); 406327a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 406427a70be55f8b63181598d144d034b396402be66eDan Gohman // if it isn't first piece, alignment must be 1 406527a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned MyFlags = Flags; 406627a70be55f8b63181598d144d034b396402be66eDan Gohman if (i != 0) 406727a70be55f8b63181598d144d034b396402be66eDan Gohman MyFlags = (MyFlags & (~ISD::ParamFlags::OrigAlignment)) | 406827a70be55f8b63181598d144d034b396402be66eDan Gohman (1 << ISD::ParamFlags::OrigAlignmentOffs); 406927a70be55f8b63181598d144d034b396402be66eDan Gohman 407027a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(Parts[i]); 407127a70be55f8b63181598d144d034b396402be66eDan Gohman Ops.push_back(DAG.getConstant(MyFlags, MVT::i32)); 4072f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4073f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 4074f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 407527a70be55f8b63181598d144d034b396402be66eDan Gohman } 4076f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4077f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4078f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 4079b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType VT = getValueType(RetTy); 4080b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4081b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4082b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<MVT::ValueType, 4> RetTys(NumRegs); 4083b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4084b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RetTys[i] = RegisterVT; 4085f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4086f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 4087f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4088b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4089be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4090b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getVTList(&RetTys[0], NumRegs + 1), 4091be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4092b15e49597f031fdd41fdec2887a3c24c0ea430d8Chris Lattner Chain = Res.getValue(NumRegs); 4093b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4094b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4095b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 4096b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman ISD::NodeType AssertOp = ISD::AssertSext; 4097b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (!RetTyIsSigned) 4098b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 4099b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 4> Results(NumRegs); 4100b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4101b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Results[i] = Res.getValue(i); 4102532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman Res = getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, AssertOp); 4103f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4104b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4105b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4106f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4107f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 410850381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4109171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4110171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4111d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4112171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4113171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 41140aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 41150aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 41160aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 41170aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 41180aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 41190aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 41200aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 412174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 41221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 41231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 4124a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 41251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 41261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 41271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 41281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 41311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 41351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 41371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 41381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 41391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 41401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 41411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 41421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 41431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 41441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 41451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 41481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 41491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 415174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 415274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 415374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 415474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 415574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 415674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 415774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 4158b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned MSB = MVT::getSizeInBits(VT) / 8; 415974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 416074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 416174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 4162a5a57d66f5717873dbf3c48b174c0b0ce54b6612Evan Cheng Val = (Val << 8) | (unsigned char)Str[Offset]; 416374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 416474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 416574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 416674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 416774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 41681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 41691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 41701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 41711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 41721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 41731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 41741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4175c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 417680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 417780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 4178c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 4179c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 4180c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 41811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 41821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 41831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 41841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 41861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 41871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 41881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 41891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 41911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 41921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 41941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 41951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 41971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 41981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 41991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 42011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 420280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 420380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 420480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 420580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 42061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 420780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 420880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 420980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 4210dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 42111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 4212b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 42131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 42141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 42151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 42161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 421780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 421880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 421980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 422080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 42211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 42221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 42231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 422480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 422580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 42261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 42271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42287041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 42291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 42301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 42311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 42321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 42331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 42341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 42351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42365f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // If the source and destination are known to not be aliases, we can 42375f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // lower memmove as memcpy. 42385f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (Op == ISD::MEMMOVE) { 42398806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov uint64_t Size = -1ULL; 42405f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 42415f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Size = C->getValue(); 42425f43f92c69aae9837064cf08291db1b36a82789fDan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 42435f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis::NoAlias) 42445f43f92c69aae9837064cf08291db1b36a82789fDan Gohman Op = ISD::MEMCPY; 42455f43f92c69aae9837064cf08291db1b36a82789fDan Gohman } 42465f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 42471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 42481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 42491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 42501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 42511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 4252bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 42531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 4254ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 42551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 4256c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 4257c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 425880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 42591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 42601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 42611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 4262b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 4263a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 4264786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng SDOperand Store = DAG.getStore(getRoot(), Value, 4265864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 42668b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), Offset); 4267c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 4268c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 4269c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4270c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4271c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 4272c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 4273c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 4274c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 4275c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 4276c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 4277cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 427874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 427974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 4280cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 428174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 428274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 428374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 428474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 428574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 428674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 428774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 4288cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 428974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 429074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 429174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 4292f3e486e069011c70abb771958dc1218912b98eeaEvan Cheng if (GV && GV->isConstant()) { 42930937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 4294cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 4295cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 4296cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 4297cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 4298cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 429974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 430074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4301c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 4302c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 4303b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned VTSize = MVT::getSizeInBits(VT) / 8; 430474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 430574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 4306cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 430774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 430874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 430974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4310786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4311786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43128b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 431374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 431474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 431574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 4316466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng I.getOperand(2), SrcOff); 431774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 431874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 4319786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng DAG.getStore(Chain, Value, 4320786225adf09e606c795ef68a1f789c12f37869f2Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 43218b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng I.getOperand(1), DstOff); 432274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 4323c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 432474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 432574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 43261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4328c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 43291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 4331c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 4332c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 4333bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4334bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size())); 4335c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 4336c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 43371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 43381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 4339bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, getRoot(), Op1, Op2, Op3, Op4)); 43401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43427041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43437041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43447041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 43471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 43481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4350495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4351c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4352c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4353495a0b51915eb763576874f29192820b731edc22Chris Lattner} 43541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4355c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4356bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 43571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 43585f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 43595f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 43605f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 43611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 43621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 4363832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 43641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 43661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4367ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (ExceptionHandling) 4368ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 4369ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 4370ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands // Mark landing pad. 4371ea632439d4259254670dc4a27b13d6f9370216a8Duncan Sands FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 43729fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 43739fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 43741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4375edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4376ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4377ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4378ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 4379ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng if (!MF.livein_empty()) 4380ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng for (MachineFunction::livein_iterator I = MF.livein_begin(), 4381ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng E = MF.livein_end(); I != E; ++I) 4382ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4383ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4384f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4385f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4386f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4387f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4388f40708223e409a152834b1553c6883ff2035b957Duncan Sands 43891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 43901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4392571e434a34e26f295f13db2dd07551de7e25f8a9Chris LattnerSDOperand SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 4393571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg) { 4394571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 439518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4396d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 439718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 4398d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4399d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4400b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT); 4401b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(SrcVT); 4402b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Regs(NumRegs); 4403b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 4404b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4405b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the value by legal parts into sequential virtual registers. 4406532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT); 440727a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4408b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chains[i] = DAG.getCopyToReg(getRoot(), Reg + i, Regs[i]); 4409b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 44101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4412068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 441315699fc5ed0378205f9705d35d019d9ff0cf200dEvan ChengLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL, 4414068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 44151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 441615699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 44170afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4418bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4419bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4420bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4421bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4422bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4423bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4424bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4425bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4426f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4427bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4428bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4429251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4430251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 4431251db1890c1fe03d02ee878ada8129537844d031Chris Lattner SDOperand Copy = SDL.CopyValueToVirtualRegister(AI, VMI->second); 4432bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 4433bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 44340afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4435bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4436bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4437966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4438bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4439068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4440068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4441f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4442f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4443f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(!FLI.MBBMap[SrcBB]->isLandingPad() && 4444f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Copying catch info out of a landing pad!"); 4445f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4446cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4447f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4448f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4449f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4450f40708223e409a152834b1553c6883ff2035b957Duncan Sands FLI.CatchInfoFound.insert(I); 4451f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4452f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4453f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4454f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4455068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4456068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4457f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 44585f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo); 4459068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4460068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 4461edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4462bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4463ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 4464bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 44651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 44671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 44681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4469f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 44709fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 4471f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (ExceptionHandling && MMI && BB->isLandingPad()) { 4472f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4473f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4474f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4475f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4476f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.getConstant(LabelID, MVT::i32))); 4477f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4478e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4479e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4480e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4481e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4482e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4483e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4484e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4485e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4486f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4487f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4488f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4489f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4490cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4491cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4492cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4493cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4494cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4495cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4496cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4497f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4498f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4499f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4500f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4501f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4502cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4503f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4504f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4505f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4506f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4507f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 45089fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45099fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45109fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 45121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 45131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 45141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4515f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 45161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4517f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 45181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4519f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 45209f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 45211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 4522ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 4523571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDL.CopyValueToVirtualRegister(I, VMI->second)); 45241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 45281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 45291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 45301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 45311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4532edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 45338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 45341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 45361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4537d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 45398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 45408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 45418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 45428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4543532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4544532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 45451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 45461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4547d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 45488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4549d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 45508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 45518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 45528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 45538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 45548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 45558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 45571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 45581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 45601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 45611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 45621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 45638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 45648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 45658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 45668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 45688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 45693f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 45708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 45718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 45728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 45738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 45748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 45758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(C, RegOut)); 45761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 45788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 45798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 45808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 45818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 45828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 45838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 45848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 45858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner UnorderedChains.push_back( 45868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SDL.CopyValueToVirtualRegister(PHIOp, Reg)); 45877e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 45881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 45908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 45918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 45928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 45937f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4594b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 45958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 45968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 45971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 45991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4600ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 46015a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 46027436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 46037436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 46047436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 46057436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 46067436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 46077436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 46087436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 46097436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 46107436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 46117436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 46127436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 46137436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 4614bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, 4615bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &UnorderedChains[0], UnorderedChains.size())); 4616ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 4617ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 46181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4619f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4620a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 462237efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4623f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4624f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 46253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 46263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 46274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 46284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 46294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4630a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4631a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 46321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4635af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 46365f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 46372300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4638832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Lowered selection DAG:\n"; 46391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4640f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 46411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 46421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 4643ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4644f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4645832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 46461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4647f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4648af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 46495f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 46502300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4651a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4652552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4653a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4654a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 46551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4656f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4657832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 46581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4659f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4660f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4661f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4662f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4663f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4664f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 466544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4666f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4667f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4668f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4669f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4670f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 46711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4672f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4673f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4674f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 46754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 46774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 46784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 46794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 46804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4681f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4682a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 46831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 46844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4685f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4686f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4687f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4688f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 468909e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4690f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 4691f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4692f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 46931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 46954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 46964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 46974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 46984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 46994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 47005f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 47014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 47034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 47064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 47135f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo); 47144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 47164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 47174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 47194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 47204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 47234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 47244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 47294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 47304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 47334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 47344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 47354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 47364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 47374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 47384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 47394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 47404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 47414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Parent); 47438085bcfdca515a359c746ea475a3b8e9cac1c077Anton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(BitTestCases[i].Cases.back().ThisBB); 47454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 47474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 47494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 47504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 47514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov PHI->addMachineBasicBlockOperand(cBB); 47534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47589453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 47599453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 47609453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 47613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 47623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 47633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 47643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 47665f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo); 47673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 47693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 47713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 47723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 47763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 47785f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo); 477937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 47803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 47813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 478237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 47833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 47843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 47853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 47863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 478737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 478837efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 478937efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 479037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 479137efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 479237efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 47934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 47943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 479509e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 47963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov PHI->addMachineBasicBlockOperand(JTCases[i].first.HeaderBB); 4797f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4799f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 480009e460662a8d7328da1b938d5581a6ef3740b51dChris Lattner PHI->addRegOperand(PHINodesToUpdate[pi].second, false); 4801f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 480237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 480337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 480437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 480537efe6764568a3829fee26aba532283131d1a104Nate Begeman 4806b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4807b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4808b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4809b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4810b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4811b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4812b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 4813b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addRegOperand(PHINodesToUpdate[i].second, false); 4814b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner PHI->addMachineBasicBlockOperand(BB); 4815b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4816b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4817b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4818f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4819f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4820d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 482144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4822f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 48235f43f92c69aae9837064cf08291db1b36a82789fDan Gohman SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo); 4824d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4825f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4826f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4827f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4828d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4829f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4830f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4831f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4832f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4833d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4834d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4835d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4836d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4837d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 483857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4839d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4840d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4841d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4842d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4843d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4844d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 4845d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addRegOperand(PHINodesToUpdate[pn].second, false); 4846d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi->addMachineBasicBlockOperand(SwitchCases[i].ThisBB); 4847d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4848d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4849d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4850f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4851d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4852d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 485357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 485457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4855d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4856d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 48572452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 485857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4859f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 486057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4861a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 48621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4863a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 486413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4865a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4866a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4867a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4868a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4869a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 487013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4871eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 487213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 487313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4874eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 48759373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 48764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 487713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 48789ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4879a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 48803e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 48813e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 48823e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4883cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4884a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 48850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 488603fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 48879ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 48889ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 48899ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 48909ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4891755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4892755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4893755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4894755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4895755480681c795d585c73556c028b6143c46bda86Chris Lattner 4896755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4897755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4898755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4899755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4900755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4901dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 4902755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4903755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4904755480681c795d585c73556c028b6143c46bda86Chris Lattner 4905755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4906755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4907755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4908755480681c795d585c73556c028b6143c46bda86Chris Lattner 4909755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4910755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4911755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4912755480681c795d585c73556c028b6143c46bda86Chris Lattner 4913755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4914755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4915755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4916ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 4917755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4918755480681c795d585c73556c028b6143c46bda86Chris Lattner 4919755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4920755480681c795d585c73556c028b6143c46bda86Chris Lattner 4921755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4922755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4923755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4924755480681c795d585c73556c028b6143c46bda86Chris Lattner 4925755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 4926755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4927755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 4928755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4929755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 4930dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 4931755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t ActualMask = RHS->getValue(); 4932755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t DesiredMask =DesiredMaskS & MVT::getIntVTBitMask(LHS.getValueType()); 4933755480681c795d585c73556c028b6143c46bda86Chris Lattner 4934755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4935755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4936755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4937755480681c795d585c73556c028b6143c46bda86Chris Lattner 4938755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 4939755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask & ~DesiredMask) 4940755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4941755480681c795d585c73556c028b6143c46bda86Chris Lattner 4942755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4943755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 4944755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t NeededMask = DesiredMask & ~ActualMask; 4945755480681c795d585c73556c028b6143c46bda86Chris Lattner 4946755480681c795d585c73556c028b6143c46bda86Chris Lattner uint64_t KnownZero, KnownOne; 4947ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 4948755480681c795d585c73556c028b6143c46bda86Chris Lattner 4949755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 4950755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 4951755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4952755480681c795d585c73556c028b6143c46bda86Chris Lattner 4953755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 4954755480681c795d585c73556c028b6143c46bda86Chris Lattner 4955755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 4956755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4957755480681c795d585c73556c028b6143c46bda86Chris Lattner} 4958755480681c795d585c73556c028b6143c46bda86Chris Lattner 49599ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 49600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 49610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 49620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 49630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 49640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 49650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 49660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 49680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 49690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 49710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 49720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 49730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 49750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 49760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 49770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 49780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 49790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 49800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 49810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 49820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 49830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 49840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 4985832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 49860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 49870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 49904b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 499136d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 49924b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 49930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 49940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 49950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 49970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 49980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 49990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 50000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 50010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5002794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 50031997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5004