SelectionDAGISel.cpp revision 6ccbbd89906157187ac04b2b3237c4aee7acd095
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 16c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 29ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen#include "llvm/CodeGen/Collector.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 36eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 386f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 44124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 47a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 487e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 527944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 53a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 55a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 56a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 57a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 583e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 593e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 605bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 617944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 623e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0; 637944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 647944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 76eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 774ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 78eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 79eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 80e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen ISHeuristic("pre-RA-sched", 813700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 825bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Instruction schedulers available (before register" 835bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner " allocation):")); 8413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 859ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 869373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 879373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 884ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 894ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 905c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 91bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 92864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 93864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 94864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 95864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 96864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 979525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 98b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// Regs - This list holds the register (for legal and promoted values) 99864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 100864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 101864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 102864635ad7b3046d3042311423071152c613961deChris Lattner 103864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 104864635ad7b3046d3042311423071152c613961deChris Lattner /// 105864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 106864635ad7b3046d3042311423071152c613961deChris Lattner 107864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 108864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 109864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 110864635ad7b3046d3042311423071152c613961deChris Lattner 111864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 112864635ad7b3046d3042311423071152c613961deChris Lattner 113864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 114864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 115864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 116864635ad7b3046d3042311423071152c613961deChris Lattner } 117864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 118864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 119864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 120864635ad7b3046d3042311423071152c613961deChris Lattner } 121864635ad7b3046d3042311423071152c613961deChris Lattner 122864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 123864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 124864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 125b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 126864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 127b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 132b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 134b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 138c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 139c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1409f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 141864635ad7b3046d3042311423071152c613961deChris Lattner }; 142864635ad7b3046d3042311423071152c613961deChris Lattner} 1434ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1469373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1479373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1489373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1499373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1519373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1529373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1539373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1549373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1559373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1569373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1579373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1589373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1599373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1609373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1619373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1629373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1639373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 166f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 167f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 17184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1819f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 188f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 189f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 190f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 191f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 192f40708223e409a152834b1553c6883ff2035b957Duncan Sands 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 19484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 196571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 197571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 198571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 199571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 200571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 201571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 202edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 2043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 213cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 214cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 215cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 216f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 2178806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 2188806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 219f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 220f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 221f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 223f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 224ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 229f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 230571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 231f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 236bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 237f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 238f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 239bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 240bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 241bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 242f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 243bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 244bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 245bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 246bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 248edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 24984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 2501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 251bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 252bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 25316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 25416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 255bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 256bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 258bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 259bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 260bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2612aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 264b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 266514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 267ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 268d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 269ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 270a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 271b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 272d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 2746266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 2751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2772aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2782aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2872aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 2968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 2978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 2988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 2997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 3008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 3018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 302c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 303b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 304c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 315b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 316b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 31795b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 3188c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman unsigned R = MakeReg(RegisterVT); 3198c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman for (unsigned i = 1; i != NumRegisters; ++i) 3208c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman MakeReg(RegisterVT); 3218c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3340da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 336d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 337d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 338d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 339d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 340d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 341d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 34286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 34386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 34486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 34586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 34686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 34786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman std::vector<SDOperand> PendingExports; 34886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 3495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 3505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 3515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 3525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 3535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 3545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 3555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 3575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 3585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 3595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 3605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 3615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 3625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 3635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 3645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 3655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 3674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 3684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 3694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 3704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 3724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 3734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 3744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 3755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 3764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 3775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 3785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 396b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 397b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 3985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 3995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 4035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 417f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 424a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4255f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 4261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 427f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 429f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 434f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 438ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 439ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen /// GCI - Garbage collection metadata for the function. 440ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *GCI; 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 4435f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 444ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 445ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *gci) 4465f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 447ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FuncInfo(funcinfo), GCI(gci) { 4481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 45186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 45286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 45386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 454a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 455a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 456d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 457d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 458edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 459d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 460d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 461d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 462d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 463d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 464d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 465d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 466d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 467bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 468bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 469d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 470d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 471d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 472a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 473a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 47486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 47586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 47686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 47786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 47886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand getControlRoot() { 47986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Root = DAG.getRoot(); 48086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 48186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 48286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 48386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 48486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 48586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 48686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 48786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 48886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 48986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 49086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 49186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 49286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 49386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 49486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 49586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 49686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 49786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 49886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 49986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 50086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 50186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 50286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 50386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 50486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 50586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 506571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 5101e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 5111e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 5131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 5171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 5181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 5191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 5231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 525466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 52695c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 5271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 528199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 5291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5300da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 5311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 5321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 5330da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5354e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 5365c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 537e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 538e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 539f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 540571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 541571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 542571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 544571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 5456f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall, 546070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 547dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 5481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 5491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 5501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 551f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 5521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 5531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 554b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 555dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 556b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 557b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 558b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 559dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 560b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 562b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 563dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 564b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 565b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 566b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 5674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 5684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 5694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 5704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 571f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 5724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 5734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 5744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 5754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 57637efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 5773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 5783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 579f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 581b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 582b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5847f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 585e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 5865fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 5877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 5891628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 59101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 592b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 5931628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 5947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 5957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 5961628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 5977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 6007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 6017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 6027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 6037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 6047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 6057f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 6067f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 6077f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 60824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 6093822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 6103822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 61145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 61245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 6133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 6143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 6153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 6163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 6173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 6183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 6193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 6203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 6213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 6223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 6233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 6243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 6253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 6261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6272bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 6282bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 6293e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 630c7029805ef35ce9805931067b841e6af11db382eChris Lattner 6311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 6321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 6331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 6351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 6361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 6371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 6381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 6391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 6401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 641fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 642c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6430eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 6461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 6471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 6481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 6491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 650ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman void visitGetResult(GetResultInst &I); 65140a04216daaaee119665e023019c005306ec48acDevang Patel 6521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 6531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 6541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 6571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 6581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 6611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 6621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 664b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 665b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 666b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 667b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 6684468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 6696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 6706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 6716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 6726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 6736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 6744468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 675014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 676014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 677014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Val = Parts[0]; 678014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 679014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 680014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 681014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 682014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 683014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ValueBits = MVT::getSizeInBits(ValueVT); 684014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 685014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 686014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 687014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 688014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 689014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType RoundVT = RoundBits == ValueBits ? 690014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT : MVT::getIntegerType(RoundBits); 691014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Lo, Hi; 692014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 693014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 694014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType HalfVT = MVT::getIntegerType(RoundBits/2); 695014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 696014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 697014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 6986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 699014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 700014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 7016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 702014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 703014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 704014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 705014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 706014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 707014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 708014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 709014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType OddVT = MVT::getIntegerType(OddParts * PartBits); 710014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 711014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 712014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 713014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 714014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 715014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 716014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType TotalVT = MVT::getIntegerType(NumParts * PartBits); 717014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 718014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 719014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(MVT::getSizeInBits(Lo.getValueType()), 720014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 721014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 722014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 723014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 724014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 725014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 726014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType IntermediateVT, RegisterVT; 727014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 728014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 729014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 730014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 731014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 732014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 733014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 734014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 735014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 736014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 737014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 738014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SmallVector<SDOperand, 8> Ops(NumIntermediates); 739014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 740014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 741014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 742014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 743014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 744014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 745014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 746014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 747014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 748014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 749014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 750014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 751014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 752014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 753014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 754014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 755014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 756014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 757014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 758014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(MVT::isVector(IntermediateVT) ? 759014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 760014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 7616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 762014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 7636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 764014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 765014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 7666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 767014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 768014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 769014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 770014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(PartVT)) { 771014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 772014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 7736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 7746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 775014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(ValueVT)) { 776014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 777014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::getVectorNumElements(ValueVT) == 1 && 778014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 779014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 780014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 7816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 782014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && 783014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::isInteger(ValueVT)) { 784014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(ValueVT) < MVT::getSizeInBits(PartVT)) { 785014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 786014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 787014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 788014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 789014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 790014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 791014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 792014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 793014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 794014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 7956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 796014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 797d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 798d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (ValueVT < Val.getValueType()) 7994468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 800d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 8014468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 802d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 803d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 804014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 805014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(PartVT) == MVT::getSizeInBits(ValueVT)) 806014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 807014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 808014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 809d27c991cebe48fdf82b5d9eec6c2a1a244f82622Chris Lattner return SDOperand(); 8106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 812b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 813b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 814b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 8156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 8166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 8176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 8186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 819b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT, 820b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 82125ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 82225ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 8236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 824014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 825014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 826014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 827014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 828014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 829014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 830014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 831014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 832014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 833014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 834014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 835014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 836014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 837014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts * PartBits > MVT::getSizeInBits(ValueVT)) { 838014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 839014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 840014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 841014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 842014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 843014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 844014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 845014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 846014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 847014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 848014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (PartBits == MVT::getSizeInBits(ValueVT)) { 849014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 850014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 852014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts * PartBits < MVT::getSizeInBits(ValueVT)) { 853014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 854014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 856014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 857014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 858014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 864014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts * PartBits == MVT::getSizeInBits(ValueVT) && 865014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 866014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 867014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 868014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 869014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 8706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 8716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 873014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 874014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 875014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 876014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isInteger(PartVT) && MVT::isInteger(ValueVT) && 877014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 878014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 885014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 886014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 889014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 892014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 893014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 89525eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 89625eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::getIntegerType(MVT::getSizeInBits(ValueVT)), 89725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 899014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 90125eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::ValueType ThisVT = MVT::getIntegerType (ThisBits); 90225eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part0 = Parts[i]; 90325eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part1 = Parts[i+StepSize/2]; 90425eb043759c23b61769108f78382eb9701c41db2Duncan Sands 90525eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 90625eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 90725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 90825eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 90925eb043759c23b61769108f78382eb9701c41db2Duncan Sands 91025eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 91125eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 91225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 91325eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 916014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 918014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 9256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 9266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 9276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 928014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 930a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 931a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 932a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 933a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 9346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 9376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 9386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 9396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 9426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 9436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 9446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 9456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 9466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 9476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 9486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 9496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 9516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 9526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 9546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 9556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 9566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 9576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 9586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 9596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 96025ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 9616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 9626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 9636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 96425ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 9656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 9676183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 9686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 9696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 9706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 971532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 9726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 9736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 9746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 9756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 9766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 9776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 9786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 979532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 9806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 9826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 984199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 985199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 986199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 987199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 988199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 989199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 990199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 991199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 992199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 9930da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner SDOperand N1 = NodeMap[V]; 9940da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 9950da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner return N1; 996199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 997199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 998199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 999199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1000199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 10019d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (!isa<VectorType>(VTy)) 100223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 100323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 10047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR of undef nodes. 10059d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *PTy = cast<VectorType>(VTy); 100623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 100723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 100823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 1009bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 101023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 101123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 101223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 10137f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 10147f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return N = DAG.getNode(ISD::BUILD_VECTOR, VT, 1015bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()); 1016199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 101743421b3dd70af5b70e71816521f37502c397cc65Dale Johannesen return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 10189d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer } else if (const VectorType *PTy = dyn_cast<VectorType>(VTy)) { 1019199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 1020199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1021199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1022199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 1023199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 102407a96765daedf180a7102d39fe56c499878312b7Dan Gohman // the vector constant. 1025bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 10269d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 10272bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 10282bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1029199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 103007a96765daedf180a7102d39fe56c499878312b7Dan Gohman assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!"); 1031199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 1032199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 1033199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 1034199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 1035199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 1036199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 1037199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1038199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 10397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // Create a BUILD_VECTOR node. 10407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = MVT::getVectorType(PVT, NumElements); 10417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], 10420da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Ops.size()); 1043199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 1044199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 1045c6f9a06238daebd41620ccc795f289c607393f00Dan Gohman return N = DAG.getConstant(cast<ConstantInt>(C)->getValue(),VT); 1046199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1047199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1048199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1049199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1050199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1051199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1052199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1053199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1054199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1055199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1056251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1057251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1058199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1059b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(VT); 1060b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(VT); 1061b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 1062b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman std::vector<unsigned> Regs(NumRegs); 1063b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 1064b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Regs[i] = InReg + i; 1065b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 1066b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman RegsForValue RFV(Regs, RegisterVT, VT); 1067b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 1068b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 1069b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1070199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1071199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1072199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 10731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 10741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 107586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 10761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 10771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1078bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 107986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 108086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1081ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 1082b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType VT = RetOp.getValueType(); 1083b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 10848e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 10858e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 1086b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::isInteger(VT)) { 1087b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType MinVT = TLI.getRegisterType(MVT::i32); 1088b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::getSizeInBits(VT) < MVT::getSizeInBits(MinVT)) 1089b988baccc229ef3e175905c999245d5544a0d384Duncan Sands VT = MinVT; 1090b988baccc229ef3e175905c999245d5544a0d384Duncan Sands } 1091b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1092b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = TLI.getNumRegisters(VT); 1093b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = TLI.getRegisterType(VT); 1094b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 1095b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1096b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1097b988baccc229ef3e175905c999245d5544a0d384Duncan Sands const Function *F = I.getParent()->getParent(); 1098b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F->paramHasAttr(0, ParamAttr::SExt)) 1099b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 1100b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1101b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 1102b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1103b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT, ExtendKind); 1104b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1105b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i < NumParts; ++i) { 1106b988baccc229ef3e175905c999245d5544a0d384Duncan Sands NewValues.push_back(Parts[i]); 1107276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1108ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 11091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1110bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1111bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 11121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1114571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1115571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1116571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1117571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1118571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1119571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1120571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1121571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1122571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1123571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1124571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 112586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1126571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1127571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 11288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 11298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 11308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 11318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 11328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 11338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 11348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 11358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 11388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 11398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 11408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 11428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 11438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 11448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 11458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 11488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 11498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 11508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 11528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 11548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11556a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 11566a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 11576a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 11586a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 11596a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 11606a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1161571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1162571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1163571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1164571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1165571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1166571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1167571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1168e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1169571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1170e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1171e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 11726a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 11736a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 11746a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1175571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1176571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1177e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1178e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1179e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1180e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 11815a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 11825a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 11835a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 11845a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 11855a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1186e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1187e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1188e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1189e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1190e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1191e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1192e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1193e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1194e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1195e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1196e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1197e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1198e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1199e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1200e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1201e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1202e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1203e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1204e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1205e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1206e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1207e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1208e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1209e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1210e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1211e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1212e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1213e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1214e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1215e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1216e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1217e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1218e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1219e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1220e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1221e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1222e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1223e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1224e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1225e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1226e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1227e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 12280da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1229e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1230571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1231571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1232571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 12335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1234571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1235571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1236571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1237571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1238571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 12396b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 12405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1241571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1242571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1243571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1244571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1245d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1246d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1247571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1248571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1249571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1250571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1251d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1252d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1253d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1254d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1255d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1256d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1257d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1258d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1259571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1260d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1261d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1262d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1263d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1264d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1265d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1266d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1267d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1268d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1269d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1270d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1271d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1272d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1273d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1274d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1275d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1276d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1277d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1278d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1279d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1280d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1281d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1282571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1283571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1284df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1285df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1286df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1287df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1288df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1289df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1290df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 12910ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 12920ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 12930ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 12940ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 12950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 12960ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 12970ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 12980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 12990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1300df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1301df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1302df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 13031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 13041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 13051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 13061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 13081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 13091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 13101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 13111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 13121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 13141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 13151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 131686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1317dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 131857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 131957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 132057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 132157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 132257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 132357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 132457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 132557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 132657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 132757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1328571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1329571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1330571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1331571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1332571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1333571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1334571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1335571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1336571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1337571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1338571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1339571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1340571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1341571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1342571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1343571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1344571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1345571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1346d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1347571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1348571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 13490ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 13500ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 13510ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 13520ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 13530ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1354df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1355df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1356df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1357df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1358df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1359df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1360df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1361df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1362df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1363df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1364df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 13655a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 13665a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 13670ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 13680ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 13690ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 13700ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 13710ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1372df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1373571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1374571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 13752452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 13762452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 13776b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 13785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 13792452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 13802452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 13812452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 13821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 138757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 138857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 138957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 13905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 13915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 13925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 13935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 13945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 13955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 13965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 13975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 13985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 13995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 14005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 14015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 14035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 14055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 14065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 14085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 14093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 14115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 14125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 14145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 14155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 14165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1420f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1421f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1423f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1424f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1425f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1426f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1427f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 142957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 143057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1431f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1432f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1433f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 143486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 143557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 143657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1437f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1438f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1439f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 144057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1441f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 144257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 144357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1444f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1445f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 14463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 144737efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 144837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1449f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 145037efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 145186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 14523d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 14533d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 14543d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 14553d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 145637efe6764568a3829fee26aba532283131d1a104Nate Begeman} 145737efe6764568a3829fee26aba532283131d1a104Nate Begeman 14583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 14593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 14603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 14613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 14623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 14633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 14643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 14653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 14663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 14673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 14683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 14693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 14713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 14723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 14733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 14743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 14757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 14763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 14773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 14783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 14793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 148186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 14823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 14833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 14853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 14863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 14875b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 14883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 14893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 14903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 14923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 14933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 14943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 14953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 14963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 14973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 14993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 15003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 15023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 15033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 15043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 15054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 15064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 15083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 15093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 15114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 15124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 15134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 15144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 15154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 15164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 15174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 15184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 15205b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 15214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 15224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 15234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 15257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 15264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 15274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 15294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 15314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 15324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 15334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 15344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 153686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 15374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 15384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 15404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 15414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 15434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 15444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 15454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 15464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 15474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 15484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 15504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 15514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 15524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 15544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 15554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 15574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 15584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 15604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 15614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 15634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 15644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 15654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 15664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 156786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, TLI.getPointerTy()); 15684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 15704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 15714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 15724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 15735b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 15744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 15754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 157686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 15774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 15784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 15804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 15814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 15824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 15834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 15854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 15874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 15884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 15904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 15914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 15934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 15944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 15973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1598b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1599b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1600b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1601f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 16029fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1603fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1604fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1605fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 16066f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1607f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1608f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1609f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1610f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1611f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1612f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 161386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1614f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 16159fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1616f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 161786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1618f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1619070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1620f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1621f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1622f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1623b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1624b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1625b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1626b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1627b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 16285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1629b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1630dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1631b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1634dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1635dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1636dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1637dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 16384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1639dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 16405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1642b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1643b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1644b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1645b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1646b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1647b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1648b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1649b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1650b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1651b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1652b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1653b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1654b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1655b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1656b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1657b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 16585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1659b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1660b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1661b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 16625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1663b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1664b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1665b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1666b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1667b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1668b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1669b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1670b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1671b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1672b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1673b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1674b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1675b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1676b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1677b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1678b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1679b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1680b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1681b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 16825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 16845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 16855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 16865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 16875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 16885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 16895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 16905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 16915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 16925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 16945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1695b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1696b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1697b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1698b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1699b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1700b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1701b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1702b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1703b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1704b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1705b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1706b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1707dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1708dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1709b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1710b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17117294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 17127294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 17137294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 17147294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 17157294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1716b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1717dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1718b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1719b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1720b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1721dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1722dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1723dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 17255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 17265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 17285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 17305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1731dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17327294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1733dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1734dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 17365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1737dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1738dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 17405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 17414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 17425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1744b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1745dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1746b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1747b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1748b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1749b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1750b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1751b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1752b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1753b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1754b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1755b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1756b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1757b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1759b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1760b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1761b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1763b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1764b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 17664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1767b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1768b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1769b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1770b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 17715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 17725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 17735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 17745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 17765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 17775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 17785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1779b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1780b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1781b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1783b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1784b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 17855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1786b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1787b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1788b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1789b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1790b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1791b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1792b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1793b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1794b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1795b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1796b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1797b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1798b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1799b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1800f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1801b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1802b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1803b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1804b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1805b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1806b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1807b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1808dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1809b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1810b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1811b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1812b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1813dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1814b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1815b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1816b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1817b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1818b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1819b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1820b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1821b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1822b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1823b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1824b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1825b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1826b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1827b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1828b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1829b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1830b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1831b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1832b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1833b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1834b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 18355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 18365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 18374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 18385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1839b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1840b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1841b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 18425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 18435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 18445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 18455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 18465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 18485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 18494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 18504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 18514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 18535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 18545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 18555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 18564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 185954e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 18604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 18614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 18624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 18634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 18644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 18654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 18674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 18684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 18725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18747294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 18757294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 18767294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 18777294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 18787294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 18797294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1880b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 18835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1884b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1885b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1890b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1891b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1892b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 18935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 18945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 18955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 18965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1897b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1898b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1899b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1900b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1901b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1902b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1903b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1904b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1905b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1906b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1907b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1911b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1912b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1913b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1914b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1915b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1916b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1917b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1918b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1919b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 19205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 19215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1922b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1923b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1924b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1925b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1926b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1927dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1928dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1929b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1930b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 19324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 19334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 19344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 19354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 19364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 19373ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1938b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 19394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 19414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 19424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 19444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 19454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 19464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 19484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 19504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 19514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 19524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 19534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 19544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 19554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 19564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 19584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 19594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 19604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 19614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 19624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 19634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 19644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 19654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 19664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 19674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 19694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 19704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 19714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 19724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 19734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 19744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 19754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 19764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1977ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 19784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 19794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 19804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 19814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 19824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 19844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 19854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 19874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 19884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 19894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 1990e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 19914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 19924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 19934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 19944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 19954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 19974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 19984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 20004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 20014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 20024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 20034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 20044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 20064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 20074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 20084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 20094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 20124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 20134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2015e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 20164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 20174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 20214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 20234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 20254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 20264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 20274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 20294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 20314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 20324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 20334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 20344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 20364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 20374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 20384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 20394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 20404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2043efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 20444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 20454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 20474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 20484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 20504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 20524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 20534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 205586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 20565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 20575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 20585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 20595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 20615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 20625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 20635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 20645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 20655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 20665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2067b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 20685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 20705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2071a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2072a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 207327a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 20745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 20755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 20765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 20775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 20785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 20805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 20815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 20825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 20835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 20845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 20855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 20865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 20875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 20885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 20905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 20915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 20925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 20935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 20945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 20965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 20975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2099f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2100f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2101f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2102c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 21035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2104d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2105f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2106f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 21075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2108f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2109c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2110f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 2111d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 211286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2113d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 2114c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2115d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 2116f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2117f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2118f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2119f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2120f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2121f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 21225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 21235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 21245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 21255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2126c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2127f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2128f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2129f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 21305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 213137efe6764568a3829fee26aba532283131d1a104Nate Begeman 21323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2133b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 21343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 21353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 21363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 21373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 21383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 21393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 21403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 21414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 21424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 21434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 21453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2146dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2147dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2148dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 21494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 21503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 21513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2152dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2153dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2154dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2155dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2156dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2157dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 21613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2162b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2163b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 216424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 21659d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 21667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 21677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 21687f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2169c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2170c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 21719e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2172c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2173c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2174c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2175c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2176c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2177c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 21787f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 21797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 21807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 21817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 218201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 21839e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 218401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 218501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 218601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 218701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 21887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 21897f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 21907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2191b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2192b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 21937f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 21941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 21951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 219624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 219724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 21981628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 21991628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2200e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2201e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2202e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2203e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22047f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 22057f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2206832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2207832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2208832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2209e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 22111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 221345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2214e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2215e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2216e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2217e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2218e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2219e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2220e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 222145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2222e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 222345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 222445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 222545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 222645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 222745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 222845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 222945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 223045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 223145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 223245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 223345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 223445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 223545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 223645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 223745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 223845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 223945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 224045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 224145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2242e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2243e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2244e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2245e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2246e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2247e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2248e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2249e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2250e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2251e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2252e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2253e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2254e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2255e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2256e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2257e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2258e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2259e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2260e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2261e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2262e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2263e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2264e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2265e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2266e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 226745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 226845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2269e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 227045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 227145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2272e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2273e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2274e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2275e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2276e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 22771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 22801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 22811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 22821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 22837f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 22847f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 22851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 22893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 22903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 22923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 22933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 22943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 22953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 22963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 22973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 22983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 22993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 23013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 23043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 23053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 23063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 23093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 23123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23150bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 23163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 23193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 23233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 23263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 23273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 23303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 23333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 23343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 23373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 23403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 23413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 23443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 23473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 23483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 23513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 23543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 23553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 23561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2357e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 235828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 23603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 23613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 23623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 23633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 23643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 23653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 23663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 23693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 23703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 23713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 23733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 23753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 23763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 23773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 23783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 23793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 23823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 23863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 23873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 23883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 23893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 23903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 23911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23932bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2394c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2395c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2396c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2397c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2398c7029805ef35ce9805931067b841e6af11db382eChris Lattner 23997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 24007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2402c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2403c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24042bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2405384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2406384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2407384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 24087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2409384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2410384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2411c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24123e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 24133e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 24143e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 24153e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 24163e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24177f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 24187f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24197f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 24203e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 24213e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24223e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 24241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 24251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 24261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 24281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 24291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2430c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2431b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 24321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 24331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2434b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 24351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 24360bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 24371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 24381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 24391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 24401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 24417c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 24437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2444b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 244547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2446a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 24470bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 24480bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 24497c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 24507c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 24517c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2453a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 24547c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 24557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24567c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 24577c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 24587c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 245947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 24607c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 24617c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 24627c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24637c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 24647c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 24657c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 24667c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 24677c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 24686b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 24691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 24707c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 24711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 24727c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24730bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Scale = DAG.getIntPtrConstant(ElementSize); 24747c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 24757c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 24761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 24771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 24781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 24791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 24821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 24831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 24841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 24851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 24861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2488514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 248958092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2490d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 249158092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 24921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 249468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 249568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 249668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 249768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 249868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 24991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 250068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 25010bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 25021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25034515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 25044515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 25054515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 25061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 25071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 25084515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 25091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 25104515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 25114515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 25124515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 25134515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 25140bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 25154515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 25164515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 25170bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 25181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25190bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 2520f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2521f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2522f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 25230da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 25240da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 25251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 25271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 25281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 25291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 25321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2533edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2534d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2535d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2536d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2537d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2538d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2539d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2540d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 254128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2542466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 254395c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 254428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 254528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 254628b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2547466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 254895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 254995c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 25507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 25517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 25527f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2553d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 255428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2555d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2556d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2557d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 255828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 255928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 25601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 25641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 25651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 25661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 25670b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 256895c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 25691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25710eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 25720eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 25730eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 25740eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2575a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2576a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2577a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 25780eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2579bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2580e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2581e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2582e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2583e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2584e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2585e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2586e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2587e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 25880eade319cdb72e24c11d068728a98083737c6435Chris Lattner 25890eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 25900eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 25910eade319cdb72e24c11d068728a98083737c6435Chris Lattner 25920eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 25930eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 25940eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 25950eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 25960eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 25970eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 25980eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 25990eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26000eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 26010eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 26020eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 26037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 26049d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 26050eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 26060eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26070eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 26080eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 26090eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26100eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26110eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 26120eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 26130eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26140eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 26150eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 26160eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2617f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2618f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 26190eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 262048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 262148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2622f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2623f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 262448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2625f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2626f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 262748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2628f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2629f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 263048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2631e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2632e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2633e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2634e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2635e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2636e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2637e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 26380eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 26399d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 26407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 26417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 26420eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26430eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 26440eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26450eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 26460eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2647b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2648cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2649b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2650b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 26514c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 2652cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2653cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2654cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2655cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2656f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2657cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2658f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2659f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2660f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2661f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2662f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2663f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2664f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2665f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2666f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2667f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2668f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2669f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2670cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2671cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2672cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2673cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2674cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 26756590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2676cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2677cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2678cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2679cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2680cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2681cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2682cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2683cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2684cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2685cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 26866590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 26876590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 26886590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 26896590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 26906590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 26916590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 26926590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 26936590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 26946590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 26956590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 26966590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2697cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2698cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2699cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2700f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2701cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2702cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2703cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2704cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2705cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2706f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2707cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2708f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2709f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2710c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2711c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2712c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2713c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2714c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2715c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 27160eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 27170eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 27180eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 27190eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2720c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2721c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2722c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2723bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2724bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2725bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2726bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2727bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2728bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2729bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2730bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2731c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2732d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2733c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2734c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2735d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2736c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 273703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 2738707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 2739707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2740707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2741707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2742707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2743707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2744707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 274503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2746707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 274703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 2748707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 2749707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2750707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2751707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2752707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2753707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 2754707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 275503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2756707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 275703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 2758707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 2759707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2760707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2761707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2762707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2763707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2764707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 2765707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 2766707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 2767707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 2768707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 2769707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 2770707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 2771707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2772707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 2773707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 2774707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 2775707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2776707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 2777707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 277803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2779707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 278086cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 278144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 278243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 278344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2784bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 278536ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2786bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2787bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2788bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2789ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 279044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2791ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 279243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 279343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2794bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2795bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2796ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2797bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 279886cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 279943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2800b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 280136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 280243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 280344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 280443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 280544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 280644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 28071ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2808bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2809bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 281043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 281143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2812b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 281343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 281443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 281544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 281643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 281744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 281844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 2819bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2820bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2821bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 282243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 282343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2824b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 282543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 282643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 282744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 28281b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 282943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 28301b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 28311b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 28321b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 28331b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 28341b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 28351b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 28361b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 28371b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 28381b08bbca5592351a940bcd164bdec724ee954326Evan Cheng unsigned SrcFile = MMI->RecordSource(CompileUnit->getDirectory(), 28391b08bbca5592351a940bcd164bdec724ee954326Evan Cheng CompileUnit->getFileName()); 28401b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 28411b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 28421b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 284343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 284443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2845b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 284643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 284743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 284844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 284943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 2850a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 2851a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 2852a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 2853a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 285443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 285543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2856c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2857b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 28581532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 28591532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 28601532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 28611532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 2862735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 28631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 28641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 28651532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Ops[1]; 28661532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 28671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 28681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 28691532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 2870b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2871b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2872b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 28738806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 28748806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2875b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 28768806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 28778806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 28788806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 28791532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 2880f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2881f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2882e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2883f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2884f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2885f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2886902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2887902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2888902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2889e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2890735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2891735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 28928806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2893735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2894735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2895735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2896735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2897735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2898735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 28997a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 29008806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2901b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2902b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2903b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2904b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 29058806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 29068806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 29078806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2908b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29098806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 29108806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2911735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2912735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2913735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2914cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 29153b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2916735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 29178806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 29187a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2919f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 29208806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2921b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2922b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2923b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2924b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2925b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 29262365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 29272365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29282365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 29302365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 29312365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 29322365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 293386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 29342365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 29352365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 29362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 29372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 29382365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29402365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 29412365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29422365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29432365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 29442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 29452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 29462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29472365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29482365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 29492365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29502365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29512365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 29521532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 29531532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand CfaArg; 29541532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 29551532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 29561532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 29571532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 29581532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 29591532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 29601532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 29611532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Offset = DAG.getNode(ISD::ADD, 29621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 29631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 29641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 29651532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 29661532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 29671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 29681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 29691532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 29701532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 29711532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 29721532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 29732365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 29742365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29752365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29769ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 2977c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 2978c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 2979c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 2980c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 29819ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 29826ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 29836ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 29846ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 29856ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 29866ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 2987ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 2988ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 2989ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2990ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2991ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2992ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 2993ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 2994ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 2995ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 2996ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 2997ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 2998ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 2999ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3000ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3001ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3002ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3003c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3004c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 3005c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3006c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3007c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 30088b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3009bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3010f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3011f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3012f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 30138b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 30148b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 301551b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 30168b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3017c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 30183f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3019f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3020f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3021f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3022f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3023f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3024f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 30253f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3026addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3027a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3028d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3029d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3030d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3031d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3032a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3033a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3034a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3035a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3036a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3037c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3038a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3039a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3040a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3041a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3042a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3043a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3044c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3045a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3046a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3047a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3048a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3049a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3050a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3051c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3052a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3053140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3054bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3055f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 3056f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3057140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3058140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3059140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3060140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 306139a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 306239a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 306339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3064140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 306539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 306624e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 306724e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 306824e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 306936397f50343639ce9a25996f2d790c656791ab92Duncan Sands 307036397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 307136397f50343639ce9a25996f2d790c656791ab92Duncan Sands const Function *F = 307236397f50343639ce9a25996f2d790c656791ab92Duncan Sands cast<Function>(IntrinsicInst::StripPointerCasts(I.getOperand(2))); 307336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 307436397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 307536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 307636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 307736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 307836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 307936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 308036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 308136397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3082f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 3083f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3084f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3085f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3086f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3087f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3088f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 308936397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 309036397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3091ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3092ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 3093ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (GCI) { 3094ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3095ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3096ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3097ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 3098ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI->addStackRoot(FI->getIndex(), TypeMap); 3099ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3100ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3101ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3102ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3103ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 3104ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!"); 3105ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3106ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3107917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 31081a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3109917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3110917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 311166fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 311266fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 311366fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 311466fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 311566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 311627b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 311727b7db549e4c5bff4579d209304de5628513edebEvan Cheng SDOperand Ops[4]; 311827b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 311927b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 312027b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 312127b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 312227b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 312327b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 312427b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 312527b7db549e4c5bff4579d209304de5628513edebEvan Cheng 312622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 312722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth SDOperand Ops[6]; 312822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 312922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 313022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 313122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 313222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 313322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 313422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 3135ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_lcs: { 3136ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3137ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O3 = getValue(I.getOperand(3)); 3138ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LCS, Root, 3139ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3140ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3141ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O3, O3.getValueType()); 3142ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3143ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3144ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3145ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3146ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_las: { 3147ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3148ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3149ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LAS, Root, 3150ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3151ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3152ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3153ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3154ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3155ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3156ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_swap: { 3157ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3158ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3159ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_SWAP, Root, 3160ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3161ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3162ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3163ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3164ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3165ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3166ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth 3167c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3168c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3169c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3170c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 31716f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sandsvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee, 31721da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3173070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 31746f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3175735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3176070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3177070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 31786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3179735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3180735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 31816f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 31826f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 31836f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 31846f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands SDOperand ArgNode = getValue(*i); 31856f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 31866f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 31876f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 31886f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 31896f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 31906f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 31916f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 31926f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 31936f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 319408e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3195735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3196735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3197735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 31981532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3199070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3200070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3201070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3202a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3203a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3204a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 3205a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getControlRoot(), 3206bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(BeginLabel, MVT::i32), 3207bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3208070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 32096f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3210735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 32116f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 32126f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 321300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 32146f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3215735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 32166f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 32176f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3218735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3219070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32201532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3221070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3222070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3223070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 3224070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 3225bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(EndLabel, MVT::i32), 3226bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3227070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32286f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3229070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3230070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3231735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3232735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3233735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 32341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 323564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3236c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 323787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3238c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3239c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3240c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3241c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 324287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 324387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 324487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 324587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 324687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 324787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 324887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 324987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 325087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 325187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 325287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 325387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 325487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 325587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 325687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 325787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 325887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 325987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 326087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 326187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 326287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 326387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 326487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 32652f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 32662f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 326787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 326887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 326987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 327087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 327187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 327287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 327387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 327487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 327587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 32762f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 32772f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 327887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 327987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 328087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 328187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 328287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 328387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 328487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 328587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 328687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 32872f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 32882f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 328987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 329087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 329187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 329287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 329387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 329487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3295f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3296c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 329787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3298ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3299fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3300ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3301c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3302edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 330364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 330464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 330564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 330664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 330764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3308070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 33096f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 33101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3312735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3313ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohmanvoid SelectionDAGLowering::visitGetResult(GetResultInst &I) { 3314ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SDOperand Call = getValue(I.getOperand(0)); 3315ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman setValue(&I, SDOperand(Call.Val, I.getIndex())); 3316ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman} 3317ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3318ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3319b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3320b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3321b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3322b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3323b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3324b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag)const{ 3325b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the legal parts from the registers. 3326b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3327b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 332827a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3329b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3330b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT, *Flag) : 3331b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman DAG.getCopyFromReg(Chain, Regs[i], RegVT); 3332b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(1); 3333b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3334b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(2); 3335b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Parts[i] = Part; 3336b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 3337b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3338b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Assemble the legal parts into the final value. 33394c55c633d9fd795e0e39642daa07e592c7a285aaChris Lattner return getCopyFromParts(DAG, &Parts[0], NumParts, RegVT, ValueVT); 3340b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3341b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3342b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3343b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3344b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3345b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3346b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3347b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3348b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 3349b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumParts = Regs.size(); 3350b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Parts(NumParts); 3351532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Val, &Parts[0], NumParts, RegVT); 3352b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3353b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 335427a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumParts; ++i) { 3355b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Part = Flag ? 3356532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag) : 3357532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 3358b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman Chain = Part.getValue(0); 3359b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (Flag) 3360b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 3361c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3362c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3363864635ad7b3046d3042311423071152c613961deChris Lattner 3364c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3365c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3366c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3367c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 33689f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 33694b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 33704b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 3371c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 3372c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 3373c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3374864635ad7b3046d3042311423071152c613961deChris Lattner 3375864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3376864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3377864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3378864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 33799b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 33806f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 33816f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 3382f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3383f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 33846f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 33856f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 3386f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3387f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 33889b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 33899b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 33909b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 33919b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 33929b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 33939b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3394f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3395f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3396f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3397f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3398f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3399f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3400f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3401f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 34029b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 34039b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 34049b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3405f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 34069b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3407864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3408864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3409864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3410864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 34119b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 34129b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3413f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3414f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3415f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3416f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3417f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3418f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3419f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3420864635ad7b3046d3042311423071152c613961deChris Lattner } 3421f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3422864635ad7b3046d3042311423071152c613961deChris Lattner} 3423864635ad7b3046d3042311423071152c613961deChris Lattner 3424bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3425bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3426bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3427bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 34285c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 34295c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 34305c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 34315c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3432bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 34335c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3434e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3435e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3436e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3437e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 34385c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 34395c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3440bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3441bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3442e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3443e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3444e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3445e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 34467cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 34477cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 34487cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 34497cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 34507cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 34517cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 34527cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 34537cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 34547cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 34557cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 34567cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 34577cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 34587cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 34597cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 34607cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 34617cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 34627cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 34637cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 34647cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 34657cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 34667cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 34677cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 34687cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3469bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3470bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3471bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3472bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 34730fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 34740fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 34750fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 34760fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 34770fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 34780fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 34790fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 34800fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 34810fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 34820fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 34830fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3484e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 34855c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3486864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 34874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3488e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3489e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3490e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3491e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3492e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3493e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3494e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3495e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3496e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3497e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3498e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3499e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3500e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3501e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3502e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3503e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3504e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3505e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3506e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3507e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3508e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3509e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3510e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3511e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3512e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3513864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 3514e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3515e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3516e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3517e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3518e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3519e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3520864635ad7b3046d3042311423071152c613961deChris Lattner 3521bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3522bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3523b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3524864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3525bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3526864635ad7b3046d3042311423071152c613961deChris Lattner 3527bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 35282a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 35292a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3530864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3531bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3532864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3533cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3534cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3535cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3536cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3537cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3538864635ad7b3046d3042311423071152c613961deChris Lattner 3539864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3540864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3541864635ad7b3046d3042311423071152c613961deChris Lattner 3542864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3543864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3544864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3545864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3546864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3547864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3548864635ad7b3046d3042311423071152c613961deChris Lattner 3549864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3550864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3551864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3552864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3553864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3554864635ad7b3046d3042311423071152c613961deChris Lattner } 3555864635ad7b3046d3042311423071152c613961deChris Lattner } 3556e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 35577cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 35587cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3559e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3560864635ad7b3046d3042311423071152c613961deChris Lattner } 3561864635ad7b3046d3042311423071152c613961deChris Lattner 35622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 35632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 35642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3565c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3566c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 35672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 35682a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 35692a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3570e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3571e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3572e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3573e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3574e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 35752a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 35763a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3577bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 35783a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 35792a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 35802a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 358184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 35822a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 358384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 35842a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 3585e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, RegVT, ValueVT); 3586e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 35872a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 35882a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 35892a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 35902a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 35912a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 35922a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 35932a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 35942a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 35952a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 35962a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3597bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3598bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 35992a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3600e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 36016f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 3602864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3603864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3604864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 36054e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3606864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3607864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3608864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3609864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3610864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3611864635ad7b3046d3042311423071152c613961deChris Lattner } 3612864635ad7b3046d3042311423071152c613961deChris Lattner 36134e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 36144e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3615c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 36166f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 3617c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3618c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3619c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3620c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3621c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 36224e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 36234e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3624864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3625864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3626864635ad7b3046d3042311423071152c613961deChris Lattner 3627e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3628864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3629864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3630864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3631864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3632e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3633e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3634864635ad7b3046d3042311423071152c613961deChris Lattner 3635e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs = RegsForValue(Regs, *RC->vt_begin(), 3636e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 36377cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3638e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3639864635ad7b3046d3042311423071152c613961deChris Lattner } 36404e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3641864635ad7b3046d3042311423071152c613961deChris Lattner 3642864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3643e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 36444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 36454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 36463ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3647ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3648ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3649fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 3650fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 3651ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 36535c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 3654ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3655ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3656ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3657ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 36584e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 36590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 36600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 36610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 36620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 36630c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3664e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3665e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3666e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3667e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3668e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3669e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3670fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 36710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 36725c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 36735c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 36740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 36750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 36761efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 36770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 36780c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 36791efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 36800c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 36810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // The return value of the call is this value. As such, there is no 36820c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // corresponding argument. 3683fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3684fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpVT = TLI.getValueType(CS.getType()); 36851efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 3686fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 36871efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 36881efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 36891efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 3690fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 36911efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 36921efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 36930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 36941efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 36951efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 36960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 36970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 3698eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 36990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 3700eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (isa<BasicBlock>(OpInfo.CallOperandVal)) 3701eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = 3702ba2a0b960ea4c73d0f81557f63ae2ea126e08905Dale Johannesen DAG.getBasicBlock(FuncInfo.MBBMap[cast<BasicBlock>( 3703ba2a0b960ea4c73d0f81557f63ae2ea126e08905Dale Johannesen OpInfo.CallOperandVal)]); 3704eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 3705eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 3706eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 3707eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 3708eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 3709eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 3710eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 3711eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3712eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If OpTy is not a first-class value, it may be a struct/union that we 3713eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 3714eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (!OpTy->isFirstClassType() && OpTy->isSized()) { 3715eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 3716eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 3717eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 3718eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 3719eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 3720eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 3721eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 3722eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 3723eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 3724eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 3725eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 37266995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 3727eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3728eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 37290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 37300c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 37311efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 37320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 37332a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 37343ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 37353ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner OpInfo.ComputeConstraintToUse(TLI); 37361efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3737e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3738e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 373909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 37400fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 374169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 374269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 374369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 374469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 374569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 374669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 374769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 374869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 374969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 375069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 375169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 375269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 375369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 37540fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 375509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 375609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 375709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 375809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 375909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 376009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 376109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 376209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 376309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 376409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 376509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 376609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 376709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 376809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 376909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 377009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 377109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 377209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 377309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 377409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 377509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 377609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 3777514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 377809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 377909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 378009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 378109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 378209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 378309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 378409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 378509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 378609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 378709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 378809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 378909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 379009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 379109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3792e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3793e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3794e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3795e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 37960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 37970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 37980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3800e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3801e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3802e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 38035c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 3804e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3805e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3806e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3807e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3808e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3809e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3810e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 38110c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 38120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 38130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 38140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 38150c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 38160c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 38172cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 38180f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 38190f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3820864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 38210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 38220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3823864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 38240f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 38250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 38265c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 38271efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 38280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 38292cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3830c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3831c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3832f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 383309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 383422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 383522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 383622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3837c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3838c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 383909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 384022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 384122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 384222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 38432a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 384422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3845864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3846864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3847e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3848832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 38490c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3850d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3851d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 38522cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 38530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 38540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3855864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 38562cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 3857fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3858e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 38592cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3860e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 38610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 38622cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 38636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 38646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 38656656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3866e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3867e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 38686656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 38696656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 38706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 38710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 38723d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 38730c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 38742223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 38752223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 38760c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 38773d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3878c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3879c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3880c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3881c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3882c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3883c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3884c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3885a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3886a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3887c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3888c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3889c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3890c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3891c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3892c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3893527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3894527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3895527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 3896527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 3897527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 3898527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3899527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 3900527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 3901527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 3902527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 3903c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3904527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 3905b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 3906527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 3907527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 3908527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 3909527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 3910f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 3911f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 3912f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3913f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3914f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 3915f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 3916f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 3917c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 391887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 391987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 39202a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 39210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 392244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 392344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 392448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 392548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 392648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 392748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 3928832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 39290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 393053069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 393153069fbbae2558a3138df24776448791fea3aceeChris Lattner } 3932c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 393387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 393448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 3935c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3936c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 393748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 393887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 39392a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 394009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 394144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 394244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 394344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 394487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 394587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3946c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3947c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 394887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 3949c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 39502223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 395187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 39522a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 39532a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 39542a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 39550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 395644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 395787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 395887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 3959e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 3960e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 396187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3962b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 396387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 3964e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 3965e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 39666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 39676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3968c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 3969c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 3970c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 3971e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 3972e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 3973e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 39746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 39756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3976c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 39776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 3978ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3979ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 3980ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 3981ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 3982ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3983f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 3984f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 3985bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 3986ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 3987ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 39886656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 39896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 39903a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 3991b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 39923a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 39933a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 39943a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 39957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 39967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 3997fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands const VectorType *VTy = cast<VectorType>(CS.getType()); 39987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 39993a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 40007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 40013a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 40023a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4003fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 40043a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 40056656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 40066656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 40076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 40086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 40096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 40106656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4011864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 40126656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4013b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4014864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 40156656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4016ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 40176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4018bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 40196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 40200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 40216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 40228b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 40236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4024bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4025bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4026ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4027ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4028ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4029ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 40301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 40311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 40321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 403468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 403568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 403668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 403768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 403868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 40391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4041514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 40421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 40430bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 40441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 404547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 404647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 404747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 404847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 404947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4050cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4051cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 405200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 405300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4054cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4055cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 40561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 40571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 40581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 405947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 406047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 406147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 406247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 406347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 40641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 4065cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 406600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 406700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4068cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4069cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 40701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 40711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4072ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4073ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4074025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4075025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4076025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4077ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4078025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4079832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4080832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4081ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4082025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4083025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4084025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4085025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 408639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4087acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4088acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4089acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 409039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 409139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 40921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4093acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4094acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4095acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4096acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4097acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 40981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 40991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4101acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4102acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4103acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 41041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4107acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4108acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4109acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4110acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4111acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 41121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4114fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4115fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4116f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4117f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4118fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 4119fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 4120fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4121fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 41228c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4123fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4124fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4125fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4126fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4127fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 41286aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4129ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4130ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4131fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4132276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 41337aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4134d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 41357aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 4136afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ZExt)) 4137276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4138afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::SExt)) 4139276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 4140afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::InReg)) 4141276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 4142afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::StructRet)) 4143276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 4144afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4145276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 4146594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 4147a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4148276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4149a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 415008e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should be passed from FE. BE will guess if 415108e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // this info is not there but there are cases it cannot get right. 415208e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (F.getParamAlignment(j)) 4153276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = F.getParamAlignment(j); 4154276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4155276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 4156594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 4157afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::Nest)) 4158276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4159276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4160b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4161b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType RegisterVT = getRegisterType(VT); 4162b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumRegs = getNumRegisters(VT); 4163b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumRegs; ++i) { 4164b988baccc229ef3e175905c999245d5544a0d384Duncan Sands RetVals.push_back(RegisterVT); 41659701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray ISD::ArgFlagsTy MyFlags = Flags; 4166c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumRegs > 1 && i == 0) 41676ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4168b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4169c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i > 0) 41709701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray MyFlags.setOrigAlign(1); 41719701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray Ops.push_back(DAG.getArgFlags(MyFlags)); 4172b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4173fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 41743b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 41758c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4176fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4177fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4178f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 417986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4180bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 418186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 418286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 418386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 418486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 418586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG); 418686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 418786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 418886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 418986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 419086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 419186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 419286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 419386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 419486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 419527a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 419627a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 4197fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4198fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4199fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 4200fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 420147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 420247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 420347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4204fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4205b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4206b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4207b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4208b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4209b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned j = 0; j != NumParts; ++j) 4210b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Parts[j] = SDOperand(Result, i++); 4211b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4212b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 4213b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4214b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertSext; 4215b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4216b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertZext; 4217b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4218b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 42194468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner AssertOp)); 4220fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 422127a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4222fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 4223fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4224fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4225f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4226f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4227f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4228f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4229f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4230f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 423100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan SandsTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 423200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 423300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4234f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4235f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4236be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4237f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4238f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4239f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4240f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4241f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4242f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4243f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4244f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 424547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 424647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4247276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 42487aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4249d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 4250276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands 4251d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4252276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4253276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands if (Args[i].isSExt) 4254276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 42550db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4256276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 42570db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4258276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 425921485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 4260276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 426121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4262a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4263276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4264a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 426508e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should come from FE. BE will guess if this 426608e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // info is not there but there are cases it cannot get right. 426708e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (Args[i].Alignment) 4268276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = Args[i].Alignment; 4269276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4270276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 427121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 427236397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 4273276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4274276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4275b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4276b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4277b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4278b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4279b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4280b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4281b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (Args[i].isSExt) 4282b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 4283b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (Args[i].isZExt) 4284b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 4285b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4286b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4287b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4288b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumParts; ++i) { 4289b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4290276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy MyFlags = Flags; 4291c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumParts > 1 && i == 0) 42926ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4293c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i != 0) 4294276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands MyFlags.setOrigAlign(1); 4295b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4296b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(Parts[i]); 4297276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Ops.push_back(DAG.getArgFlags(MyFlags)); 429827a70be55f8b63181598d144d034b396402be66eDan Gohman } 4299f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4300f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4301ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 4302ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // the high-level LLVM return types. 4303ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<const Type *, 4> LLVMRetTys; 4304ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman if (const StructType *ST = dyn_cast<StructType>(RetTy)) 4305ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // A struct return type in the LLVM IR means we have multiple return values. 4306ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LLVMRetTys.insert(LLVMRetTys.end(), ST->element_begin(), ST->element_end()); 4307ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman else 4308ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LLVMRetTys.push_back(RetTy); 4309ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 4310ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Then we translate that to a list of lowered codegen result types. 4311ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> LoweredRetTys; 4312ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> RetTys; 4313ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned I = 0, E = LLVMRetTys.size(); I != E; ++I) { 4314ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType VT = getValueType(LLVMRetTys[I]); 4315ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman RetTys.push_back(VT); 4316ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 4317ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4318ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4319ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4320ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4321ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4322f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4323ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4324f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4325b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4326be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4327ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4328ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4329be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4330ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4331b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4332b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4333b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 433400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 433500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 433600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 433700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 433800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4339b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 434000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4341ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> ReturnValues; 4342ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 4343ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned I = 0, E = LLVMRetTys.size(); I != E; ++I) { 4344ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType VT = getValueType(LLVMRetTys[I]); 4345ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4346ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4347ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4348ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> Results; 4349ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4350ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4351ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SDOperand ReturnValue = 4352ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4353ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4354ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4355ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4356ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Res = ReturnValues.size() == 1 ? ReturnValues.front() : 4357ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getNode(ISD::MERGE_VALUES, 4358ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&RetTys[0], RetTys.size()), 4359ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman &ReturnValues[0], ReturnValues.size()); 4360f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4361b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4362b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4363f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4364f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 436550381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4366171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4367171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4368d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4369171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4370171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 43710aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 43720aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 43730aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 43740aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 43750aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 43760aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 43770aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 43787041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43797041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 43807041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 43811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 438384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 43841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 43851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4386495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4387c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4388ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen AU.addRequired<CollectorModuleMetadata>(); 4389c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4390495a0b51915eb763576874f29192820b731edc22Chris Lattner} 43911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4392c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4393bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 43941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 43955f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 43965f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 43975f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 43981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 4399ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (MF.getFunction()->hasCollector()) 4400ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction()); 4401ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 4402ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = 0; 440384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4404832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 44051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 44071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44081532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 44091532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 44101532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 44111532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 44129fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 44139fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 44141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4415edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4416ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4417ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4418ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 441984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 442084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 442184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4422ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4423ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4424f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4425f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4426f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4427f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4428f40708223e409a152834b1553c6883ff2035b957Duncan Sands 44291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 44301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 443286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohmanvoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, 443386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned Reg) { 4434571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 443518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4436d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 443718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 443886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4439d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 4440d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 4441b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(SrcVT); 4442b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman unsigned NumRegs = TLI.getNumRegisters(SrcVT); 4443b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Regs(NumRegs); 4444b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 4445b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4446b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the value by legal parts into sequential virtual registers. 4447532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Op, &Regs[0], NumRegs, RegisterVT); 444827a70be55f8b63181598d144d034b396402be66eDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 444986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Chains[i] = DAG.getCopyToReg(DAG.getEntryNode(), Reg + i, Regs[i]); 445086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Ch = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 445186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Ch); 44521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4454068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 445586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 44561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 445715699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 44580afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4459bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4460bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4461bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4462bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4463bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4464bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4465bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4466bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4467f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4468bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4469bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4470251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4471251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 447286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4473bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 44740afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4475bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4476bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4477966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4478bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4479068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4480068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4481f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4482f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4483f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4484cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4485f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4486f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4487f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4488560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4489560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4490f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4491f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4492f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4493f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4494c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 449548abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4496c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4497c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4498c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4499c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4500c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4501c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 4502c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 4503c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 4504c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4505c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4506c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 4507c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 4508c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer BI = prior(DAG.allnodes_end()); BI != BE; --BI) { 4509c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 4510c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 4511c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpCall(static_cast<SDNode*>(BI), 0); 4512c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 4513c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 4514c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 4515c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 451648abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 4517c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 4518c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (isMarkedTailCall && 4519c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer (Ret==NULL || 4520c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG))) { 4521c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 4522c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 4523c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 4524c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer E=OpCall.Val->op_end(); I!=E; I++, idx++) { 4525c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 4526c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 4527c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer else 4528c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 4529c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4530c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 4531c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4532c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4533c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4534c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 4535c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4536068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4537068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4539ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI); 4540068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4541bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4542ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 454386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 45441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 45461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 45471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4548f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 45499fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45501532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 4551f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4552f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4553f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4554f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4555bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 4556bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 4557f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4558e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4559e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4560e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4561e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4562e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4563e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4564e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4565e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4566f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4567f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4568f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4569f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4570cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4571cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4572cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4573cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4574cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4575cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4576cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4577f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4578f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4579f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4580f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4581f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4582cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4583f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4584f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4585f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4586f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4587f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 45889fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45899fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 45909fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 45921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 45931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 45941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4595f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 45961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4597f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4599f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 46009f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 46011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 460286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 46031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 46061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 46071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 46081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 46091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 46101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4611edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 46128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 46131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 46151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4616d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 46178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 46188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 46198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 46208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 46218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4622532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4623532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 46241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 46251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4626d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 46278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4628d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 46298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 46308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 46318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 46328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 46338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 46348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 46361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 46371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 46391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 46401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 46411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 46428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 46438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 46448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 46458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 46478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 46483f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 46498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 46508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 46518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 46528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 465386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 46541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 46568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 46578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 46588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 46598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 46608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 46618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 46628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 466386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 46647e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 46651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 46678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 46688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 46698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 46707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4671b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 46728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 46738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 46741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 46761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4678f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4679a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4680f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 468137efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4682f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4683f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 46843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 46853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 46864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 46874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 46884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4689a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 469086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 4691c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4692c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 4693c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 4694c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 4695c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 4696c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 46971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4699f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4700417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 4701417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4702417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4703af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 47045f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 47052300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4706417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 47071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4708f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 47091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 47101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 471101d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#if 0 // Enable this some day. 471201d029b82cb08367d81aa10cdc94d05360466649Chris Lattner DAG.LegalizeTypes(); 471301d029b82cb08367d81aa10cdc94d05360466649Chris Lattner // Someday even later, enable a dag combine pass here. 471401d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#endif 4715ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4716f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4717832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 47181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4719f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4720af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 47215f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 47222300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4723417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 4724417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4725417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4726a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4727552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4728a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4729a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 47301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4731f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4732832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 47331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4734f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4735f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4736f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4737f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4738f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4739f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 474044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4741f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4742f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4743f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4744f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4745f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 47461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4747f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4748f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4749f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 47504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 47524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 47534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 47544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 47554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4756f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4757a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 47581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 47594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4760f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4761f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4762f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4763f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 47649ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 47659ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 47669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4767f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4768f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 47691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 47724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 47734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 47744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 4776ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 47774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 47794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 47804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 47824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 47834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 47844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 47854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 47864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 47874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 47884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 4789ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI); 47904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 47914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 47924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 47934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 47944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 47954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 47964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 47974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 47994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 48004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 48054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 48064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 48094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 48104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 48114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 48124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 48134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 48144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 48154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 48164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 48179ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48189ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48199ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 48209ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48219ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48229ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 48239ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 48244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 48264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 48284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 48294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 48309ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48319ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48329ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 48334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48389453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 48399453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 48409453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 48413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 48423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 48433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 48443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 4846ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 48473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 48493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 48513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 48523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 48563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 4858ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI); 485937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 48603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 48613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 486237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 48633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 48643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 48653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 48663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 486737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 486837efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 486937efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 487037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 487137efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 487237efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 48734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 48743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 48759ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48769ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48779ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 4878f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 48794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4880f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 48819ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 48829ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48839ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 488437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 488737efe6764568a3829fee26aba532283131d1a104Nate Begeman 4888b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4889b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4890b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4891b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4892b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4893b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4894b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 48959ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 48969ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48979ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4898b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4899b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4900b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4901f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4902f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4903d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 490444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4905f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4906ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI); 4907d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4908f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4909f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4910f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4911d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4912f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4913f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4914f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4915f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 4916d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4917d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 4918d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 4919d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 4920d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 492157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 4922d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 4923d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 4924d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 4925d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 4926d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 4927d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 49289ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 49299ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 49309ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 4931d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 4932d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4933d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 4934f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4935d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4936d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 493757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 493857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4939d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4940d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 49412452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 494257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 4943f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 494457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 4945a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 49461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4947a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 494813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4949a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 4950a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 4951a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 4952a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 4953a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 495413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 4955eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 495613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 495713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 4958eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 49599373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 49604ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 496113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 49629ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 4963a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 49643e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 49653e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 49663e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 4967cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 4968a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 49690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 497003fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 49719ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 49729ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 49739ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 49749ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 4975755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4976755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 4977755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 4978755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 4979755480681c795d585c73556c028b6143c46bda86Chris Lattner 4980755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 4981755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 4982755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 4983755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 4984755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 4985dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 49862e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 49872e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 4988755480681c795d585c73556c028b6143c46bda86Chris Lattner 4989755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 4990755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 4991755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 4992755480681c795d585c73556c028b6143c46bda86Chris Lattner 4993755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 49942e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 4995755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 4996755480681c795d585c73556c028b6143c46bda86Chris Lattner 4997755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 4998755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 49992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5000ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5001755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5002755480681c795d585c73556c028b6143c46bda86Chris Lattner 5003755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5004755480681c795d585c73556c028b6143c46bda86Chris Lattner 5005755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5006755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5007755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5008755480681c795d585c73556c028b6143c46bda86Chris Lattner 5009755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5010755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5011755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5012755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5013755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 50142e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 50152e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 50162e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5017755480681c795d585c73556c028b6143c46bda86Chris Lattner 5018755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5019755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5020755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5021755480681c795d585c73556c028b6143c46bda86Chris Lattner 5022755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 50232e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5024755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5025755480681c795d585c73556c028b6143c46bda86Chris Lattner 5026755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5027755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 50282e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5029755480681c795d585c73556c028b6143c46bda86Chris Lattner 50302e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5031ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5032755480681c795d585c73556c028b6143c46bda86Chris Lattner 5033755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5034755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5035755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5036755480681c795d585c73556c028b6143c46bda86Chris Lattner 5037755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5038755480681c795d585c73556c028b6143c46bda86Chris Lattner 5039755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5040755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5041755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5042755480681c795d585c73556c028b6143c46bda86Chris Lattner 50439ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 50440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 50450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 50460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 50470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 50480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 50490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 50500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 50520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 50530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 50550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 50560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 50570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 50590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 50600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 50610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 50620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 50630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 50640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 50650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 50660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 50670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 50680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5069832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 50700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 50710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 50744b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 507536d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 50764b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 50770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 50780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 50790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 50810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 50820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 50830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 50840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 50850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5086794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 50871997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5088