SelectionDAGISel.cpp revision 9373beba6010dd34316a801c3a9b37ab9e048031
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 51c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This file was developed by the LLVM research group and is distributed under 61c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// the University of Illinois Open Source License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 16a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 17adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Constants.h" 191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 22ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 26b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner#include "llvm/CodeGen/IntrinsicLowering.h" 27b2efb853f00d45b1c8d57f92acd0028fbdeffda6Jim Laskey#include "llvm/CodeGen/MachineDebugInfo.h" 281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 3037efe6764568a3829fee26aba532283131d1a104Nate Begeman#include "llvm/CodeGen/MachineJumpTableInfo.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey#include "llvm/CodeGen/MachinePassRegistry.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 35fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 41124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 42495a0b51915eb763576874f29192820b731edc22Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 437944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#include "llvm/Support/CommandLine.h" 447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 469525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner#include "llvm/Support/Visibility.h" 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <map> 484e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner#include <set> 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <iostream> 507e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 53da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 547944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 55a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 56a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 57a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 58a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 59a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 615e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 627944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 637944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 644ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 6513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::opt<const char *, false, RegisterPassParser<RegisterScheduler> > 6613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey ISHeuristic("sched", 6713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::init("default"), 6813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey cl::desc("Instruction schedulers available:")); 6913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 709ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 719373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 729373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 734ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 744ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 75864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 76864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 77864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 78864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 79864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 809525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 81864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 82864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 83864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 84864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 85864635ad7b3046d3042311423071152c613961deChris Lattner 86864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 87864635ad7b3046d3042311423071152c613961deChris Lattner /// 88864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 89864635ad7b3046d3042311423071152c613961deChris Lattner 90864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 91864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 92864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 93864635ad7b3046d3042311423071152c613961deChris Lattner 94864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 95864635ad7b3046d3042311423071152c613961deChris Lattner 96864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 97864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 98864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 99864635ad7b3046d3042311423071152c613961deChris Lattner } 100864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 101864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 102864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 103864635ad7b3046d3042311423071152c613961deChris Lattner } 104864635ad7b3046d3042311423071152c613961deChris Lattner 105864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 106864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 107864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 108864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1099f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 110c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 111c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 112c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 113c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 114c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 115a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 116a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const; 117c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 118c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 119c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 120c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 121c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1229f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 123864635ad7b3046d3042311423071152c613961deChris Lattner }; 124864635ad7b3046d3042311423071152c613961deChris Lattner} 1254ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1289373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1299373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1309373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1319373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 1329373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 1339373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 1349373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1359373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 1369373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 1379373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 1389373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 1399373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 1409373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 1419373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1429373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 1439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1449373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 1459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 1461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 148f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 149f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, unsigned> ValueMap; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 173edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1743c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1753c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 185f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 186f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 1871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 1881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 1891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 1901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 191f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 192f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 197bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 198f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 199f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 200bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 201bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 202bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 204bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 205bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 206bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 207bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 209edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 212bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 213bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 21416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 21516ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 216bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 217bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 219bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2222aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(AI->getArraySize())) { 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 227a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 228ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 229a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 230ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 231a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 232a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // If the alignment of the value is smaller than the size of the value, 233a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // and if the size of the value is particularly small (<= 8 bytes), 234a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // round up to the size of the value for potentially better performance. 235a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // 236a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // FIXME: This could be made better with a preferred alignment hook in 237a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // TargetData. It serves primarily to 8-byte align doubles for X86. 238a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner if (Align < TySize && TySize <= 8) Align = TySize; 2392dfa8192abaad8a3c29132dba50e8b85218e918cChris Lattner TySize *= CUI->getValue(); // Get total allocated size. 240d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 242f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2452aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2462aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2552aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(); 264f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 265f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 26670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 26770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NumElements; 26870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) 26970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = TLI.getNumElements(VT); 27070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else { 27170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT1,VT2; 27270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = 27370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 27470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner VT1, VT2); 27570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 276f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned PHIReg = ValueMap[PN]; 277f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner assert(PHIReg &&"PHI node does not have an assigned virtual register!"); 278f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0; i != NumElements; ++i) 279f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner BuildMI(MBB, TargetInstrInfo::PHI, PN->getNumOperands(), PHIReg+i); 280f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2843c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2853c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2863c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 2873c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 2883c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 2893c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2903c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 2913c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 2923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 2933c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2943c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a packed type, figure out what type it will decompose into 2953c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 2963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner const PackedType *PTy = cast<PackedType>(V->getType()); 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3076cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3086cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3096cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3106cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3123c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3133c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3143c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3293c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NT = VT-1; // Find the type to use. 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (TLI.getNumElements((MVT::ValueType)NT) != 1) 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner --NT; 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned R = MakeReg((MVT::ValueType)NT); 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg((MVT::ValueType)NT); 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, SDOperand> NodeMap; 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 350d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 351d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 352d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 353d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 354d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 355d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 356f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Case - A pair of values to record the Value for a switch case, and the 357f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// case's target basic block. 358f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<Constant*, MachineBasicBlock*> Case; 359f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::vector<Case>::iterator CaseItr; 360f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<CaseItr, CaseItr> CaseRange; 361f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 363f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 364f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 366f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// The comparison function for sorting Case values. 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman bool operator () (const Case& C1, const Case& C2) { 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (const ConstantUInt* U1 = dyn_cast<const ConstantUInt>(C1.first)) 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return U1->getValue() < cast<const ConstantUInt>(C2.first)->getValue(); 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const ConstantSInt* S1 = dyn_cast<const ConstantSInt>(C1.first); 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return S1->getValue() < cast<const ConstantSInt>(C2.first)->getValue(); 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 3911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 3921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 3931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 3941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 3951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 396a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 3971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 398f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 40137efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGISel::JumpTable JT; 402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 408edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4109453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT(0,0,0,0), FuncInfo(funcinfo) { 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 413a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 414a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 415a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 416d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 417d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 418edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 419d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 420d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 421d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 422d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 423d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 424d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 425d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 426d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 427d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, PendingLoads); 428d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 429d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 430d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 431a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 432a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 44928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 45028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 456199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const SDOperand &setValue(const Value *V, SDOperand NewN) { 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return N = NewN; 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4634e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 464864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 465864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 466864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 467864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 468864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 469f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 473f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 476f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Helper for visitSwitch 477f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 47837efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 479f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); } 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); } 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4845fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitBinary(User &I, unsigned IntOp, unsigned FPOp, unsigned VecOp); 485e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 4865fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 4875fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::ADD, ISD::FADD, ISD::VADD); 48801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 489b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 4905fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitMul(User &I) { 4915fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::MUL, ISD::FMUL, ISD::VMUL); 49201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 4931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitDiv(User &I) { 49401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 4953e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng visitBinary(I, 4963e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::SDIV : ISD::UDIV, ISD::FDIV, 4973e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::VSDIV : ISD::VUDIV); 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRem(User &I) { 50001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 5015fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, Ty->isSigned() ? ISD::SREM : ISD::UREM, ISD::FREM, 0); 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5033e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitAnd(User &I) { visitBinary(I, ISD::AND, 0, ISD::VAND); } 5043e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitOr (User &I) { visitBinary(I, ISD::OR, 0, ISD::VOR); } 5053e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitXor(User &I) { visitBinary(I, ISD::XOR, 0, ISD::VXOR); } 506e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShl(User &I) { visitShift(I, ISD::SHL); } 507e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShr(User &I) { 508e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman visitShift(I, I.getType()->isUnsigned() ? ISD::SRL : ISD::SRA); 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 511f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc, 512f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpc); 513f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ, 514f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOEQ); } 515f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE, 516f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETUNE); } 517f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE, 518f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLE); } 519f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE, 520f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGE); } 521f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT, 522f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLT); } 523f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT, 524f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGT); } 5251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5262bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5272bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5283e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 529c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCast(User &I); 5321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 541ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 542c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5430eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 5461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 5471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 5481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 54939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner void visitFrameReturnAddress(CallInst &I, bool isFrameAddress); 5501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5517041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 5521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 5541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 5551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 5581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 5591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 5621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 5631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 564199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 565199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 566199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 567199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 568199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 569199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 570199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 571199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 572199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 573199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(N.Val && "visit didn't populate the ValueMap!"); 574199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 575199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 576199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 577199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 578199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 579199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 58023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner if (!isa<PackedType>(VTy)) 58123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 58223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 583b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 58423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner const PackedType *PTy = cast<PackedType>(VTy); 58523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 58623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 58723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 58823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner std::vector<SDOperand> Ops; 58923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 59023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 59123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 59223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 59323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 594b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 595199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 596199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 597199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) { 598199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 599199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 600199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 601199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 602199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 603199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 604199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::vector<SDOperand> Ops; 605199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) { 6062bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6072bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 608199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 609199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 610199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 611199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 612199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 613199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 614199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 615199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 616199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 617199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 618b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 61923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 62023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 621b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 623199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 624199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(cast<ConstantIntegral>(C)->getRawValue(),VT); 625199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 626199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 627199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 628199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 629199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 630199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 631199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 632199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 633199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 634199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 635199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const Value*, unsigned>::const_iterator VMI = 636199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.ValueMap.find(V); 637199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!"); 638199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 639199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned InReg = VMI->second; 640199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 641199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 64270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 64370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 644199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 64570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 64670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (DestVT < VT) { 64770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 64870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // register pair VMI->second and VMI->second+1. 64970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 65070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 65170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (DestVT > VT) { // Promotion case 652199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(VT)) 653199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::FP_ROUND, VT, N); 654199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 655199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::TRUNCATE, VT, N); 656199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 65770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 65870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 65970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 66070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 6612e2ef9535070bb352601482cceac1140c1158cddChris Lattner const PackedType *PTy = cast<PackedType>(VTy); 6622e2ef9535070bb352601482cceac1140c1158cddChris Lattner unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT, 66370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 66470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 66570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 66670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> Ops; 66770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 66870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 66970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 67070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 67170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 67270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 67370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 67470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 67570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 67670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 67770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 67870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 67970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 68070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 68170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 68270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 68370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 68470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 68570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 68670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 68770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 68870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 68970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 69070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 69170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 69270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 69570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 69670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 69770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 6982e2ef9535070bb352601482cceac1140c1158cddChris Lattner 6992e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7002e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7012e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7022e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7032e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7042e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 706199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 707199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 708199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 709199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 710199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 713a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 716ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman std::vector<SDOperand> NewValues; 717ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 718ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 719ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 7208e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng bool isSigned = I.getOperand(i)->getType()->isSigned(); 721ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 722ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 723ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 724ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7258e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7268e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 727ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 728ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 729ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 730ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 731ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 732ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 733ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 7341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7358e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng if (isSigned) 736ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp); 737ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 738ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp); 739ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 740ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 7418e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng NewValues.push_back(DAG.getConstant(isSigned, MVT::i32)); 7421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 743ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, NewValues)); 7441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 7471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 7481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 749f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ0MBB); 7501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 7521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 7531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 7541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 7551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 7561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 7581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 7591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 760a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 761dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 7621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 7631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 764f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ1MBB); 7651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getCondition()); 7671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ1MBB == NextBlock) { 7681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is false, fall through. This means we should branch 7691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // if the condition is true to Succ #0. 770a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 771dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ0MBB))); 7721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else if (Succ0MBB == NextBlock) { 7731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is true, fall through. This means we should branch if 7741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the condition is false to Succ #1. Invert the condition first. 7751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand True = DAG.getConstant(1, Cond.getValueType()); 7761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 777a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 778dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ1MBB))); 7791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 780e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner std::vector<SDOperand> Ops; 781e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner Ops.push_back(getRoot()); 782298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // If the false case is the current basic block, then this is a self 783298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // loop. We do not want to emit "Loop: ... brcond Out; br Loop", as it 784298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // adds an extra instruction in the loop. Instead, invert the 785298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // condition and emit "Loop: ... br!cond Loop; br Out. 786298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng if (CurMBB == Succ1MBB) { 787298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng std::swap(Succ0MBB, Succ1MBB); 788298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng SDOperand True = DAG.getConstant(1, Cond.getValueType()); 789298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 790298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng } 79181e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman SDOperand True = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 79281e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ0MBB)); 79381e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, True, 79481e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ1MBB))); 7951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 799f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 800f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 801f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 802f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand SwitchOp = getValue(CB.SwitchV); 803f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand CaseOp = getValue(CB.CaseC); 804f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand Cond = DAG.getSetCC(MVT::i1, SwitchOp, CaseOp, CB.CC); 805f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 806f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 807f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 808f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 809f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 810f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 811f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 812f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 813f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 814f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 815f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.LHSBB == NextBlock) { 816f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::swap(CB.LHSBB, CB.RHSBB); 817f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 818f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 819f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 820f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 821f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.LHSBB)); 822f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.RHSBB == NextBlock) 823f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 824f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 825f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 826f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.RHSBB))); 827f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 828f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.LHSBB); 829f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.RHSBB); 830f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 831f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 83237efe6764568a3829fee26aba532283131d1a104Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 83337efe6764568a3829fee26aba532283131d1a104Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 83437efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 83537efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Need to emit different code for PIC vs. Non-PIC, specifically, 83637efe6764568a3829fee26aba532283131d1a104Nate Begeman // we need to add the address of the jump table to the value loaded, since 83737efe6764568a3829fee26aba532283131d1a104Nate Begeman // the entries in the jump table will be differences rather than absolute 83837efe6764568a3829fee26aba532283131d1a104Nate Begeman // addresses. 83937efe6764568a3829fee26aba532283131d1a104Nate Begeman 84037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 84137efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 8428825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng assert((PTy == MVT::i32 || PTy == MVT::i64) && 8438825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng "Jump table entries are 32-bit values"); 8448825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng // PIC jump table entries are 32-bit values. 8458825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng unsigned EntrySize = 8468825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) 8478825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng ? 4 : MVT::getSizeInBits(PTy)/8; 84837efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand Copy = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 84937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand IDX = DAG.getNode(ISD::MUL, PTy, Copy, 8508825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng DAG.getConstant(EntrySize, PTy)); 8512f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman SDOperand TAB = DAG.getJumpTable(JT.JTI,PTy); 8522f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman SDOperand ADD = DAG.getNode(ISD::ADD, PTy, IDX, TAB); 8538825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng SDOperand LD = DAG.getLoad(MVT::i32, Copy.getValue(1), ADD, 8548825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng DAG.getSrcValue(0)); 8552f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) { 8568825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng ADD = DAG.getNode(ISD::ADD, PTy, 8578825a485e2e99216adc0c469a7c43895cd4eae40Evan Cheng ((PTy != MVT::i32) ? DAG.getNode(ISD::SIGN_EXTEND, PTy, LD) : LD), TAB); 8582f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), ADD)); 8592f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman } else { 8602f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD)); 8612f1ae88445c696a9b9d61e14747ba721190cdc99Nate Begeman } 86237efe6764568a3829fee26aba532283131d1a104Nate Begeman} 86337efe6764568a3829fee26aba532283131d1a104Nate Begeman 864f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitch(SwitchInst &I) { 865f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 866f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 867f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 869f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 870f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 871f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 872f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 873f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (I.getNumOperands() == 2) { 874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 875f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *DefaultMBB = FuncInfo.MBBMap[I.getDefaultDest()]; 876f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 877f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (DefaultMBB != NextBlock) 878f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 879f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(DefaultMBB))); 880a3bb86dd6b6220c69d9d7e4e11aea42fa1ec2bc5Chris Lattner CurMBB->addSuccessor(DefaultMBB); 881f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 882f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 883f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 884f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 885f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 886f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 887f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<Case> Cases; 888f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 1; i < I.getNumSuccessors(); ++i) { 889f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)]; 890f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cases.push_back(Case(I.getSuccessorValue(i), SMBB)); 891f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 892f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 893f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 894f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 895f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 896f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 897f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Value *SV = I.getOperand(0); 898f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()]; 89937efe6764568a3829fee26aba532283131d1a104Nate Begeman 90037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Get the MachineFunction which holds the current MBB. This is used during 90137efe6764568a3829fee26aba532283131d1a104Nate Begeman // emission of jump tables, and when inserting any additional MBBs necessary 90237efe6764568a3829fee26aba532283131d1a104Nate Begeman // to represent the switch. 903f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction *CurMF = CurMBB->getParent(); 904f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const BasicBlock *LLVMBB = CurMBB->getBasicBlock(); 90537efe6764568a3829fee26aba532283131d1a104Nate Begeman 90617c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // If the switch has more than 5 blocks, and at least 31.25% dense, and the 90717c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // target supports indirect branches, then emit a jump table rather than 90817c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // lowering the switch to a binary tree of conditional branches. 90937efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Make this work with PIC code 9109453eea49bca1c3904047db495855c93e001d1cdNate Begeman if (TLI.isOperationLegal(ISD::BRIND, TLI.getPointerTy()) && 911f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman Cases.size() > 5) { 91237efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t First = cast<ConstantIntegral>(Cases.front().first)->getRawValue(); 91337efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getRawValue(); 914f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman double Density = (double)Cases.size() / (double)((Last - First) + 1ULL); 915f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 91617c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman if (Density >= 0.3125) { 91737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Create a new basic block to hold the code for loading the address 91837efe6764568a3829fee26aba532283131d1a104Nate Begeman // of the jump table, and jumping to it. Update successor information; 91937efe6764568a3829fee26aba532283131d1a104Nate Begeman // we will either branch to the default case for the switch, or the jump 92037efe6764568a3829fee26aba532283131d1a104Nate Begeman // table. 92137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 92237efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 92337efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(Default); 92437efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(JumpTableBB); 92537efe6764568a3829fee26aba532283131d1a104Nate Begeman 92637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Subtract the lowest switch case value from the value being switched on 92737efe6764568a3829fee26aba532283131d1a104Nate Begeman // and conditional branch to default mbb if the result is greater than the 92837efe6764568a3829fee26aba532283131d1a104Nate Begeman // difference between smallest and largest cases. 92937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SwitchOp = getValue(SV); 93037efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType VT = SwitchOp.getValueType(); 93137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 93237efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(First, VT)); 93337efe6764568a3829fee26aba532283131d1a104Nate Begeman 93437efe6764568a3829fee26aba532283131d1a104Nate Begeman // The SDNode we just created, which holds the value being switched on 93537efe6764568a3829fee26aba532283131d1a104Nate Begeman // minus the the smallest case value, needs to be copied to a virtual 93637efe6764568a3829fee26aba532283131d1a104Nate Begeman // register so it can be used as an index into the jump table in a 93737efe6764568a3829fee26aba532283131d1a104Nate Begeman // subsequent basic block. This value may be smaller or larger than the 93837efe6764568a3829fee26aba532283131d1a104Nate Begeman // target's pointer type, and therefore require extension or truncating. 93937efe6764568a3829fee26aba532283131d1a104Nate Begeman if (VT > TLI.getPointerTy()) 94037efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 94137efe6764568a3829fee26aba532283131d1a104Nate Begeman else 94237efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 94337efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 94437efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 94537efe6764568a3829fee26aba532283131d1a104Nate Begeman 94637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the range check for the jump table, and branch to the default 94737efe6764568a3829fee26aba532283131d1a104Nate Begeman // block for the switch statement if the value being switched on exceeds 94837efe6764568a3829fee26aba532283131d1a104Nate Begeman // the largest case in the switch. 94937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 95037efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(Last-First,VT), ISD::SETUGT); 95137efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 95237efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getBasicBlock(Default))); 95337efe6764568a3829fee26aba532283131d1a104Nate Begeman 954f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Build a vector of destination BBs, corresponding to each target 955f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // of the jump table. If the value of the jump table slot corresponds to 956f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // a case statement, push the case's BB onto the vector, otherwise, push 957f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // the default BB. 95837efe6764568a3829fee26aba532283131d1a104Nate Begeman std::set<MachineBasicBlock*> UniqueBBs; 95937efe6764568a3829fee26aba532283131d1a104Nate Begeman std::vector<MachineBasicBlock*> DestBBs; 960f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman uint64_t TEI = First; 961f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) { 962f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (cast<ConstantIntegral>(ii->first)->getRawValue() == TEI) { 963f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(ii->second); 964f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(ii->second); 965f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ++ii; 966f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } else { 967f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(Default); 968f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(Default); 969f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 97037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 971f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 972f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Update successor info 973f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (std::set<MachineBasicBlock*>::iterator ii = UniqueBBs.begin(), 974f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ee = UniqueBBs.end(); ii != ee; ++ii) 975f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman JumpTableBB->addSuccessor(*ii); 976f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 977f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Create a jump table index for this jump table, or return an existing 978f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // one. 97937efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 98037efe6764568a3829fee26aba532283131d1a104Nate Begeman 98137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the jump table information so that we can codegen it as a second 98237efe6764568a3829fee26aba532283131d1a104Nate Begeman // MachineBasicBlock 98337efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.Reg = JumpTableReg; 98437efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.JTI = JTI; 98537efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.MBB = JumpTableBB; 9869453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT.Default = Default; 98737efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 98837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 98937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 990f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 991f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Push the initial CaseRec onto the worklist 992f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<CaseRec> CaseVec; 993f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 994f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 995f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman while (!CaseVec.empty()) { 996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Grab a record representing a case range to process off the worklist 997f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec CR = CaseVec.back(); 998f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.pop_back(); 999f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1000f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Size is the number of Cases represented by this range. If Size is 1, 1001f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // then we are processing a leaf of the binary search tree. Otherwise, 1002f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // we need to pick a pivot, and push left and right ranges onto the 1003f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // worklist. 1004f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman unsigned Size = CR.Range.second - CR.Range.first; 1005f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1006f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (Size == 1) { 1007f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1008f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the Case's target mbb if the value being switched on SV is equal 1009f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // to C. Otherwise, branch to default. 1010f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = CR.Range.first->first; 1011f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Target = CR.Range.first->second; 1012f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default, 1013f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CR.CaseBB); 1014f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the MBB representing the leaf node is the current MBB, then just 1015f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // call visitSwitchCase to emit the code into the current block. 1016f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, push the CaseBlock onto the vector to be later processed 1017f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // by SDISel, and insert the node's MBB before the next MBB. 1018f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1019f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1020f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1021f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1022f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1023f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1024f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1025f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // split case range at pivot 1026f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseItr Pivot = CR.Range.first + (Size / 2); 1027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange LHSR(CR.Range.first, Pivot); 1028f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange RHSR(Pivot, CR.Range.second); 1029f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = Pivot->first; 1030f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *RHSBB = 0, *LHSBB = 0; 1031f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // We know that we branch to the LHS if the Value being switched on is 1032f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // less than the Pivot value, C. We use this to optimize our binary 1033f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // tree a bit, by recognizing that if SV is greater than or equal to the 1034f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // LHS's Case Value, and that Case Value is exactly one less than the 1035f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Pivot's Value, then we can branch directly to the LHS's Target, 1036f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // rather than creating a leaf node for it. 1037f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((LHSR.second - LHSR.first) == 1 && 1038f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSR.first->first == CR.GE && 1039f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(C)->getRawValue() == 1040f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.GE)->getRawValue() + 1ULL)) { 1041f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = LHSR.first->second; 1042f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1043f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = new MachineBasicBlock(LLVMBB); 1044f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(LHSBB,C,CR.GE,LHSR)); 1045f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1046f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Similar to the optimization above, if the Value being switched on is 1047f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // known to be less than the Constant CR.LT, and the current Case Value 1048f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // is CR.LT - 1, then we can branch directly to the target block for 1049f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the current Case Value, rather than emitting a RHS leaf node for it. 1050f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1051f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(RHSR.first->first)->getRawValue() == 1052f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.LT)->getRawValue() - 1ULL)) { 1053f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = RHSR.first->second; 1054f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1055f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = new MachineBasicBlock(LLVMBB); 1056f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(RHSBB,CR.LT,C,RHSR)); 1057f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1058f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1059f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the LHS node if the value being switched on SV is less than C. 1060f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, branch to LHS. 1061f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT; 1062f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(CC, SV, C, LHSBB, RHSBB, CR.CaseBB); 1063f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1064f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1065f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1066f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1067f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1068f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1069f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1070f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1071f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1072f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1073b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1074b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 107501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (I.getType()->isFloatingPoint()) { 107601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 107701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 107801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 107901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 108001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 108101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 108201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 10835fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::SUB, ISD::FSUB, ISD::VSUB); 1084b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1085b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 10865fbb5d2459a5410590f285250faa604576308a93Nate Begemanvoid SelectionDAGLowering::visitBinary(User &I, unsigned IntOp, unsigned FPOp, 10875fbb5d2459a5410590f285250faa604576308a93Nate Begeman unsigned VecOp) { 10885fbb5d2459a5410590f285250faa604576308a93Nate Begeman const Type *Ty = I.getType(); 10891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 10901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 10912c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1092b67eb9131c5c04d2e55c6b587fde954619feceafChris Lattner if (Ty->isIntegral()) { 10935fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2)); 10945fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else if (Ty->isFloatingPoint()) { 10955fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2)); 10965fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 10975fbb5d2459a5410590f285250faa604576308a93Nate Begeman const PackedType *PTy = cast<PackedType>(Ty); 1098c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 1099c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 1100c7029805ef35ce9805931067b841e6af11db382eChris Lattner setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 11015fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1102e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 11032c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1104e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1105e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1106e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1107e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1108e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1109e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 11101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 11111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode, 1114f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode UnsignedOpcode, 1115f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpcode) { 11161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 11171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 11181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode Opcode = SignedOpcode; 111980235d508e5f7a9603ef43ba6625984173ff0323Evan Cheng if (!FiniteOnlyFPMath() && I.getOperand(0)->getType()->isFloatingPoint()) 1120f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng Opcode = FPOpcode; 1121f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng else if (I.getOperand(0)->getType()->isUnsigned()) 11221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Opcode = UnsignedOpcode; 11237cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 11241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 11271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 11281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 11291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 1130b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner if (!isa<PackedType>(I.getType())) { 1131b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1132b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1133b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1134b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1135b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1136b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1137b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 11381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCast(User &I) { 11411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1142e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 114328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 11441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1145e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 1146e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast to a vector from something else. This is always a bit 1147e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1148e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 1149e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1150e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1151e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1152e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 1153e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (SrcVT == DestVT) { 11541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); // noop cast. 115528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (DestVT == MVT::i1) { 1156ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner // Cast to bool is a comparison against zero, not truncation to zero. 115728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand Zero = isInteger(SrcVT) ? DAG.getConstant(0, N.getValueType()) : 1158ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner DAG.getConstantFP(0.0, N.getValueType()); 11597cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, N, Zero, ISD::SETNE)); 116028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isInteger(SrcVT)) { 116128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isInteger(DestVT)) { // Int -> Int cast 116228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Truncating cast? 116328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 1164ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else if (I.getOperand(0)->getType()->isSigned()) 116528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 1166ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 116728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 11687e358908b885f50fb9258b7d10509bad20ca4c3bChris Lattner } else if (isFloatingPoint(DestVT)) { // Int -> FP cast 1169ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getOperand(0)->getType()->isSigned()) 117028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 1171ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 117228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 1173e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1174e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1175ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 117628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isFloatingPoint(SrcVT)) { 117728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isFloatingPoint(DestVT)) { // FP -> FP cast 117828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Rounding cast? 117928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 1180ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 118128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 1182e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (isInteger(DestVT)) { // FP -> Int cast. 1183ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getType()->isSigned()) 118428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 1185ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 118628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 118728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else { 1188e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1189ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 1190e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1191e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(SrcVT == MVT::Vector && "Unknown cast!"); 1192e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(DestVT != MVT::Vector && "Casts to vector already handled!"); 1193e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast from a vector to something else. This is always a bit 1194e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1195e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 11961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 11971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11992bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1200c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1201c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1202c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1203c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1204c7029805ef35ce9805931067b841e6af11db382eChris Lattner 12052332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 12062332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 12072332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 12082332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1209c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1210c7029805ef35ce9805931067b841e6af11db382eChris Lattner 12112bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1212384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1213384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1214384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1215384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1216384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1217384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1218384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1219c7029805ef35ce9805931067b841e6af11db382eChris Lattner 12203e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 12213e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 12223e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 12233e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 12243e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12253e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 12263e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 12273e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 12283e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 12293e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 12303e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12313e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 12331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 12341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 12351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 12371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 12381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1239c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 12401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 12411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 12421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1243a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field]; 12441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1245dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 12461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 12481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 12491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 12507c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12517c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 12527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 12537c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (CI->getRawValue() == 0) continue; 12547c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner uint64_t Offs; 12567c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 1257a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 12587c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 1259a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 12607c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 12617c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12627c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 12637c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12647c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1265a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 12667c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 12677c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12687c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 12697c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 12707c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 12717c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (Idx->getType()->isSigned()) 12727c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 12737c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 12747c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN); 12757c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 12767c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 12777c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12787c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 12797c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 12807c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 12817c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 12827c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 12836b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 12841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12887c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 12897c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 12907c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 12941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 12971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 12981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 12991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 13001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 13011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 1303a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 1304a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 1305ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman I.getAlignment()); 13061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 130868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 130968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 131068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 131168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 131268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 13131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 131468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 13151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 13161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 13181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 13191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 13201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 13211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 13221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 13231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 13241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 13251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 13261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 13271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 13281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 13291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 13301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 13311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 13321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1333adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<MVT::ValueType> VTs; 1334adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(AllocSize.getValueType()); 1335adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(MVT::Other); 1336adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<SDOperand> Ops; 1337adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getRoot()); 1338adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(AllocSize); 1339adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getIntPtrConstant(Align)); 1340adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, Ops); 13411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DAG.setRoot(setValue(&I, DSA).getValue(1)); 13421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 13441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 13451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 13461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 13491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 1350edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1351d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 1352d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 1353d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 1354d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 1355d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 1356d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 1357d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 135828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 135928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, getLoadFrom(I.getType(), Ptr, DAG.getSrcValue(I.getOperand(0)), 136028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 136128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 136228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 136328b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 136428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 136528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 13665fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 13678cfa57b1b4eade4e0101195b2f94ab288cd03563Nate Begeman if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 13684ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1369c7029805ef35ce9805931067b841e6af11db382eChris Lattner L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, SrcValue); 13705fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 137128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SrcValue); 13725fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1373d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 137428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 1375d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 1376d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 1377d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 137828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 137928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 13801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 13841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 13851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 13861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 1387369e6db9b6033bb60519b0ad84afeacc9ec9b416Chris Lattner DAG.setRoot(DAG.getNode(ISD::STORE, MVT::Other, getRoot(), Src, Ptr, 138806ef88472f7bac3512e224974e87a0a456471b82Andrew Lenharth DAG.getSrcValue(I.getOperand(1)))); 13891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13910eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 13920eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 13930eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 13940eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 13950eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 13960eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 13970eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 13980eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 13990eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1400e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 1401e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 1402e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 1403e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 1404e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 1405e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 1406e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 1407e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 1408e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 14090eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 14100eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 14110eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 14120eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 14137255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 1414e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 14150eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14160eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 14170eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<SDOperand> Ops; 1418e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 1419e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 1420e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 1421e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 1422e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 1423e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 1424e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 1425e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14260eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14270eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 14280eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 14290eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14300eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 14310eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 14320eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 14330eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14340eade319cdb72e24c11d068728a98083737c6435Chris Lattner // If this is a vector type, force it to the right packed type. 14350eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 14360eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType()); 14370eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 14380eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14390eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 14400eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 14410eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 14420eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14430eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14440eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 14450eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 14460eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 14470eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14480eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14490eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 14500eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14510eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 14520eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 14530eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 14540eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 14550eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14560eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 14570eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 14580eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14590eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14600eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 14610eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 14620eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14630eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 14640eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 14650eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14660eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 146748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 146848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 146948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTs, Ops); 147048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 147148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTs, Ops); 147248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 147348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTs, Ops); 147448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 1475e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 1476e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 1477e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 1478e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 1479e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 1480e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 1481e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14820eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14830eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) { 14840eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 14850eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 14860eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 14870eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 14880eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14890eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 14900eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14910eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 14920eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1493c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 1494c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 1495c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 1496c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 1497c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 1498c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 14990eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 15000eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 15010eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 15020eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 1503c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 1504c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 1505c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 1506c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0; 1507c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0; 1508c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 1509c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_setjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1510c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 1511c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 1512c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_longjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1513c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 151403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 151503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 151603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 151703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 151803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 151903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 152003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 152103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 152203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 152303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 152403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 152503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 1526c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 152786cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 1528ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 152943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 1530fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) { 1531ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey std::vector<SDOperand> Ops; 153236ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 1533ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(getRoot()); 153443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getLineValue())); 153543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getColumnValue())); 1536ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 153743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext()); 1538ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 153943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 154043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1541ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getFileName())); 1542ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getDirectory())); 1543ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 154443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops)); 154586cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 154643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1547b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 154836ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 154943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 155043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 155143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 1552fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) { 155343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 155443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext()); 155643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 155843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 155943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 156143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 156243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1563b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 156443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 156543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 156643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 156743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 1568fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) { 156943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 157043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 157143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext()); 157243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 157343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 157443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 157543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 157643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 157743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 157843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1579b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 158043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 158143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 158243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 158343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 1584fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && FSI.getSubprogram() && 1585fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey DebugInfo->Verify(FSI.getSubprogram())) { 158643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 158743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 158843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram()); 158943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 159043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 159143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 159243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 159343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 159443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 159543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1596b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 159743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 159843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 159943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 160043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 1601bf7637d59028a5d9911769810f537c499e23bb8eJim Laskey if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) { 160243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 160343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 16040892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 16050892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) { 160643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex()); 160743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 160843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 160943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 161043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 161143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 1612c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16130b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f32: 16140b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f64: 1615c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)), 1616c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(2)), ISD::SETUO)); 1617c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1618c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16190b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 16200b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 1621c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 1622c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1623c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1624c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1625c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 1626c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1627c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 1628c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1629c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 16308b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 16318b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<MVT::ValueType> VTs; 16328b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::i64); 16338b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::Other); 16348b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<SDOperand> Ops; 16358b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth Ops.push_back(getRoot()); 16368b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, VTs, Ops); 16378b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 16388b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 163951b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 16408b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 1641d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i16: 1642d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i32: 1643d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i64: 1644d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 1645d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 1646d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 1647d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 16480b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i8: 16490b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i16: 16500b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i32: 16510b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i64: 1652c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTTZ, 1653c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1654c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1655c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16560b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i8: 16570b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i16: 16580b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i32: 16590b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i64: 1660c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTLZ, 1661c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1662c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1663c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16640b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i8: 16650b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i16: 16660b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i32: 16670b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i64: 1668c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTPOP, 1669c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1670c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1671c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1672140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 1673140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<MVT::ValueType> VTs; 1674140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(TLI.getPointerTy()); 1675140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(MVT::Other); 1676140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<SDOperand> Ops; 1677140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner Ops.push_back(getRoot()); 1678140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, VTs, Ops); 1679140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 1680140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 1681140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 1682140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 168339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 168439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 168539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 1686140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 168739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 1688ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 1689ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 1690ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 1691c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1692c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 1693c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 1694c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 169664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 1697c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 1698c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (F->isExternal()) 1699c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 1700c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 1701c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 1702c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 1703c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 1704c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 1705a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 1706a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 1707a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1708a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 1709a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 1710a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 1711a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 1712a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 1713a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 1714a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 1715a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 1716a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 1717c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1718c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1719c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1720c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1721c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 1722c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 1723c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1724c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 1725f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1726f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 172706a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1728c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1729f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 1730f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1731f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1732c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 1733f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1734f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 173506a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1736c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1737f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 1738f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1739f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1740f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1741c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1742ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 1743ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 1744ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 1745c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1746edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 174764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 174864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 174964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 175064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 175164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 17521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 1753c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner Args.reserve(I.getNumOperands()); 17541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 17551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Arg = I.getOperand(i); 17561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand ArgNode = getValue(Arg); 17571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(ArgNode, Arg->getType())); 17581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1759edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 17608e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType()); 17618e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 1762edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1763cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 17649092fa310c8b2b1645b0d448c4c34b1e8ddc131dChris Lattner TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(), 1765adf6a965a321372c640845407195594835921eb4Chris Lattner I.isTailCall(), Callee, Args, DAG); 17661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getType() != Type::VoidTy) 1767cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); 1768cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 17691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1771864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 17729f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 1773864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 1774864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1775864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 1776864635ad7b3046d3042311423071152c613961deChris Lattner 1777864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 1778864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 1779864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 1780864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 1781864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 1782864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1783864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 17849f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 17859f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 17869f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 17879f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 1788864635ad7b3046d3042311423071152c613961deChris Lattner } 1789864635ad7b3046d3042311423071152c613961deChris Lattner 1790cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 1791864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 1792864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 1793864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 1794864635ad7b3046d3042311423071152c613961deChris Lattner 1795cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 1796cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 1797cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1798cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 1799cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 1800cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } else { 1801864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 1802cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 1803864635ad7b3046d3042311423071152c613961deChris Lattner} 1804864635ad7b3046d3042311423071152c613961deChris Lattner 1805c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 1806c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 1807c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 1808c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 1809a844126c43976387a66dafbe5137a762169f1f34Evan Cheng SDOperand &Chain, SDOperand &Flag, 1810a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MVT::ValueType PtrVT) const { 1811c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 1812c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 1813c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 1814c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 18150c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (MVT::isInteger(RegVT)) { 18160c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner if (RegVT < ValueVT) 18170c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::TRUNCATE, RegVT, Val); 18180c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner else 18190c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 18200c48fd4610cc7a90a998428c93a0c68246e79e57Chris Lattner } else 1821c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 1822c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1823c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 1824c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1825c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 18269f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 18279f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 18289f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 18299f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 18309f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 1831c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 1832a844126c43976387a66dafbe5137a762169f1f34Evan Cheng DAG.getConstant(i, PtrVT)); 18339f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 1834c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1835c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1836c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1837c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1838864635ad7b3046d3042311423071152c613961deChris Lattner 1839c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 1840c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 1841c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 1842c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 18439f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 1844c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32)); 1845c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 1846c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 1847c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1848864635ad7b3046d3042311423071152c613961deChris Lattner 1849864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 1850864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 1851864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 1852864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 18539b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 18549b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 1855f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 1856f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 18579b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 18589b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 1859f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 1860f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 18619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 18629b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 18639b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 18649b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 18659b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 18669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 1867f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 1868f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 1869f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 1870f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 1871f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 1872f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 1873f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1874f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 18759b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18769b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18779b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1878f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 18799b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1880864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 1881864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 1882864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 1883864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 18849b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 18859b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 1886f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 1887f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 1888f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 1889f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 1890f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 1891f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1892f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 1893864635ad7b3046d3042311423071152c613961deChris Lattner } 1894f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 1895864635ad7b3046d3042311423071152c613961deChris Lattner} 1896864635ad7b3046d3042311423071152c613961deChris Lattner 1897864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 1898864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 1899864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 1900864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 19014e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 1902864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 1903864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 1904864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 1905864635ad7b3046d3042311423071152c613961deChris Lattner 1906864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 1907864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 1908864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 1909864635ad7b3046d3042311423071152c613961deChris Lattner 1910864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 1911864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 1912864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 1913cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 1914cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 1915cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 1916cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 1917cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 1918864635ad7b3046d3042311423071152c613961deChris Lattner 1919864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 1920864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 1921864635ad7b3046d3042311423071152c613961deChris Lattner 1922864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 1923864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 1924864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 1925864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 1926864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 1927864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 1928864635ad7b3046d3042311423071152c613961deChris Lattner 1929864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 1930864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 1931864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 1932864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 1933864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 1934864635ad7b3046d3042311423071152c613961deChris Lattner } 1935864635ad7b3046d3042311423071152c613961deChris Lattner } 1936864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 1937864635ad7b3046d3042311423071152c613961deChris Lattner } 1938864635ad7b3046d3042311423071152c613961deChris Lattner 1939864635ad7b3046d3042311423071152c613961deChris Lattner // This is a reference to a register class. Allocate NumRegs consecutive, 1940864635ad7b3046d3042311423071152c613961deChris Lattner // available, registers from the class. 1941864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> RegClassRegs = 1942864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 1943864635ad7b3046d3042311423071152c613961deChris Lattner 19444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 19454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 1946864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 1947864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 1948864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 19494e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 1950864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 1951864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 1952864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1953864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1954864635ad7b3046d3042311423071152c613961deChris Lattner continue; 1955864635ad7b3046d3042311423071152c613961deChris Lattner } 1956864635ad7b3046d3042311423071152c613961deChris Lattner 19574e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 19584e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 19599b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 1960864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 1961864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1962864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1963864635ad7b3046d3042311423071152c613961deChris Lattner continue; 19644e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 19654e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1966864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 1967864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 1968864635ad7b3046d3042311423071152c613961deChris Lattner 1969864635ad7b3046d3042311423071152c613961deChris Lattner // If we allocated enough consecutive 1970864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 1971864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 1972864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 1973864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 1974864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 1975864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 1976864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 1977864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 1978864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 1979864635ad7b3046d3042311423071152c613961deChris Lattner } 1980864635ad7b3046d3042311423071152c613961deChris Lattner 1981864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 1982864635ad7b3046d3042311423071152c613961deChris Lattner } 19834e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 1984864635ad7b3046d3042311423071152c613961deChris Lattner 1985864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 1986864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 19874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 19884e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1989864635ad7b3046d3042311423071152c613961deChris Lattner 1990ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 1991ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 1992ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 1993ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 1994ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1995ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 1996ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 1997ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1998ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Note, we treat inline asms both with and without side-effects as the same. 1999ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // If an inline asm doesn't have side effects and doesn't access memory, we 2000ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // could not choose to not chain it. 2001ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner bool hasSideEffects = IA->hasSideEffects(); 2002ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 20032cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 20041efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 2005ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2006ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 2007ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 2008ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 2009ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 2010ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 2011ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 2012ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2013ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 2014ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 2015ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 20164e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 20174e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 20184e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 20194e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 20204e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 20211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 20224e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 20234e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 20244e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 20252223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 20261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 20271efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20281efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 20291efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 20301efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 20311efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 20321efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 20331efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 20341efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 203522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 20361efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 20371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20381efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20391efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20401efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20411efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 20421efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20431efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20441efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 20451efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 20461efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20471efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20481efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20491efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 20501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2051864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2052864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 20531efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2054864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2055864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2056864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2057864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2058864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 20594e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 20604e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 20614e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 20624e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2063864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20644e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 20654e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 20662223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2067864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20691efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20701efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2071864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20721efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20734e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 20744e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2075864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2076864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20784e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20794e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20802cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 20810f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 20820f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2083864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2084864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 20851efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 20860f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 20876656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 20882cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 20892cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 20901efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20912cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 20922cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 209322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 209422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 209522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 209622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 209822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 209922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 210022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 210122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 210222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 210322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 210422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 210522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 210622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 210722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 210822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 210922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 211022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 211122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 211222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 211322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 211422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 211522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 211622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 211722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 211822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 211922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 212022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 212122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 212222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 212322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 212422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 212522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 212622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 2127864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 2128864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 2129864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 2130864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 2131864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2132864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 21332223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 2134864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 2135864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 2136864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 2137864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 2138864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 2139864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 2140864635ad7b3046d3042311423071152c613961deChris Lattner assert(!Regs.Regs.empty() && "Couldn't allocate output reg!"); 21412cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 21422cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 2143864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 21442cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 21452cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 2146864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 21472cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 214822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 214922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 21502cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 21512cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 21526656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 21536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 21546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 2155c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 21566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 21576656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 21586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 215922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 21604e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 21613d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 21622223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 21632223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 21642223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 21652223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 21663d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 2167c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 2168c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 2169c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 2170c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 2171c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 2172c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2173c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2174a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 2175a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 2176c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2177c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 2178c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2179c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2180c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2181c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2182c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2183c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2184c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2185c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 2186c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue MatchedRegs; 2187c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 2188c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 2189c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 2190c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 2191c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.Regs.push_back(Reg); 2192c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2193c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2194c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Use the produced MatchedRegs object to 2195a844126c43976387a66dafbe5137a762169f1f34Evan Cheng MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, 2196a844126c43976387a66dafbe5137a762169f1f34Evan Cheng TLI.getPointerTy()); 2197c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 219887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 219987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 220087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 220187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 220287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 220387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 22043d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 220587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 220687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!TLI.isOperandValidForConstraint(InOperandVal, ConstraintCode[0])) 220787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2208c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 220987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 221087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 221187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 221287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 221387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 221487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 221587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 221687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 221787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Check that the operand isn't a float. 221887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 221987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2220c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 222187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 222287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 222387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 222487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 222587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 222687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 222787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 222887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 222987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 223087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 223187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 2232c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 22332223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 223487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 223587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 223687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 223787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 223887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 223987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 224087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 224187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 224287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 224387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 2244a844126c43976387a66dafbe5137a762169f1f34Evan Cheng InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag, TLI.getPointerTy()); 224587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 224687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 22476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2249c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 2250c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 2251c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 2252c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 2253c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 2254c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 2255c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 2256c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 22576656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2259c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 22606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2261ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2262ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 2263ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 2264ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 2265ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2266ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<MVT::ValueType> VTs; 2267ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Other); 2268ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Flag); 2269ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, VTs, AsmNodeOperands); 2270ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 2271ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22726656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 22736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 2274864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 2275864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 22766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 22786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 22806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 22816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 2282864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 22836656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 2284864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 2285864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 22866656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2287ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22886656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 22896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<SDOperand> OutChains; 22906656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 22916656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner OutChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain, 22926656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner StoresToEmit[i].first, 22936656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 22946656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner DAG.getSrcValue(StoresToEmit[i].second))); 22956656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 22966656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 2297ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 2298ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 2299ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2300ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 23011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 23021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 23031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 230568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 230668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 230768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 230868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 230968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 23101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 2312a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 23131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 23141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 23151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2317a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType())); 2318cf5734dddd66af9388a171b44996505ede47feedChris Lattner 2319cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2320adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true, 2321cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 2322cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 2323cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 2324cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 23251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 23281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 23291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(getValue(I.getOperand(0)), 2330a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson TLI.getTargetData()->getIntPtrType())); 23311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 2332cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2333adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true, 2334cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 2335cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2338025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 2339025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 2340025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 2341025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 2342025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 2343025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 2344025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 2345025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner std::cerr << "If a target marks an instruction with " 2346025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "'usesCustomDAGSchedInserter', it must implement " 2347025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "TargetLowering::InsertAtEndOfBasicBlock!\n"; 2348025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 2349025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 2350025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 2351025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 235239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 2353acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 2354acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2355acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 235639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 235739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 23581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 2359acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 2360acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 2361acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 2362acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 2363acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 23641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 2367acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 2368acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2369acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 23701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 2373acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 2374acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2375acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 2376acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 2377acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 23781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2380fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 2381fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 2382f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 2383f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 2384fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 2385fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 2386fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 2387fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 23888c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 2389fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 2390fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 2391fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2392fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 2393fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 2394fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2395fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2396fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2397fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2398fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2399fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2400fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 2401fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2402fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 2403fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 2404fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2405fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2406fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2407fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 2408fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 2409fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 2410fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2411fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2412fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (unsigned i = 0; i != NumVals; ++i) 2413fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 2414fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2415fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2416fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2417fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumElems = cast<PackedType>(I->getType())->getNumElements(); 2418fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner const Type *EltTy = cast<PackedType>(I->getType())->getElementType(); 2419f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2420fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2421fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2422fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2423fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2424fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 2425fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2426fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2427fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2428fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2429fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2430fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2431fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 24323b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 24338c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 2434fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2435fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 2436fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, RetVals, Ops).Val; 24378c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 24388c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 2439fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2440fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 2441fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 2442fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 2443fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2444fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2445fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2446fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2447fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2448fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2449fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 2450fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2451fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 2452fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 2453fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 2454fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext 2455fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner : ISD::AssertZext; 2456fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT)); 2457fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 2458fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2459fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2460fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 2461fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2462fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 2463fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2464fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2465fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2466fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2467fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be reassembled from small 2468fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the source elt type is and how many small 2469fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it is. 2470fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2471fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2472fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (NumVals == 2) { 2473fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Lo = SDOperand(Result, i++); 2474fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Hi = SDOperand(Result, i++); 2475fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2476fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (!isLittleEndian()) 2477fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::swap(Lo, Hi); 2478fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2479fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi)); 2480fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2481fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Value scalarized into many values. Unimp for now. 2482fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2483fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2484fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2485fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2486fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2487020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const PackedType *PTy = cast<PackedType>(I->getType()); 2488020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 2489020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 2490f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2491fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2492fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2493fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2494d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2495020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 2496020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 2497d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 2498d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 2499d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 2500d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 2501d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 2502fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2503da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2504fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2505fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2506fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2507fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2508fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2509fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 2510fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 2511fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2512f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2513f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 2514f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 2515f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 2516f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 2517f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 2518f4ec817299a4187044a6162c2f520772b3ad69a0Chris LattnerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, 2519f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 2520f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 2521f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 2522f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<SDOperand> Ops; 2523f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 2524f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 2525f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 2526f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 2527f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 2528f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2529f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 2530f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 2531f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(Args[i].second); 2532f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Op = Args[i].first; 2533f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng bool isSigned = Args[i].second->isSigned(); 2534f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2535f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2536f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2537f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2538d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2539f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2540f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2541f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 2542f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng unsigned ExtOp = isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 2543f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 2544f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2545f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2546f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 2547f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2548f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2549d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2550f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2551f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2552f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2553f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 2554f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2555f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2556f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2557f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2558f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (NumVals == 2) { 2559f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2560f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(0, getPointerTy())); 2561f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2562f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(1, getPointerTy())); 2563f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (!isLittleEndian()) 2564f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::swap(Lo, Hi); 2565f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2566f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Lo); 2567d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2568f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Hi); 2569d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2570f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2571f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Value scalarized into many values. Unimp for now. 2572f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2573f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2574f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2575da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 2576da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 2577da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(Args[i].second); 2578da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 2579da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 2580da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2581da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2582da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2583da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 25841b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 25851b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner // Insert a VBIT_CONVERT of the MVT::Vector type to the packed type. 25861b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 25871b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 2588d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 25891b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 2590da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 2591da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2592da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2593f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2594f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2595f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2596f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2597f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2598f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 2599f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<MVT::ValueType> RetTys; 2600f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2601f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 2602f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2603f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2604f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2605f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2606f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 2607f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2608f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2609f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 2610f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2611f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2612f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2613f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 2614f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2615f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2616f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2617f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2618f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 2619f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 2620f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2621da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 2622da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 2623da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(RetTy); 2624da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 2625da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 2626da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2627da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2628da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2629da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2630da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2631da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 2632da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 2633da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 2634da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2635da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2636f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2637f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2638f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2639f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2640f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 2641f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2642f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 2643f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, RetTys, Ops); 2644f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2645f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 2646f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 2647f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 2648f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 2649f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 2650f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2651f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 2652f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 2653f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2654f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 2655f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 2656da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 2657da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBITCONVERT to convert from the packed result type to the 2658da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 2659da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = cast<PackedType>(RetTy)->getNumElements(); 2660da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = cast<PackedType>(RetTy)->getElementType(); 2661da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2662da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2663da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2664da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2665da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2666da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 2667da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 2668da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 2669d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 2670d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 2671da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 2672da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2673da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2674da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 2675f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned AssertOp = RetTy->isSigned() ? 2676f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::AssertSext : ISD::AssertZext; 2677f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 2678f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 2679f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 2680f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2681f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 2682f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 2683f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2684f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2685f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 2686f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 2687f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 2688f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2689f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2690f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 2691f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2692f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2693f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2694f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 2695f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 2696f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2697f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2698f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 269939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// It is always conservatively correct for llvm.returnaddress and 270039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// llvm.frameaddress to return 0. 2701f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// 2702f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be 2703f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// expanded to 0 if the target wants. 270439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnerstd::pair<SDOperand, SDOperand> 270539ae3622791986a0232f7e4797b633f8fa9e54d2Chris LattnerTargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, 270639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth, SelectionDAG &DAG) { 270739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain); 27081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 27091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 271050381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 2711171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 2712171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 2713d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 2714171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 2715171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 27160aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 27170aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 27180aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 27190aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 27200aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 27210aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 27220aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 272339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) { 272439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth = (unsigned)cast<ConstantUInt>(I.getOperand(1))->getValue(); 272539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner std::pair<SDOperand,SDOperand> Result = 2726a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG); 272739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner setValue(&I, Result.first); 272839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner DAG.setRoot(Result.second); 272939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 27301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 273174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 27321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 27331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 2734a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 27351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 27361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 27371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 27381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 27391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 27401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 27411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 27421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 27431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 27451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 27461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 27471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 27481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 27491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 27501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 27511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 27521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 27531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 27541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 27551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 27581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 276174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 276274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 276374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 276474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 276574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 276674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 276774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng MVT::ValueType CurVT = VT; 276874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 276974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 277074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 277174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 277274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 277374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Val = (Val << 8) | Str[Offset]; 277474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 277574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 277674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 277774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 277874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 27791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 27801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 27811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 27821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 27831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 27841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 2786c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 278780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 278880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 2789c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 2790c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 2791c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 27921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 27931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 27951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 27961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 27971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 27981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 27991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 28001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 28011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 28021db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 28031db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 28041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 28051db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 28061db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 28071db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 28081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 28091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 28101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 28111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 28121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 281380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 281480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 281580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 281680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 28171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 281880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 281980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 282080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 2821dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 28221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 28231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 28241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 28251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 28261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 28271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 282880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 282980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 283080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 283180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 28321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 28331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 28341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 283580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 283680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 28371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 28381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28397041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 28401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 28411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 28421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 28431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 28441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 28451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 28461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 28481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 28491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 28511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 28521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<SDOperand> OutChains; 28531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 2854ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 28551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 2856c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 2857c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 285880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 28591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 28601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 28611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 28621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 2863a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 2864c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, getRoot(), 2865c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Value, 2866864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 2867864635ad7b3046d3042311423071152c613961deChris Lattner DAG.getSrcValue(I.getOperand(1), Offset)); 2868c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 2869c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 2870c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2871c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2872c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 2873c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2874c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 2875c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 2876c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 2877c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 2878cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 287974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 288074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 2881cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 288274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 288374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 288474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 288574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 288674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 288774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 288874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 2889cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 289074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 289174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 289274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 2893cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (GV) { 28940937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 2895cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 2896cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 2897cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 2898cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 2899cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 290074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 290174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2902c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 2903c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 2904c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 290574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 290674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2907cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 290874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 290974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 291074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 291174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 291274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 291374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 291474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 291574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 291674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 291774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(2), SrcOff)); 291874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 291974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 292074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 292174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 292274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 292374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 2924c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 292574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 292674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 29271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2929c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 29301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2932c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 2933c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 2934c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains)); 2935c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 2936c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 29371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 29397041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner std::vector<SDOperand> Ops; 2940a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner Ops.push_back(getRoot()); 29411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op1); 29421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op2); 29431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op3); 29441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op4); 29457041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, Ops)); 29461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29487041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 29497041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 29507041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 29511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 29531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 29541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2956495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 295736b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // FIXME: we only modify the CFG to split critical edges. This 295836b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // updates dom and loop info. 2959495a0b51915eb763576874f29192820b731edc22Chris Lattner} 29601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2961c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 29627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// OptimizeNoopCopyExpression - We have determined that the specified cast 29637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// instruction is a noop copy (e.g. it's casting from one pointer type to 29647e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// another, int->uint, or int->sbyte on PPC. 2965903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// 2966903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// Return true if any changes are made. 2967903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI) { 29687e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *DefBB = CI->getParent(); 29697e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29707e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner /// InsertedCasts - Only insert a cast in each block once. 29717e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner std::map<BasicBlock*, CastInst*> InsertedCasts; 29727e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 2973903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = false; 29747e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 29757e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UI != E; ) { 29767e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Use &TheUse = UI.getUse(); 29777e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *User = cast<Instruction>(*UI); 29787e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Figure out which BB this cast is used in. For PHI's this is the 29807e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // appropriate predecessor block. 29817e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *UserBB = User->getParent(); 29827e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 29837e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner unsigned OpVal = UI.getOperandNo()/2; 29847e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UserBB = PN->getIncomingBlock(OpVal); 29857e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 29867e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29877e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Preincrement use iterator so we don't invalidate it. 29887e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner ++UI; 29897e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29907e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this user is in the same block as the cast, don't change the cast. 29917e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (UserBB == DefBB) continue; 29927e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29937e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If we have already inserted a cast into this block, use it. 29947e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 29957e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29967e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (!InsertedCast) { 29977e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock::iterator InsertPt = UserBB->begin(); 29987e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 29997e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 30007e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner InsertedCast = 30017e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 3002903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = true; 30037e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 30047e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 30057e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Replace a use of the cast with a use of the new casat. 30067e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner TheUse = InsertedCast; 30077e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 3008903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3009903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If we removed all uses, nuke the cast. 3010903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->use_empty()) 3011903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner CI->eraseFromParent(); 3012903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3013903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return MadeChange; 30147e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner} 3015c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3016903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset, 3017903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// casting to the type of GEPI. 3018f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattnerstatic Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB, 3019f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *GEPI, Value *Ptr, 3020f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Value *PtrOffset) { 3021903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (V) return V; // Already computed. 3022903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3023903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner BasicBlock::iterator InsertPt; 3024903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (BB == GEPI->getParent()) { 3025903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If insert into the GEP's block, insert right after the GEP. 3026903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = GEPI; 3027903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ++InsertPt; 3028903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3029903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Otherwise, insert at the top of BB, after any PHI nodes 3030903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = BB->begin(); 3031903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 3032903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3033903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3034903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into 3035903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // BB so that there is only one value live across basic blocks (the cast 3036903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // operand). 3037903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CastInst *CI = dyn_cast<CastInst>(Ptr)) 3038903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType())) 3039903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 3040903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3041903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Add the offset, cast it to the right type. 3042903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt); 3043f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner return V = new CastInst(Ptr, GEPI->getType(), "", InsertPt); 3044903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3045903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3046903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to 3047903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One 3048903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's 3049903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to 3050903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// sink PtrOffset into user blocks where doing so will likely allow us to fold 3051903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// the constant add into a load or store instruction. Additionally, if a user 3052903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// is a pointer-pointer cast, we look through it to find its users. 3053903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr, 3054903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Constant *PtrOffset, BasicBlock *DefBB, 3055903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GetElementPtrInst *GEPI, 3056f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> &InsertedExprs) { 3057903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (!RepPtr->use_empty()) { 3058903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Instruction *User = cast<Instruction>(RepPtr->use_back()); 3059903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3060903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If the user is a Pointer-Pointer cast, recurse. 3061903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<CastInst>(User) && isa<PointerType>(User->getType())) { 3062903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3063903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3064903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we 3065903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // could invalidate an iterator. 3066903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->setOperand(0, UndefValue::get(RepPtr->getType())); 3067903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner continue; 3068903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3069903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3070903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a load of the pointer, or a store through the pointer, emit 3071903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // the increment into the load/store block. 3072f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *NewVal; 3073903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<LoadInst>(User) || 3074903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) { 3075903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()], 3076903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->getParent(), GEPI, 3077903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3078903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3079903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this use is not foldable into the addressing mode, use a version 3080903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // emitted in the GEP block. 3081903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI, 3082903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3083903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3084903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3085f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner if (GEPI->getType() != RepPtr->getType()) { 3086f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner BasicBlock::iterator IP = NewVal; 3087f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner ++IP; 3088f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner NewVal = new CastInst(NewVal, RepPtr->getType(), "", IP); 3089f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner } 3090903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->replaceUsesOfWith(RepPtr, NewVal); 3091903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3092903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3093903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3094903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3095c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction 3096c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// selection, we want to be a bit careful about some things. In particular, if 3097c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// we have a GEP instruction that is used in a different block than it is 3098c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// defined, the addressing expression of the GEP cannot be folded into loads or 3099c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// stores that use it. In this case, decompose the GEP and move constant 3100c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// indices into blocks that use it. 3101903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeGEPExpression(GetElementPtrInst *GEPI, 3102a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD) { 3103c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP is only used inside the block it is defined in, there is no 3104c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // need to rewrite it. 3105c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool isUsedOutsideDefBB = false; 3106c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock *DefBB = GEPI->getParent(); 3107c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end(); 3108c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner UI != E; ++UI) { 3109c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (cast<Instruction>(*UI)->getParent() != DefBB) { 3110c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner isUsedOutsideDefBB = true; 3111c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3112c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3113c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3114903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!isUsedOutsideDefBB) return false; 3115c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3116c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP has no non-zero constant indices, there is nothing we can do, 3117c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // ignore it. 3118c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool hasConstantIndex = false; 3119903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool hasVariableIndex = false; 3120c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3121c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3122903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) { 3123c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue()) { 3124c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner hasConstantIndex = true; 3125c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3126c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3127903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3128903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner hasVariableIndex = true; 3129903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3130c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3131903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3132903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a "GEP X, 0, 0, 0", turn this into a cast. 3133903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !hasVariableIndex) { 3134903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Value *NC = new CastInst(GEPI->getOperand(0), GEPI->getType(), 3135903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->getName(), GEPI); 3136903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->replaceAllUsesWith(NC); 3137903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->eraseFromParent(); 3138903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3139903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3140903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 31413802c2552fe4475418db3c948e7601d7259f996dChris Lattner // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses. 3142903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0))) 3143903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return false; 3144c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3145c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the 3146c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constant offset (which we now know is non-zero) and deal with it later. 3147c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner uint64_t ConstantOffset = 0; 3148a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const Type *UIntPtrTy = TD->getIntPtrType(); 3149c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Ptr = new CastInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI); 3150c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner const Type *Ty = GEPI->getOperand(0)->getType(); 3151c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3152c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3153c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3154c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Idx = *OI; 3155c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 3156c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 3157c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (Field) 3158a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field]; 3159c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = StTy->getElementType(Field); 3160c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } else { 3161c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 3162c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3163c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Handle constant subscripts. 3164c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 3165c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue() == 0) continue; 3166c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3167c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 3168a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 3169c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner else 3170a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset+=TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 3171c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner continue; 3172c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3173c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3174c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Ptr = Ptr + Idx * ElementSize; 3175c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3176c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Cast Idx to UIntPtrTy if needed. 3177c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = new CastInst(Idx, UIntPtrTy, "", GEPI); 3178c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3179a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 3180c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Mask off bits that should not be set. 3181c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3182c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *SizeCst = ConstantUInt::get(UIntPtrTy, ElementSize); 3183c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3184c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Multiply by the element size and add to the base. 3185c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI); 3186c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI); 3187c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3188c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3189c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3190c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Make sure that the offset fits in uintptr_t. 3191c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3192c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *PtrOffset = ConstantUInt::get(UIntPtrTy, ConstantOffset); 3193c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3194c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Okay, we have now emitted all of the variable index parts to the BB that 3195c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // the GEP is defined in. Loop over all of the using instructions, inserting 3196c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // an "add Ptr, ConstantOffset" into each block that uses it and update the 3197c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // instruction to use the newly computed value, making GEPI dead. When the 3198c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // user is a load or store instruction address, we emit the add into the user 3199c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // block, otherwise we use a canonical version right next to the gep (these 3200c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // won't be foldable as addresses, so we might as well share the computation). 3201c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner 3202f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> InsertedExprs; 3203903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3204c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3205c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Finally, the GEP is dead, remove it. 3206c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner GEPI->eraseFromParent(); 3207903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3208903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3209c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner} 3210c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 32111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 32121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 32131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 32141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "\n\n\n=== " << Fn.getName() << "\n"); 32151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3216c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // First, split all critical edges for PHI nodes with incoming values that are 3217c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constants, this way the load of the constant into a vreg will not be placed 3218c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // into MBBs that are used some other way. 3219c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 32207e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // In this pass we also look for GEP and cast instructions that are used 32217e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // across basic blocks and rewrite them to improve basic-block-at-a-time 32227e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // selection. 32237e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // 3224c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 3225903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = true; 3226903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (MadeChange) { 3227903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = false; 322836b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 322936b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner PHINode *PN; 3230c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock::iterator BBI; 3231c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (BBI = BB->begin(); (PN = dyn_cast<PHINode>(BBI)); ++BBI) 323236b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 323336b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner if (isa<Constant>(PN->getIncomingValue(i))) 323436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner SplitCriticalEdge(PN->getIncomingBlock(i), BB); 3235c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 32367e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (BasicBlock::iterator E = BB->end(); BBI != E; ) { 32377e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *I = BBI++; 32387e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 3239903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData()); 32407e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } else if (CastInst *CI = dyn_cast<CastInst>(I)) { 32417e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is a noop copy, sink it into user blocks to reduce the number 32427e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // of virtual registers that must be created and coallesced. 32437e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 32447e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType DstVT = TLI.getValueType(CI->getType()); 32457e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32467e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // This is an fp<->int conversion? 32477e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT)) 32487e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner continue; 32497e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32507e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is an extension, it will be a zero or sign extension, which 32517e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // isn't a noop. 32527e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT < DstVT) continue; 32537e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32547e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If these values will be promoted, find out what they will be promoted 32557e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 32567e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // are. 32577e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) 32587e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner SrcVT = TLI.getTypeToTransformTo(SrcVT); 32597e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(DstVT) == TargetLowering::Promote) 32607e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner DstVT = TLI.getTypeToTransformTo(DstVT); 32617e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 32637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT == DstVT) 3264903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeNoopCopyExpression(CI); 32657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 32667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 326736b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner } 3268903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3269c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 32701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 32711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 32731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3274edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 32751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 32761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3279ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerSDOperand SelectionDAGISel:: 3280ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerCopyValueToVirtualRegister(SelectionDAGLowering &SDL, Value *V, unsigned Reg) { 3281f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner SDOperand Op = SDL.getValue(V); 328218c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3283d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 328418c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3285d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3286d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3287d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3288d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3289d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3290d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SelectionDAG &DAG = SDL.DAG; 3291d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3292d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 32931c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 329470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 329570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 329670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()), 329770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 32981c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 329970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 330070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 330170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 330270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 330370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 330470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 330570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 330670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 330770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 330870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> OutChains; 330970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Root = SDL.getRoot(); 331070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 331170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 3312a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(i, TLI.getPointerTy())); 331370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 331470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 331570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 331670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 331770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 331870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 331970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 332070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 332170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 332270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 332370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 332470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 332570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 332670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3327a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(0, TLI.getPointerTy())); 332870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 3329a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Elt, DAG.getConstant(1, TLI.getPointerTy())); 333070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 333170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 333270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 33331c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 333470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 3335d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else if (SrcVT < DestVT) { 3336d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 3337fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 3338fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 3339fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 3340fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 3341d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 3342d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 3343d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 3344d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3345a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(0, TLI.getPointerTy())); 3346d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3347a844126c43976387a66dafbe5137a762169f1f34Evan Cheng Op, DAG.getConstant(1, TLI.getPointerTy())); 3348d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op = DAG.getCopyToReg(SDL.getRoot(), Reg, Lo); 3349d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 3350d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 33511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3353068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 3354068a81e9fca511b9a3b3a0f28a8988a57f994652Chris LattnerLowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL, 3355068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 33561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 3357068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner Function &F = *BB->getParent(); 33580afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 3359bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 3360bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 3361bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3362bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 3363bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 3364bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 3365bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 3366bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 3367f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3368bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 3369bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 3370bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (FuncInfo.ValueMap.count(AI)) { 3371bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand Copy = 3372bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner CopyValueToVirtualRegister(SDL, AI, FuncInfo.ValueMap[AI]); 3373bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 3374bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 33750afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 3376bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3377bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 3378966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 3379bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 3380068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 3381068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3382068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 3383068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 3384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3385068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 3386068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3387068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 3388edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3389bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 3390bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (LLVMBB == &LLVMBB->getParent()->front()) 3391bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 33921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 33941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 33951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 33971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 33981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 33991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 3400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 34011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 34021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 34031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 3404f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 3405ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 34061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 3407ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3408ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, I, VMI->second)); 34091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 34101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 34121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 34131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 34141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 34151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 34161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 3417edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 34181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 34201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 34211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 34231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 34241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 34251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 34261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 34271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock::iterator MBBI = FuncInfo.MBBMap[SuccBB]->begin(); 34281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 34291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 34311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 34321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 34331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 3434f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 3435f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 3436f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned Reg; 3437f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 3438f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 3439f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned &RegOut = ConstantsOut[C]; 3440f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (RegOut == 0) { 3441f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner RegOut = FuncInfo.CreateRegForValue(C); 3442ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3443ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, C, RegOut)); 3444f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 3445f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = RegOut; 3446f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } else { 3447f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 3448ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner if (Reg == 0) { 3449edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman assert(isa<AllocaInst>(PHIOp) && 3450ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 3451ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner "Didn't codegen value into a register!??"); 3452ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 3453ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3454ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, PHIOp, Reg)); 3455ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner } 34561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3457edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3458f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // Remember that this register needs to added to the machine PHI node as 3459f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // the input for this MBB. 34607e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 34617e02151ce2686687446ba7293e66d6b096106e68Chris Lattner unsigned NumElements; 34627e02151ce2686687446ba7293e66d6b096106e68Chris Lattner if (VT != MVT::Vector) 34637e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = TLI.getNumElements(VT); 34647e02151ce2686687446ba7293e66d6b096106e68Chris Lattner else { 34657e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT1,VT2; 34667e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = 34677e02151ce2686687446ba7293e66d6b096106e68Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 34687e02151ce2686687446ba7293e66d6b096106e68Chris Lattner VT1, VT2); 34697e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 3470f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 3471f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 34721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 34731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 34741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 34751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3476ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 34775a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 34787436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 34797436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 34807436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 34817436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 34827436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 34837436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 34847436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 34857436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 34867436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 34877436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 34887436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 34897436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 3490ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, UnorderedChains)); 3491ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 3492ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 34931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 34941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*LLVMBB->getTerminator()); 3495a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 3496f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 349737efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 3498f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 3499f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 350037efe6764568a3829fee26aba532283131d1a104Nate Begeman JT = SDL.JT; 3501f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3502a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 3503a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 35041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 35051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3506f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 3507af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 3508af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(false); 35092300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 35101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Lowered selection DAG:\n"); 35111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3512f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 35141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 3515ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 3516f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Legalized selection DAG:\n"); 35181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3519f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3520af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 3521af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(true); 35222300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 3523a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 3524552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 3525a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 3526a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 35271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 3528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Selected machine code:\n"); 35301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 3531f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 3532f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 3534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3535f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 3536f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 3537f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 3539f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3540f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 3541f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 3542f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 35431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3544f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 3545f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 3546f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3547f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3548a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 35491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 355037efe6764568a3829fee26aba532283131d1a104Nate Begeman if (SwitchCases.empty() && JT.Reg == 0) { 3551f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 3552f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 3553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3554f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3555f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[i].second); 3556f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 35591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3560f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35619453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 35629453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 35639453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 356437efe6764568a3829fee26aba532283131d1a104Nate Begeman if (JT.Reg) { 356537efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(SwitchCases.empty() && "Cannot have jump table and lowered switch"); 356637efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 356737efe6764568a3829fee26aba532283131d1a104Nate Begeman CurDAG = &SDAG; 356837efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 35699453eea49bca1c3904047db495855c93e001d1cdNate Begeman MachineBasicBlock *RangeBB = BB; 357037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 357137efe6764568a3829fee26aba532283131d1a104Nate Begeman BB = JT.MBB; 357237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.setCurrentBasicBlock(BB); 357337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 357437efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.visitJumpTable(JT); 357537efe6764568a3829fee26aba532283131d1a104Nate Begeman SDAG.setRoot(SDL.getRoot()); 357637efe6764568a3829fee26aba532283131d1a104Nate Begeman CodeGenAndEmitDAG(SDAG); 357737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 357837efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 357937efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 358037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 358137efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 358237efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 3583f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (PHIBB == JT.Default) { 3584f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3585f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(RangeBB); 3586f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 3587f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 358837efe6764568a3829fee26aba532283131d1a104Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3589f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 359037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 359137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 359237efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 359337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 359437efe6764568a3829fee26aba532283131d1a104Nate Begeman 3595f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 3596f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 3597f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for(unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 3598f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3599f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 3600f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 3601f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 3602f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 3603f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 3604f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 3605f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 3606f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 3607f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 3608f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Iterate over the phi nodes, if there is a phi node in a successor of this 3609f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // block (for instance, the default block), then add a pair of operands to 3610f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the phi node for this block, as if we were coming from the original 3611f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // BB before switch expansion. 3612f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 3613f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 3614f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 3615f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3616f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3617f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (PHIBB == SwitchCases[i].LHSBB || PHIBB == SwitchCases[i].RHSBB) { 3618f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3619f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3620f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3622a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 36231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3624a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 362513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 3626a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 3627a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 3628a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 3629a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 3630a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 363113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 363213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey static RegisterScheduler::FunctionPassCtor Ctor = 36339ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey RegisterScheduler::getDefault(); 363413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 363513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 36369373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey Ctor = RegisterScheduler::FindCtor(ISHeuristic); 36379373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 36384ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 363913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 364013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey assert(Ctor && "No instruction scheduler found"); 36419ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 3642a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 3643cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 3644a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 36450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 364603fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 36479ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 36489ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 36499ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 36509ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 36519ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 36520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 36530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 36540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 36550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 36560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 36570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 36580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 36600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 36610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 36630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 36640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 36650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 36670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 36680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 36690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 36700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 36710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 36720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 36730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 36740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 36750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 36760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 36770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::cerr << "Could not match memory address. Inline asm failure!\n"; 36780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 36790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 36820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32)); 36830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 36840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 36850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 36890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 36900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 36910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 3692