SelectionDAGISel.cpp revision f4ec817299a4187044a6162c2f520772b3ad69a0
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" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SSARegMap.h" 34fa57702388f139e964befecb4b98c7dfe836945fChris Lattner#include "llvm/Target/MRegisterInfo.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 40495a0b51915eb763576874f29192820b731edc22Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 417944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#include "llvm/Support/CommandLine.h" 427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <map> 454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner#include <set> 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <iostream> 477e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 517944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 52a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 53a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 55a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 56a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 577944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 585e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 61ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng// Scheduling heuristics 62ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Chengenum SchedHeuristics { 63ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng defaultScheduling, // Let the target specify its preference. 64ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng noScheduling, // No scheduling, emit breadth first sequence. 65ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng simpleScheduling, // Two pass, min. critical path, max. utilization. 66ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng simpleNoItinScheduling, // Same as above exact using generic latency. 67ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingBURR, // Bottom-up reg reduction list scheduling. 68ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingTDRR, // Top-down reg reduction list scheduling. 69ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingTD // Top-down list scheduler. 70ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng}; 71ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng 724ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 73ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng cl::opt<SchedHeuristics> 744ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng ISHeuristic( 754ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "sched", 764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng cl::desc("Choose scheduling style"), 77ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng cl::init(defaultScheduling), 784ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng cl::values( 79ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(defaultScheduling, "default", 803f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng "Target preferred scheduling style"), 81ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(noScheduling, "none", 8217d52f723421ce28d1b9fe2fc058366ed43ec094Jim Laskey "No scheduling: breadth first sequencing"), 83ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(simpleScheduling, "simple", 844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "Simple two pass scheduling: minimize critical path " 854ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "and maximize processor utilization"), 86ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(simpleNoItinScheduling, "simple-noitin", 874ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "Simple two pass scheduling: Same as simple " 884ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "except using generic latency"), 89ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingBURR, "list-burr", 90e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng "Bottom-up register reduction list scheduling"), 91ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingTDRR, "list-tdrr", 92e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng "Top-down register reduction list scheduling"), 93ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingTD, "list-td", 9403fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner "Top-down list scheduler"), 954ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng clEnumValEnd)); 964ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 974ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 98864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 99864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 100864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 101864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 102864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 103864635ad7b3046d3042311423071152c613961deChris Lattner struct RegsForValue { 104864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 105864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 106864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 107864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 108864635ad7b3046d3042311423071152c613961deChris Lattner 109864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 110864635ad7b3046d3042311423071152c613961deChris Lattner /// 111864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 112864635ad7b3046d3042311423071152c613961deChris Lattner 113864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 114864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 115864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 116864635ad7b3046d3042311423071152c613961deChris Lattner 117864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 118864635ad7b3046d3042311423071152c613961deChris Lattner 119864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 120864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 121864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 122864635ad7b3046d3042311423071152c613961deChris Lattner } 123864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 124864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 125864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 126864635ad7b3046d3042311423071152c613961deChris Lattner } 127864635ad7b3046d3042311423071152c613961deChris Lattner 128864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 129864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 130864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 131864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1329f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 133c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 1389f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 139c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 140c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 141c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 142c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 143c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1449f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 145864635ad7b3046d3042311423071152c613961deChris Lattner }; 146864635ad7b3046d3042311423071152c613961deChris Lattner} 1474ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 152f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 153f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, unsigned> ValueMap; 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 177edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1783c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1793c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 189f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 190f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 1911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 195f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 196f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 1971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 201bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 202f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 204bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 205bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 206bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 207f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 208bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 209bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 210bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 211bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 213edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 216bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 217bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 21816ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 21916ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 220bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 223bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 225bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2262aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(AI->getArraySize())) { 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 231a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 232ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 233a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 234ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 235a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 236a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // If the alignment of the value is smaller than the size of the value, 237a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // and if the size of the value is particularly small (<= 8 bytes), 238a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // round up to the size of the value for potentially better performance. 239a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // 240a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // FIXME: This could be made better with a preferred alignment hook in 241a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // TargetData. It serves primarily to 8-byte align doubles for X86. 242a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner if (Align < TySize && TySize <= 8) Align = TySize; 2432dfa8192abaad8a3c29132dba50e8b85218e918cChris Lattner TySize *= CUI->getValue(); // Get total allocated size. 244d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 246f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2492aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2502aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2592aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(); 268f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 269f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 27070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 27170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NumElements; 27270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) 27370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = TLI.getNumElements(VT); 27470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else { 27570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT1,VT2; 27670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = 27770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 27870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner VT1, VT2); 27970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 280f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned PHIReg = ValueMap[PN]; 281f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner assert(PHIReg &&"PHI node does not have an assigned virtual register!"); 282f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0; i != NumElements; ++i) 283f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner BuildMI(MBB, TargetInstrInfo::PHI, PN->getNumOperands(), PHIReg+i); 284f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2883c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2893c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2903c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 2913c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 2923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 2933c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2943c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 2953c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 2963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a packed type, figure out what type it will decompose into 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner const PackedType *PTy = cast<PackedType>(V->getType()); 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3116cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3126cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3136cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3146cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3153c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3293c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NT = VT-1; // Find the type to use. 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (TLI.getNumElements((MVT::ValueType)NT) != 1) 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner --NT; 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned R = MakeReg((MVT::ValueType)NT); 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg((MVT::ValueType)NT); 3403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, SDOperand> NodeMap; 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 354d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 355d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 356d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 357d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 358d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 359d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 360f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Case - A pair of values to record the Value for a switch case, and the 361f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// case's target basic block. 362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<Constant*, MachineBasicBlock*> Case; 363f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::vector<Case>::iterator CaseItr; 364f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<CaseItr, CaseItr> CaseRange; 365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 366f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// The comparison function for sorting Case values. 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman bool operator () (const Case& C1, const Case& C2) { 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (const ConstantUInt* U1 = dyn_cast<const ConstantUInt>(C1.first)) 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return U1->getValue() < cast<const ConstantUInt>(C2.first)->getValue(); 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const ConstantSInt* S1 = dyn_cast<const ConstantSInt>(C1.first); 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return S1->getValue() < cast<const ConstantSInt>(C2.first)->getValue(); 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 3951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 3961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 3971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 3981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 3991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 400a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 40537efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGISel::JumpTable JT; 406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 412edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4149453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT(0,0,0,0), FuncInfo(funcinfo) { 4151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 417a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 418a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 419a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 420d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 421d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 422edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 423d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 424d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 425d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 426d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 427d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 428d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 429d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 430d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 431d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, PendingLoads); 432d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 433d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 434d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 435a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 436a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 45328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 45428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 460199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const SDOperand &setValue(const Value *V, SDOperand NewN) { 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return N = NewN; 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4674e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 468864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 469864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 470864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 471864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 472864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 473f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 477f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 480f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Helper for visitSwitch 481f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 48237efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 4851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); } 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); } 4871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4885fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitBinary(User &I, unsigned IntOp, unsigned FPOp, unsigned VecOp); 489e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 4905fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 4915fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::ADD, ISD::FADD, ISD::VADD); 49201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 493b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 4945fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitMul(User &I) { 4955fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::MUL, ISD::FMUL, ISD::VMUL); 49601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitDiv(User &I) { 49801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 4993e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng visitBinary(I, 5003e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::SDIV : ISD::UDIV, ISD::FDIV, 5013e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::VSDIV : ISD::VUDIV); 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRem(User &I) { 50401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 5055fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, Ty->isSigned() ? ISD::SREM : ISD::UREM, ISD::FREM, 0); 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5073e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitAnd(User &I) { visitBinary(I, ISD::AND, 0, ISD::VAND); } 5083e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitOr (User &I) { visitBinary(I, ISD::OR, 0, ISD::VOR); } 5093e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitXor(User &I) { visitBinary(I, ISD::XOR, 0, ISD::VXOR); } 510e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShl(User &I) { visitShift(I, ISD::SHL); } 511e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShr(User &I) { 512e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman visitShift(I, I.getType()->isUnsigned() ? ISD::SRL : ISD::SRA); 5131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc); 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ); } 5171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE); } 5181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE); } 5191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE); } 5201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT); } 5211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT); } 5221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5232bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5242bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5253e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 526c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCast(User &I); 5291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 538ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 539c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5400eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 5431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 5441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 5451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 54639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner void visitFrameReturnAddress(CallInst &I, bool isFrameAddress); 5471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5487041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 5491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 5511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 5521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 5551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 5561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 5591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 5601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 561199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 562199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 563199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 564199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 565199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 566199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 567199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 568199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 569199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 570199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(N.Val && "visit didn't populate the ValueMap!"); 571199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 572199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 573199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 574199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 575199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 576199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 57723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner if (!isa<PackedType>(VTy)) 57823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 57923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 580b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 58123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner const PackedType *PTy = cast<PackedType>(VTy); 58223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 58323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 58423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 58523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner std::vector<SDOperand> Ops; 58623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 58723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 58823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 58923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 59023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 591b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 592199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 593199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 594199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) { 595199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 596199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 597199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 598199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 599199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 600199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 601199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::vector<SDOperand> Ops; 602199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) { 6032bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6042bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 605199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 606199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 607199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 608199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 609199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 610199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 611199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 612199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 613199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 614199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 615b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 61623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 61723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 618b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 619199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 620199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 621199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(cast<ConstantIntegral>(C)->getRawValue(),VT); 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 623199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 624199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 625199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 626199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 627199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 628199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 629199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 630199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 631199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 632199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const Value*, unsigned>::const_iterator VMI = 633199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.ValueMap.find(V); 634199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!"); 635199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 636199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned InReg = VMI->second; 637199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 638199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 63970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 64070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 641199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 64270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 64370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (DestVT < VT) { 64470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 64570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // register pair VMI->second and VMI->second+1. 64670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 64770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 64870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (DestVT > VT) { // Promotion case 649199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(VT)) 650199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::FP_ROUND, VT, N); 651199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 652199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::TRUNCATE, VT, N); 653199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 65470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 65570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 65670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 65770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 6582e2ef9535070bb352601482cceac1140c1158cddChris Lattner const PackedType *PTy = cast<PackedType>(VTy); 6592e2ef9535070bb352601482cceac1140c1158cddChris Lattner unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT, 66070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 66170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 66270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 66370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> Ops; 66470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 66570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 66670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 66770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 66870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 66970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 67070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 67170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 67270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 67370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 67470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 67570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 67670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 67770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 67870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 67970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 68070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 68170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 68270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 68370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 68470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 68570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 68670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 68770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 68870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 68970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 69270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 69370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 69470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 6952e2ef9535070bb352601482cceac1140c1158cddChris Lattner 6962e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 6972e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 6982e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 6992e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7002e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7012e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 702199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 703199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 704199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 705199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 706199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 707199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 710a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 713ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman std::vector<SDOperand> NewValues; 714ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 715ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 716ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 717ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 718ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 719ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 720ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 721ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 722ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 723ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 724ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 725ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 726ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 727ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 7281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 729ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (I.getOperand(i)->getType()->isSigned()) 730ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp); 731ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 732ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp); 733ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 734ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 7351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 736ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, NewValues)); 7371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 7401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 7411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 742f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ0MBB); 7431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 7451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 7461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 7471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 7481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 7491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 7511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 7521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 753a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 754dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 7551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 7561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 757f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ1MBB); 7581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getCondition()); 7601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ1MBB == NextBlock) { 7611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is false, fall through. This means we should branch 7621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // if the condition is true to Succ #0. 763a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 764dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ0MBB))); 7651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else if (Succ0MBB == NextBlock) { 7661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is true, fall through. This means we should branch if 7671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the condition is false to Succ #1. Invert the condition first. 7681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand True = DAG.getConstant(1, Cond.getValueType()); 7691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 770a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 771dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ1MBB))); 7721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 773e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner std::vector<SDOperand> Ops; 774e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner Ops.push_back(getRoot()); 775298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // If the false case is the current basic block, then this is a self 776298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // loop. We do not want to emit "Loop: ... brcond Out; br Loop", as it 777298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // adds an extra instruction in the loop. Instead, invert the 778298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // condition and emit "Loop: ... br!cond Loop; br Out. 779298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng if (CurMBB == Succ1MBB) { 780298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng std::swap(Succ0MBB, Succ1MBB); 781298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng SDOperand True = DAG.getConstant(1, Cond.getValueType()); 782298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 783298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng } 78481e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman SDOperand True = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 78581e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ0MBB)); 78681e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, True, 78781e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ1MBB))); 7881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 792f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 793f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 794f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 795f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand SwitchOp = getValue(CB.SwitchV); 796f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand CaseOp = getValue(CB.CaseC); 797f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand Cond = DAG.getSetCC(MVT::i1, SwitchOp, CaseOp, CB.CC); 798f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 799f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 800f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 801f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 802f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 803f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 804f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 805f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 806f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 807f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 808f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.LHSBB == NextBlock) { 809f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::swap(CB.LHSBB, CB.RHSBB); 810f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 811f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 812f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 813f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 814f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.LHSBB)); 815f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.RHSBB == NextBlock) 816f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 817f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 818f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 819f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.RHSBB))); 820f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 821f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.LHSBB); 822f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.RHSBB); 823f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 824f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 82537efe6764568a3829fee26aba532283131d1a104Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 82637efe6764568a3829fee26aba532283131d1a104Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 82737efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 82837efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Need to emit different code for PIC vs. Non-PIC, specifically, 82937efe6764568a3829fee26aba532283131d1a104Nate Begeman // we need to add the address of the jump table to the value loaded, since 83037efe6764568a3829fee26aba532283131d1a104Nate Begeman // the entries in the jump table will be differences rather than absolute 83137efe6764568a3829fee26aba532283131d1a104Nate Begeman // addresses. 83237efe6764568a3829fee26aba532283131d1a104Nate Begeman 83337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 83437efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 83537efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned PTyBytes = MVT::getSizeInBits(PTy)/8; 83637efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand Copy = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 83737efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand IDX = DAG.getNode(ISD::MUL, PTy, Copy, 83837efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(PTyBytes, PTy)); 83937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand ADD = DAG.getNode(ISD::ADD, PTy, IDX, DAG.getJumpTable(JT.JTI,PTy)); 84037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand LD = DAG.getLoad(PTy, Copy.getValue(1), ADD, DAG.getSrcValue(0)); 84137efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD)); 84237efe6764568a3829fee26aba532283131d1a104Nate Begeman} 84337efe6764568a3829fee26aba532283131d1a104Nate Begeman 844f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitch(SwitchInst &I) { 845f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 846f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 847f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 848f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 849f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 850f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 851f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 852f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 853f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (I.getNumOperands() == 2) { 854f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 855f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *DefaultMBB = FuncInfo.MBBMap[I.getDefaultDest()]; 856f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 857f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (DefaultMBB != NextBlock) 858f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 859f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(DefaultMBB))); 860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 862f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 863f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 864f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 865f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 866f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<Case> Cases; 867f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 1; i < I.getNumSuccessors(); ++i) { 868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)]; 869f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cases.push_back(Case(I.getSuccessorValue(i), SMBB)); 870f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 871f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 872f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 873f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 875f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 876f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Value *SV = I.getOperand(0); 877f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()]; 87837efe6764568a3829fee26aba532283131d1a104Nate Begeman 87937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Get the MachineFunction which holds the current MBB. This is used during 88037efe6764568a3829fee26aba532283131d1a104Nate Begeman // emission of jump tables, and when inserting any additional MBBs necessary 88137efe6764568a3829fee26aba532283131d1a104Nate Begeman // to represent the switch. 882f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction *CurMF = CurMBB->getParent(); 883f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const BasicBlock *LLVMBB = CurMBB->getBasicBlock(); 88437efe6764568a3829fee26aba532283131d1a104Nate Begeman Reloc::Model Relocs = TLI.getTargetMachine().getRelocationModel(); 88537efe6764568a3829fee26aba532283131d1a104Nate Begeman 88617c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // If the switch has more than 5 blocks, and at least 31.25% dense, and the 88717c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // target supports indirect branches, then emit a jump table rather than 88817c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // lowering the switch to a binary tree of conditional branches. 88937efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Make this work with PIC code 8909453eea49bca1c3904047db495855c93e001d1cdNate Begeman if (TLI.isOperationLegal(ISD::BRIND, TLI.getPointerTy()) && 89137efe6764568a3829fee26aba532283131d1a104Nate Begeman (Relocs == Reloc::Static || Relocs == Reloc::DynamicNoPIC) && 892f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman Cases.size() > 5) { 89337efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t First = cast<ConstantIntegral>(Cases.front().first)->getRawValue(); 89437efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getRawValue(); 895f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman double Density = (double)Cases.size() / (double)((Last - First) + 1ULL); 896f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 89717c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman if (Density >= 0.3125) { 89837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Create a new basic block to hold the code for loading the address 89937efe6764568a3829fee26aba532283131d1a104Nate Begeman // of the jump table, and jumping to it. Update successor information; 90037efe6764568a3829fee26aba532283131d1a104Nate Begeman // we will either branch to the default case for the switch, or the jump 90137efe6764568a3829fee26aba532283131d1a104Nate Begeman // table. 90237efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 90337efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 90437efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(Default); 90537efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(JumpTableBB); 90637efe6764568a3829fee26aba532283131d1a104Nate Begeman 90737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Subtract the lowest switch case value from the value being switched on 90837efe6764568a3829fee26aba532283131d1a104Nate Begeman // and conditional branch to default mbb if the result is greater than the 90937efe6764568a3829fee26aba532283131d1a104Nate Begeman // difference between smallest and largest cases. 91037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SwitchOp = getValue(SV); 91137efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType VT = SwitchOp.getValueType(); 91237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 91337efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(First, VT)); 91437efe6764568a3829fee26aba532283131d1a104Nate Begeman 91537efe6764568a3829fee26aba532283131d1a104Nate Begeman // The SDNode we just created, which holds the value being switched on 91637efe6764568a3829fee26aba532283131d1a104Nate Begeman // minus the the smallest case value, needs to be copied to a virtual 91737efe6764568a3829fee26aba532283131d1a104Nate Begeman // register so it can be used as an index into the jump table in a 91837efe6764568a3829fee26aba532283131d1a104Nate Begeman // subsequent basic block. This value may be smaller or larger than the 91937efe6764568a3829fee26aba532283131d1a104Nate Begeman // target's pointer type, and therefore require extension or truncating. 92037efe6764568a3829fee26aba532283131d1a104Nate Begeman if (VT > TLI.getPointerTy()) 92137efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 92237efe6764568a3829fee26aba532283131d1a104Nate Begeman else 92337efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 92437efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 92537efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 92637efe6764568a3829fee26aba532283131d1a104Nate Begeman 92737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the range check for the jump table, and branch to the default 92837efe6764568a3829fee26aba532283131d1a104Nate Begeman // block for the switch statement if the value being switched on exceeds 92937efe6764568a3829fee26aba532283131d1a104Nate Begeman // the largest case in the switch. 93037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 93137efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(Last-First,VT), ISD::SETUGT); 93237efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 93337efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getBasicBlock(Default))); 93437efe6764568a3829fee26aba532283131d1a104Nate Begeman 935f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Build a vector of destination BBs, corresponding to each target 936f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // of the jump table. If the value of the jump table slot corresponds to 937f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // a case statement, push the case's BB onto the vector, otherwise, push 938f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // the default BB. 93937efe6764568a3829fee26aba532283131d1a104Nate Begeman std::set<MachineBasicBlock*> UniqueBBs; 94037efe6764568a3829fee26aba532283131d1a104Nate Begeman std::vector<MachineBasicBlock*> DestBBs; 941f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman uint64_t TEI = First; 942f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) { 943f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (cast<ConstantIntegral>(ii->first)->getRawValue() == TEI) { 944f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(ii->second); 945f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(ii->second); 946f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ++ii; 947f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } else { 948f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(Default); 949f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(Default); 950f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 95137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 952f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 953f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Update successor info 954f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (std::set<MachineBasicBlock*>::iterator ii = UniqueBBs.begin(), 955f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ee = UniqueBBs.end(); ii != ee; ++ii) 956f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman JumpTableBB->addSuccessor(*ii); 957f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 958f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Create a jump table index for this jump table, or return an existing 959f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // one. 96037efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 96137efe6764568a3829fee26aba532283131d1a104Nate Begeman 96237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the jump table information so that we can codegen it as a second 96337efe6764568a3829fee26aba532283131d1a104Nate Begeman // MachineBasicBlock 96437efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.Reg = JumpTableReg; 96537efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.JTI = JTI; 96637efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.MBB = JumpTableBB; 9679453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT.Default = Default; 96837efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 96937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 97037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 971f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 972f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Push the initial CaseRec onto the worklist 973f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<CaseRec> CaseVec; 974f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 975f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 976f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman while (!CaseVec.empty()) { 977f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Grab a record representing a case range to process off the worklist 978f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec CR = CaseVec.back(); 979f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.pop_back(); 980f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 981f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Size is the number of Cases represented by this range. If Size is 1, 982f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // then we are processing a leaf of the binary search tree. Otherwise, 983f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // we need to pick a pivot, and push left and right ranges onto the 984f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // worklist. 985f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman unsigned Size = CR.Range.second - CR.Range.first; 986f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 987f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (Size == 1) { 988f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 989f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the Case's target mbb if the value being switched on SV is equal 990f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // to C. Otherwise, branch to default. 991f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = CR.Range.first->first; 992f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Target = CR.Range.first->second; 993f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default, 994f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CR.CaseBB); 995f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the MBB representing the leaf node is the current MBB, then just 996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // call visitSwitchCase to emit the code into the current block. 997f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, push the CaseBlock onto the vector to be later processed 998f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // by SDISel, and insert the node's MBB before the next MBB. 999f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1000f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1001f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1002f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1003f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1004f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1005f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1006f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // split case range at pivot 1007f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseItr Pivot = CR.Range.first + (Size / 2); 1008f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange LHSR(CR.Range.first, Pivot); 1009f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange RHSR(Pivot, CR.Range.second); 1010f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = Pivot->first; 1011f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *RHSBB = 0, *LHSBB = 0; 1012f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // We know that we branch to the LHS if the Value being switched on is 1013f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // less than the Pivot value, C. We use this to optimize our binary 1014f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // tree a bit, by recognizing that if SV is greater than or equal to the 1015f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // LHS's Case Value, and that Case Value is exactly one less than the 1016f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Pivot's Value, then we can branch directly to the LHS's Target, 1017f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // rather than creating a leaf node for it. 1018f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((LHSR.second - LHSR.first) == 1 && 1019f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSR.first->first == CR.GE && 1020f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(C)->getRawValue() == 1021f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.GE)->getRawValue() + 1ULL)) { 1022f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = LHSR.first->second; 1023f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1024f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = new MachineBasicBlock(LLVMBB); 1025f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(LHSBB,C,CR.GE,LHSR)); 1026f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Similar to the optimization above, if the Value being switched on is 1028f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // known to be less than the Constant CR.LT, and the current Case Value 1029f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // is CR.LT - 1, then we can branch directly to the target block for 1030f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the current Case Value, rather than emitting a RHS leaf node for it. 1031f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1032f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(RHSR.first->first)->getRawValue() == 1033f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.LT)->getRawValue() - 1ULL)) { 1034f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = RHSR.first->second; 1035f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1036f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = new MachineBasicBlock(LLVMBB); 1037f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(RHSBB,CR.LT,C,RHSR)); 1038f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1039f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1040f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the LHS node if the value being switched on SV is less than C. 1041f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, branch to LHS. 1042f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT; 1043f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(CC, SV, C, LHSBB, RHSBB, CR.CaseBB); 1044f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1045f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1046f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1047f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1048f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1049f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1050f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1051f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1052f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1053f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1054b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1055b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 105601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (I.getType()->isFloatingPoint()) { 105701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 105801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 105901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 106001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 106101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 106201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 106301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 10645fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::SUB, ISD::FSUB, ISD::VSUB); 1065b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1066b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 10675fbb5d2459a5410590f285250faa604576308a93Nate Begemanvoid SelectionDAGLowering::visitBinary(User &I, unsigned IntOp, unsigned FPOp, 10685fbb5d2459a5410590f285250faa604576308a93Nate Begeman unsigned VecOp) { 10695fbb5d2459a5410590f285250faa604576308a93Nate Begeman const Type *Ty = I.getType(); 10701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 10711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 10722c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1073b67eb9131c5c04d2e55c6b587fde954619feceafChris Lattner if (Ty->isIntegral()) { 10745fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2)); 10755fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else if (Ty->isFloatingPoint()) { 10765fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2)); 10775fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 10785fbb5d2459a5410590f285250faa604576308a93Nate Begeman const PackedType *PTy = cast<PackedType>(Ty); 1079c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 1080c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 1081c7029805ef35ce9805931067b841e6af11db382eChris Lattner setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 10825fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1083e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 10842c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1085e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1086e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1087e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1088e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1089e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1090e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 10911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 10921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 10931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode, 10951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode UnsignedOpcode) { 10961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 10971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 10981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode Opcode = SignedOpcode; 10991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getOperand(0)->getType()->isUnsigned()) 11001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Opcode = UnsignedOpcode; 11017cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 11021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 11051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 11061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 11071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 1108b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner if (!isa<PackedType>(I.getType())) { 1109b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1110b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1111b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1112b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1113b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1114b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1115b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 11161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCast(User &I) { 11191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1120e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 112128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 11221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1123e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 1124e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast to a vector from something else. This is always a bit 1125e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1126e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 1127e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1128e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1129e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1130e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 1131e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (SrcVT == DestVT) { 11321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); // noop cast. 113328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (DestVT == MVT::i1) { 1134ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner // Cast to bool is a comparison against zero, not truncation to zero. 113528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand Zero = isInteger(SrcVT) ? DAG.getConstant(0, N.getValueType()) : 1136ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner DAG.getConstantFP(0.0, N.getValueType()); 11377cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, N, Zero, ISD::SETNE)); 113828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isInteger(SrcVT)) { 113928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isInteger(DestVT)) { // Int -> Int cast 114028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Truncating cast? 114128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 1142ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else if (I.getOperand(0)->getType()->isSigned()) 114328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 1144ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 114528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 11467e358908b885f50fb9258b7d10509bad20ca4c3bChris Lattner } else if (isFloatingPoint(DestVT)) { // Int -> FP cast 1147ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getOperand(0)->getType()->isSigned()) 114828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 1149ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 115028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 1151e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1152e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1153ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 115428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isFloatingPoint(SrcVT)) { 115528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isFloatingPoint(DestVT)) { // FP -> FP cast 115628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Rounding cast? 115728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 1158ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 115928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 1160e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (isInteger(DestVT)) { // FP -> Int cast. 1161ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getType()->isSigned()) 116228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 1163ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 116428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 116528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else { 1166e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1167ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 1168e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1169e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(SrcVT == MVT::Vector && "Unknown cast!"); 1170e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(DestVT != MVT::Vector && "Casts to vector already handled!"); 1171e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast from a vector to something else. This is always a bit 1172e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1173e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 11741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 11751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11772bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1178c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1179c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1180c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1181c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1182c7029805ef35ce9805931067b841e6af11db382eChris Lattner 11832332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 11842332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 11852332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 11862332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1187c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1188c7029805ef35ce9805931067b841e6af11db382eChris Lattner 11892bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1190384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1191384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1192384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1193384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1194384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1195384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1196384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1197c7029805ef35ce9805931067b841e6af11db382eChris Lattner 11983e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 11993e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 12003e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 12013e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 12023e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12033e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 12043e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 12053e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 12063e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 12073e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 12083e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12093e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 12111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 12121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 12131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 12151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 12161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1217c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 12181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 12191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 12201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1221a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field]; 12221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1223dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 12241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 12261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 12271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 12287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12297c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 12307c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 12317c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (CI->getRawValue() == 0) continue; 12327c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner uint64_t Offs; 12347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 1235a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 12367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 1237a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 12387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 12397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12407c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 12417c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12427c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1243a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 12447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 12457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12467c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 12477c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 12487c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 12497c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (Idx->getType()->isSigned()) 12507c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 12517c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 12527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN); 12537c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 12547c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 12557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12567c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 12577c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 12587c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 12597c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 12607c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 12616b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 12621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12637c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12657c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12667c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 12677c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 12687c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 12721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 12751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 12761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 12771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 12781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 12791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 1281a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 1282a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 1283ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman I.getAlignment()); 12841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 128668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 128768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 128868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 128968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 129068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 12911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 129268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 12931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 12941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 12961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 12971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 12981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 12991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 13001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 13011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 13021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 13031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 13041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 13051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 13061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 13071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 13081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 13091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 13101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1311adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<MVT::ValueType> VTs; 1312adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(AllocSize.getValueType()); 1313adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(MVT::Other); 1314adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<SDOperand> Ops; 1315adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getRoot()); 1316adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(AllocSize); 1317adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getIntPtrConstant(Align)); 1318adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, Ops); 13191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DAG.setRoot(setValue(&I, DSA).getValue(1)); 13201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 13221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 13231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 13241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 13271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 1328edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1329d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 1330d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 1331d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 1332d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 1333d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 1334d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 1335d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 133628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 133728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, getLoadFrom(I.getType(), Ptr, DAG.getSrcValue(I.getOperand(0)), 133828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 133928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 134028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 134128b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 134228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 134328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 13445fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 13458cfa57b1b4eade4e0101195b2f94ab288cd03563Nate Begeman if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 13464ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1347c7029805ef35ce9805931067b841e6af11db382eChris Lattner L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, SrcValue); 13485fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 134928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SrcValue); 13505fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1351d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 135228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 1353d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 1354d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 1355d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 135628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 135728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 13581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 13621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 13631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 13641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 1365369e6db9b6033bb60519b0ad84afeacc9ec9b416Chris Lattner DAG.setRoot(DAG.getNode(ISD::STORE, MVT::Other, getRoot(), Src, Ptr, 136606ef88472f7bac3512e224974e87a0a456471b82Andrew Lenharth DAG.getSrcValue(I.getOperand(1)))); 13671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13690eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 13700eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 13710eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 13720eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 13730eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 13740eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 13750eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 13760eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 13770eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1378e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 1379e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 1380e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 1381e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 1382e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 1383e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 1384e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 1385e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 1386e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 13870eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 13880eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 13890eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 13900eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 13917255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 1392e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 13930eade319cdb72e24c11d068728a98083737c6435Chris Lattner 13940eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 13950eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<SDOperand> Ops; 1396e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 1397e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 1398e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 1399e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 1400e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 1401e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 1402e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 1403e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14040eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14050eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 14060eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 14070eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14080eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 14090eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 14100eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 14110eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14120eade319cdb72e24c11d068728a98083737c6435Chris Lattner // If this is a vector type, force it to the right packed type. 14130eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 14140eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType()); 14150eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 14160eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14170eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 14180eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 14190eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 14200eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14210eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14220eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 14230eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 14240eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 14250eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14260eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14270eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 14280eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14290eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 14300eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 14310eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 14320eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 14330eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14340eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 14350eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 14360eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14370eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14380eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 14390eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 14400eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14410eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 14420eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 14430eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14440eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 144548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 144648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 144748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTs, Ops); 144848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 144948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTs, Ops); 145048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 145148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTs, Ops); 145248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 1453e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 1454e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 1455e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 1456e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 1457e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 1458e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 1459e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14600eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14610eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) { 14620eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 14630eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 14640eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 14650eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 14660eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14670eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 14680eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14690eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 14700eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1471c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 1472c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 1473c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 1474c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 1475c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 1476c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 14770eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 14780eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 14790eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 14800eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 1481c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 1482c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 1483c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 1484c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0; 1485c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0; 1486c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 1487c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_setjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1488c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 1489c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 1490c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_longjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1491c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 149203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 149303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 149403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 149503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 149603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 149703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 149803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 149903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 150003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 150103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 150203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 150303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 1504c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 150586cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 1506ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 150743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 1508fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) { 1509ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey std::vector<SDOperand> Ops; 151036ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 1511ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(getRoot()); 151243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getLineValue())); 151343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getColumnValue())); 1514ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 151543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext()); 1516ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 151743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 151843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1519ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getFileName())); 1520ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getDirectory())); 1521ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 152243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops)); 152386cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 152443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1525b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 152636ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 152743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 152843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 152943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 1530fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) { 153143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 153243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 153343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext()); 153443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 153543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 153643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 153743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 153843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 153943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 154043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1541b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 154243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 154343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 154443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 154543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 1546fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) { 154743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 154843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 154943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext()); 155043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 155243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 155343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 155543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 155643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1557b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 155843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 155943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 156043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 156143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 1562fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && FSI.getSubprogram() && 1563fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey DebugInfo->Verify(FSI.getSubprogram())) { 156443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 156543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram()); 156743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 156943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 157043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 157143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 157243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 157343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1574b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 157543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 157643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 157743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 157843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 1579bf7637d59028a5d9911769810f537c499e23bb8eJim Laskey if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) { 158043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 158143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 15820892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 15830892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) { 158443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex()); 158543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 158643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 158743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 158843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 158943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 1590c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 15910b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f32: 15920b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f64: 1593c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)), 1594c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(2)), ISD::SETUO)); 1595c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1596c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 15970b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 15980b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 1599c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 1600c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1601c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1602c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1603c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 1604c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1605c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 1606c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1607c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 16088b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 16098b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<MVT::ValueType> VTs; 16108b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::i64); 16118b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::Other); 16128b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<SDOperand> Ops; 16138b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth Ops.push_back(getRoot()); 16148b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, VTs, Ops); 16158b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 16168b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 161751b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 16188b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 1619d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i16: 1620d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i32: 1621d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i64: 1622d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 1623d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 1624d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 1625d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 16260b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i8: 16270b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i16: 16280b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i32: 16290b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i64: 1630c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTTZ, 1631c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1632c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1633c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16340b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i8: 16350b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i16: 16360b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i32: 16370b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i64: 1638c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTLZ, 1639c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1640c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1641c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16420b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i8: 16430b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i16: 16440b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i32: 16450b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i64: 1646c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTPOP, 1647c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1648c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1649c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1650140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 1651140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<MVT::ValueType> VTs; 1652140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(TLI.getPointerTy()); 1653140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(MVT::Other); 1654140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<SDOperand> Ops; 1655140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner Ops.push_back(getRoot()); 1656140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, VTs, Ops); 1657140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 1658140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 1659140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 1660140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 166139a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 166239a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 166339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 1664140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 166539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 1666ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 1667ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 1668ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 1669c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1670c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 1671c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 1672c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 167464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 1675c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 1676c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (F->isExternal()) 1677c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 1678c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 1679c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 1680c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 1681c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 1682c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 1683a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 1684a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 1685a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1686a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 1687a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 1688a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 1689a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 1690a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 1691a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 1692a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 1693a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 1694a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 1695c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1696c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1697c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1698c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1699c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 1700c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 1701c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1702c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 1703f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1704f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 170506a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1706c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1707f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 1708f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1709f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1710c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 1711f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1712f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 171306a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1714c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1715f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 1716f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1717f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1718f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1719c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1720ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 1721ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 1722ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 1723c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1724edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 172564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 172664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 172764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 172864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 172964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 17301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 1731c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner Args.reserve(I.getNumOperands()); 17321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 17331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Arg = I.getOperand(i); 17341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand ArgNode = getValue(Arg); 17351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(ArgNode, Arg->getType())); 17361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1737edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 17388e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType()); 17398e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 1740edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1741cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 17429092fa310c8b2b1645b0d448c4c34b1e8ddc131dChris Lattner TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(), 1743adf6a965a321372c640845407195594835921eb4Chris Lattner I.isTailCall(), Callee, Args, DAG); 17441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getType() != Type::VoidTy) 1745cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); 1746cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 17471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1749864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 17509f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 1751864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 1752864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1753864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 1754864635ad7b3046d3042311423071152c613961deChris Lattner 1755864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 1756864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 1757864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 1758864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 1759864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 1760864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1761864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 17629f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 17639f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 17649f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 17659f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 1766864635ad7b3046d3042311423071152c613961deChris Lattner } 1767864635ad7b3046d3042311423071152c613961deChris Lattner 1768864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, if the return value was promoted, truncate it to the 1769864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 1770864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 1771864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 1772864635ad7b3046d3042311423071152c613961deChris Lattner 1773864635ad7b3046d3042311423071152c613961deChris Lattner if (MVT::isInteger(RegVT)) 1774864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1775864635ad7b3046d3042311423071152c613961deChris Lattner else 1776864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 1777864635ad7b3046d3042311423071152c613961deChris Lattner} 1778864635ad7b3046d3042311423071152c613961deChris Lattner 1779c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 1780c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 1781c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 1782c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 17839f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const { 1784c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 1785c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 1786c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 1787c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 1788c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (MVT::isInteger(RegVT)) 1789c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 1790c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner else 1791c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 1792c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1793c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 1794c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1795c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 17969f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 17979f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 17989f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 17999f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 18009f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 1801c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 1802c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner DAG.getConstant(i, MVT::i32)); 18039f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 1804c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1805c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1806c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1807c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1808864635ad7b3046d3042311423071152c613961deChris Lattner 1809c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 1810c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 1811c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 1812c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 18139f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 1814c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32)); 1815c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 1816c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 1817c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1818864635ad7b3046d3042311423071152c613961deChris Lattner 1819864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 1820864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 1821864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 1822864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 18239b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 18249b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 1825f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 1826f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 18279b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 18289b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 1829f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 1830f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 18319b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 18329b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 18339b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 18349b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 18359b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 18369b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 1837f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 1838f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 1839f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 1840f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 1841f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 1842f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 1843f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1844f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 18459b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18469b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18479b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1848f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 18499b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1850864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 1851864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 1852864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 1853864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 18549b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 18559b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 1856f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 1857f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 1858f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 1859f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 1860f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 1861f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1862f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 1863864635ad7b3046d3042311423071152c613961deChris Lattner } 1864f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 1865864635ad7b3046d3042311423071152c613961deChris Lattner} 1866864635ad7b3046d3042311423071152c613961deChris Lattner 1867864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 1868864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 1869864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 1870864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 18714e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 1872864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 1873864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 1874864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 1875864635ad7b3046d3042311423071152c613961deChris Lattner 1876864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 1877864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 1878864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 1879864635ad7b3046d3042311423071152c613961deChris Lattner 1880864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 1881864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 1882864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 1883864635ad7b3046d3042311423071152c613961deChris Lattner RegVT = VT; 1884864635ad7b3046d3042311423071152c613961deChris Lattner 1885864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 1886864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 1887864635ad7b3046d3042311423071152c613961deChris Lattner 1888864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 1889864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 1890864635ad7b3046d3042311423071152c613961deChris Lattner RegVT = *PhysReg.second->vt_begin(); 1891864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 1892864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 1893864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 1894864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 1895864635ad7b3046d3042311423071152c613961deChris Lattner 1896864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 1897864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 1898864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 1899864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 1900864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 1901864635ad7b3046d3042311423071152c613961deChris Lattner } 1902864635ad7b3046d3042311423071152c613961deChris Lattner } 1903864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 1904864635ad7b3046d3042311423071152c613961deChris Lattner } 1905864635ad7b3046d3042311423071152c613961deChris Lattner 1906864635ad7b3046d3042311423071152c613961deChris Lattner // This is a reference to a register class. Allocate NumRegs consecutive, 1907864635ad7b3046d3042311423071152c613961deChris Lattner // available, registers from the class. 1908864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> RegClassRegs = 1909864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 1910864635ad7b3046d3042311423071152c613961deChris Lattner 19114e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 19124e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 1913864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 1914864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 1915864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 19164e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 1917864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 1918864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 1919864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1920864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1921864635ad7b3046d3042311423071152c613961deChris Lattner continue; 1922864635ad7b3046d3042311423071152c613961deChris Lattner } 1923864635ad7b3046d3042311423071152c613961deChris Lattner 19244e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 19254e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 19269b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 1927864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 1928864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1929864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1930864635ad7b3046d3042311423071152c613961deChris Lattner continue; 19314e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 19324e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1933864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 1934864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 1935864635ad7b3046d3042311423071152c613961deChris Lattner 1936864635ad7b3046d3042311423071152c613961deChris Lattner // If we allocated enough consecutive 1937864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 1938864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 1939864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 1940864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 1941864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 1942864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 1943864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 1944864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 1945864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 1946864635ad7b3046d3042311423071152c613961deChris Lattner } 1947864635ad7b3046d3042311423071152c613961deChris Lattner 1948864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 1949864635ad7b3046d3042311423071152c613961deChris Lattner } 19504e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 1951864635ad7b3046d3042311423071152c613961deChris Lattner 1952864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 1953864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 19544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 19554e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1956864635ad7b3046d3042311423071152c613961deChris Lattner 1957ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 1958ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 1959ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 1960ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 1961ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1962ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 1963ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 1964ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1965ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Note, we treat inline asms both with and without side-effects as the same. 1966ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // If an inline asm doesn't have side effects and doesn't access memory, we 1967ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // could not choose to not chain it. 1968ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner bool hasSideEffects = IA->hasSideEffects(); 1969ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 19702cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 19711efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 1972ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1973ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 1974ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 1975ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 1976ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 1977ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 1978ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 1979ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1980ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 1981ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 1982ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 19834e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 19844e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 19854e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 19864e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 19874e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 19881efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 19894e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 19904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 19914e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 19922223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 19931efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 19941efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 19951efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 19961efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 19971efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 19981efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 19991efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 20001efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 20011efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 200222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 20031efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 20041efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20051efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20061efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20081efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 20091efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20101efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20111efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 20121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 20131efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20141efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 20171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2018864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2019864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 20201efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2021864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2022864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2023864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2024864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2025864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 20264e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 20274e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 20284e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 20294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2030864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20314e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 20324e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 20332223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2034864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20354e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20361efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2038864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20391efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20404e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 20414e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2042864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2043864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20444e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20472cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 20480f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 20490f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2050864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2051864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 20521efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 20530f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 20546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 20552cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 20562cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 20571efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20582cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 20592cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 206022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 206122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 206222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 206322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 206422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 206522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 206622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 206722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 206822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 206922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 207022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 207122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 207222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 207322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 207422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 207522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 207622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 207722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 207822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 207922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 208022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 208122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 208222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 208322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 208422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 208522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 208622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 208722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 208822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 208922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 209022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 209222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 209322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 2094864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 2095864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 2096864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 2097864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 2098864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2099864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 21002223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 2101864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 2102864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 2103864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 2104864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 2105864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 2106864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 2107864635ad7b3046d3042311423071152c613961deChris Lattner assert(!Regs.Regs.empty() && "Couldn't allocate output reg!"); 21082cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 21092cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 2110864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 21112cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 21122cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 2113864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 21142cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 211522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 211622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 21172cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 21182cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 21196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 21206656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 21216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 2122c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 21236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 21246656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 21256656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 212622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 21274e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 21283d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 21292223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 21302223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 21312223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 21322223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 21333d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 2134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 2135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 2136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 2137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 2138c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 2139c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2140c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2141c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2142c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2143c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 2144c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2145c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2146c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2147c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2148c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2149c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2150c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2151c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 2152c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue MatchedRegs; 2153c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 2154c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 2155c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 2156c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 2157c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.Regs.push_back(Reg); 2158c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2159c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2160c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Use the produced MatchedRegs object to 2161c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag); 2162c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 216387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 216487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 216587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 216687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 216787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 216887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 21693d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 217087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 217187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!TLI.isOperandValidForConstraint(InOperandVal, ConstraintCode[0])) 217287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2173c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 217487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 217587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 217687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 217787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 217887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 217987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 218087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 218187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 218287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Check that the operand isn't a float. 218387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 218487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2185c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 218687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 218787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 218887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 218987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 219087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 219187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 219287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 219387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 219487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 219587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 219687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 2197c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 21982223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 219987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 220087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 220187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 220287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 220387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 220487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 220587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 220687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 220787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 220887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 220987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag); 221087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 221187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 22126656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22136656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2214c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 2215c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 2216c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 2217c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 2218c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 2219c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 2220c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 2221c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 22226656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2224c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 22256656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2226ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2227ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 2228ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 2229ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 2230ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2231ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<MVT::ValueType> VTs; 2232ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Other); 2233ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Flag); 2234ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, VTs, AsmNodeOperands); 2235ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 2236ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 22386656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 2239864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 2240864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 22416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 22436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22446656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 22456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 22466656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 2247864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 22486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 2249864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 2250864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 22516656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2252ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 22546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<SDOperand> OutChains; 22556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 22566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner OutChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain, 22576656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner StoresToEmit[i].first, 22586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 22596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner DAG.getSrcValue(StoresToEmit[i].second))); 22606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 22616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 2262ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 2263ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 2264ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2265ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 22671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 22681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 227068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 227168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 227268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 227368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 227468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 22751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 2277a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 22781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 22791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 22801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2282a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType())); 2283cf5734dddd66af9388a171b44996505ede47feedChris Lattner 2284cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2285adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true, 2286cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 2287cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 2288cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 2289cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 22901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 22931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 22941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(getValue(I.getOperand(0)), 2295a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson TLI.getTargetData()->getIntPtrType())); 22961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 2297cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2298adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true, 2299cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 2300cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 23011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2303025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 2304025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 2305025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 2306025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 2307025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 2308025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 2309025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 2310025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner std::cerr << "If a target marks an instruction with " 2311025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "'usesCustomDAGSchedInserter', it must implement " 2312025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "TargetLowering::InsertAtEndOfBasicBlock!\n"; 2313025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 2314025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 2315025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 2316025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 231739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 2318acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 2319acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2320acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 232139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 232239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 23231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 2324acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 2325acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 2326acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 2327acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 2328acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 23291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 2332acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 2333acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2334acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 23351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 2338acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 2339acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2340acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 2341acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 2342acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 23431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2345fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 2346fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 2347f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 2348f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 2349fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 2350fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 2351fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 2352fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 23538c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 2354fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 2355fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 2356fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2357fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 2358fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 2359fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2360fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2361fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2362fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2363fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2364fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2365fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 2366fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2367fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 2368fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 2369fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2370fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2371fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2372fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 2373fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 2374fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 2375fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2376fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2377fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (unsigned i = 0; i != NumVals; ++i) 2378fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 2379fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2380fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2381fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2382fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumElems = cast<PackedType>(I->getType())->getNumElements(); 2383fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner const Type *EltTy = cast<PackedType>(I->getType())->getElementType(); 2384f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2385fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2386fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2387fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2388fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2389fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 2390fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2391fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2392fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2393fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2394fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2395fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2396fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 23973b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 23988c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 2399fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2400fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 2401fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, RetVals, Ops).Val; 24028c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 24038c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 2404fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2405fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 2406fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 2407fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 2408fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2409fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2410fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2411fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2412fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2413fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2414fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 2415fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2416fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 2417fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 2418fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 2419fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext 2420fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner : ISD::AssertZext; 2421fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT)); 2422fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 2423fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2424fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2425fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 2426fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2427fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 2428fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2429fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2430fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2431fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2432fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be reassembled from small 2433fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the source elt type is and how many small 2434fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it is. 2435fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2436fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2437fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (NumVals == 2) { 2438fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Lo = SDOperand(Result, i++); 2439fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Hi = SDOperand(Result, i++); 2440fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2441fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (!isLittleEndian()) 2442fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::swap(Lo, Hi); 2443fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2444fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi)); 2445fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2446fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Value scalarized into many values. Unimp for now. 2447fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2448fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2449fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2450fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2451fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2452020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const PackedType *PTy = cast<PackedType>(I->getType()); 2453020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 2454020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 2455f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2456fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2457fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2458fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2459fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2460020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 2461020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 2462020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng MVT::ValueType PTyElementVT, PTyLegalElementVT; 2463020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NE = getPackedTypeBreakdown(PTy, PTyElementVT, 2464020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng PTyLegalElementVT); 2465020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 2466020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // "N x PTyElementVT" MVT::Vector type. 2467020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 2468020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng DAG.getConstant(NE, MVT::i32), 2469020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng DAG.getValueType(PTyElementVT)); 2470020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng Ops.push_back(N); 2471fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2472fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2473fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2474fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2475fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2476fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2477fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2478fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 2479fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 2480fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2481f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2482f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 2483f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 2484f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 2485f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 2486f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 2487f4ec817299a4187044a6162c2f520772b3ad69a0Chris LattnerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, 2488f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 2489f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 2490f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 2491f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<SDOperand> Ops; 2492f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 2493f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 2494f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 2495f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 2496f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 2497f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2498f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 2499f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 2500f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(Args[i].second); 2501f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Op = Args[i].first; 2502f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2503f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2504f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2505f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2506f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2507f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2508f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 2509f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned ExtOp = Args[i].second->isSigned() ? 2510f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 2511f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 2512f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2513f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2514f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 2515f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2516f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2517f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2518f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2519f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2520f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 2521f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2522f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2523f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2524f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2525f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (NumVals == 2) { 2526f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2527f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(0, getPointerTy())); 2528f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2529f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(1, getPointerTy())); 2530f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (!isLittleEndian()) 2531f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::swap(Lo, Hi); 2532f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2533f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Lo); 2534f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Hi); 2535f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2536f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Value scalarized into many values. Unimp for now. 2537f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2538f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2539f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2540f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Doesn't handle vectors yet!"); 2541f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2542f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2543f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2544f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2545f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2546f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 2547f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<MVT::ValueType> RetTys; 2548f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2549f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 2550f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2551f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2552f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2553f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2554f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 2555f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2556f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2557f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 2558f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2559f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2560f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2561f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 2562f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2563f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2564f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2565f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2566f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 2567f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 2568f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2569f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Doesn't handle vectors yet!"); 2570f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2571f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2572f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2573f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2574f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 2575f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2576f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 2577f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, RetTys, Ops); 2578f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2579f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 2580f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 2581f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 2582f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 2583f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 2584f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2585f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 2586f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 2587f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2588f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 2589f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 2590f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 2591f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned AssertOp = RetTy->isSigned() ? 2592f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::AssertSext : ISD::AssertZext; 2593f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 2594f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 2595f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 2596f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2597f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 2598f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 2599f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2600f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2601f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 2602f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 2603f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 2604f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2605f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2606f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 2607f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2608f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2609f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2610f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 2611f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 2612f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2613f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2614f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 261539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// It is always conservatively correct for llvm.returnaddress and 261639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// llvm.frameaddress to return 0. 2617f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// 2618f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be 2619f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// expanded to 0 if the target wants. 262039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnerstd::pair<SDOperand, SDOperand> 262139ae3622791986a0232f7e4797b633f8fa9e54d2Chris LattnerTargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, 262239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth, SelectionDAG &DAG) { 262339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain); 26241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 262650381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 2627171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 2628171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 2629d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 2630171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 2631171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 26320aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 26330aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 26340aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 26350aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 26360aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 26370aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 26380aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 263939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) { 264039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth = (unsigned)cast<ConstantUInt>(I.getOperand(1))->getValue(); 264139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner std::pair<SDOperand,SDOperand> Result = 2642a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG); 264339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner setValue(&I, Result.first); 264439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner DAG.setRoot(Result.second); 264539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 26461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 264774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 26481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 26491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 2650a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 26511db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 26521db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 26531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 26541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 26551db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 26561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 26571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 26581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 26591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 26601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 26611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 26621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 26631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 26641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 26651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 26661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 26671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 26681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 26691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 26701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 26711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 26721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 26731db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 26741db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 26751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 26761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 267774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 267874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 267974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 268074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 268174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 268274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 268374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng MVT::ValueType CurVT = VT; 268474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 268574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 268674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 268774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 268874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 268974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Val = (Val << 8) | Str[Offset]; 269074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 269174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 269274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 269374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 269474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 26951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 26961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 26971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 26981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 26991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 27001db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27011db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 2702c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 270380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 270480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 2705c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 2706c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 2707c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 27081db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 27091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 27111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 27121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 27131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 27141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 27151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 27161db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 27181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 27191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 27211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 27221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 27241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 27251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 272980e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 273080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 273180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 273280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 27331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 273480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 273580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 273680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 2737dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 27381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 27391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 27401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 27411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 27421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 27431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 274480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 274580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 274680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 274780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 27481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 27491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 27501db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 275180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 275280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 27531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27557041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 27561db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 27571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 27581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 27591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 27601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 27611db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 27621db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27631db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 27641db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 27651db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 27671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 27681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<SDOperand> OutChains; 27691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 2770ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 27711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 2772c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 2773c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 277480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 27751db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 27761db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 27771db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 27781db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 2779a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 2780c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, getRoot(), 2781c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Value, 2782864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 2783864635ad7b3046d3042311423071152c613961deChris Lattner DAG.getSrcValue(I.getOperand(1), Offset)); 2784c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 2785c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 2786c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2787c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2788c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 2789c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2790c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 2791c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 2792c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 2793c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 2794cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 279574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 279674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 2797cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 279874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 279974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 280074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 280174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 280274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 280374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 280474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 2805cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 280674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 280774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 280874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 2809cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (GV) { 28100937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 2811cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 2812cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 2813cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 2814cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 2815cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 281674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 281774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2818c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 2819c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 2820c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 282174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 282274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2823cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 282474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 282574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 282674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 282774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 282874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 282974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 283074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 283174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 283274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 283374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(2), SrcOff)); 283474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 283574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 283674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 283774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 283874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 283974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 2840c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 284174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 284274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 28431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 28441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2845c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 28461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 28471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2848c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 2849c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 2850c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains)); 2851c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 2852c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 28531db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 28541db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28557041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner std::vector<SDOperand> Ops; 2856a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner Ops.push_back(getRoot()); 28571db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op1); 28581db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op2); 28591db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op3); 28601db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op4); 28617041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, Ops)); 28621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 28657041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 28667041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 28671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 28691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 28701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2872495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 287336b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // FIXME: we only modify the CFG to split critical edges. This 287436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // updates dom and loop info. 2875495a0b51915eb763576874f29192820b731edc22Chris Lattner} 28761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2877c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 28787e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// OptimizeNoopCopyExpression - We have determined that the specified cast 28797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// instruction is a noop copy (e.g. it's casting from one pointer type to 28807e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// another, int->uint, or int->sbyte on PPC. 2881903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// 2882903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// Return true if any changes are made. 2883903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI) { 28847e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *DefBB = CI->getParent(); 28857e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 28867e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner /// InsertedCasts - Only insert a cast in each block once. 28877e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner std::map<BasicBlock*, CastInst*> InsertedCasts; 28887e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 2889903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = false; 28907e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 28917e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UI != E; ) { 28927e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Use &TheUse = UI.getUse(); 28937e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *User = cast<Instruction>(*UI); 28947e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 28957e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Figure out which BB this cast is used in. For PHI's this is the 28967e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // appropriate predecessor block. 28977e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *UserBB = User->getParent(); 28987e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 28997e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner unsigned OpVal = UI.getOperandNo()/2; 29007e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UserBB = PN->getIncomingBlock(OpVal); 29017e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 29027e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29037e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Preincrement use iterator so we don't invalidate it. 29047e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner ++UI; 29057e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29067e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this user is in the same block as the cast, don't change the cast. 29077e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (UserBB == DefBB) continue; 29087e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29097e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If we have already inserted a cast into this block, use it. 29107e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 29117e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29127e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (!InsertedCast) { 29137e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock::iterator InsertPt = UserBB->begin(); 29147e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 29157e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29167e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner InsertedCast = 29177e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 2918903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = true; 29197e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 29207e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29217e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Replace a use of the cast with a use of the new casat. 29227e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner TheUse = InsertedCast; 29237e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 2924903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2925903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If we removed all uses, nuke the cast. 2926903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->use_empty()) 2927903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner CI->eraseFromParent(); 2928903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2929903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return MadeChange; 29307e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner} 2931c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 2932903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset, 2933903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// casting to the type of GEPI. 2934f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattnerstatic Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB, 2935f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *GEPI, Value *Ptr, 2936f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Value *PtrOffset) { 2937903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (V) return V; // Already computed. 2938903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2939903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner BasicBlock::iterator InsertPt; 2940903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (BB == GEPI->getParent()) { 2941903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If insert into the GEP's block, insert right after the GEP. 2942903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = GEPI; 2943903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ++InsertPt; 2944903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 2945903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Otherwise, insert at the top of BB, after any PHI nodes 2946903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = BB->begin(); 2947903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 2948903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 2949903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2950903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into 2951903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // BB so that there is only one value live across basic blocks (the cast 2952903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // operand). 2953903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CastInst *CI = dyn_cast<CastInst>(Ptr)) 2954903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType())) 2955903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 2956903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2957903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Add the offset, cast it to the right type. 2958903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt); 2959f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner return V = new CastInst(Ptr, GEPI->getType(), "", InsertPt); 2960903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 2961903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2962903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to 2963903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One 2964903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's 2965903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to 2966903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// sink PtrOffset into user blocks where doing so will likely allow us to fold 2967903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// the constant add into a load or store instruction. Additionally, if a user 2968903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// is a pointer-pointer cast, we look through it to find its users. 2969903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr, 2970903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Constant *PtrOffset, BasicBlock *DefBB, 2971903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GetElementPtrInst *GEPI, 2972f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> &InsertedExprs) { 2973903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (!RepPtr->use_empty()) { 2974903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Instruction *User = cast<Instruction>(RepPtr->use_back()); 2975903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2976903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If the user is a Pointer-Pointer cast, recurse. 2977903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<CastInst>(User) && isa<PointerType>(User->getType())) { 2978903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 2979903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2980903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we 2981903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // could invalidate an iterator. 2982903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->setOperand(0, UndefValue::get(RepPtr->getType())); 2983903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner continue; 2984903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 2985903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2986903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a load of the pointer, or a store through the pointer, emit 2987903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // the increment into the load/store block. 2988f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *NewVal; 2989903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<LoadInst>(User) || 2990903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) { 2991903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()], 2992903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->getParent(), GEPI, 2993903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 2994903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 2995903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this use is not foldable into the addressing mode, use a version 2996903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // emitted in the GEP block. 2997903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI, 2998903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 2999903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3000903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3001f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner if (GEPI->getType() != RepPtr->getType()) { 3002f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner BasicBlock::iterator IP = NewVal; 3003f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner ++IP; 3004f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner NewVal = new CastInst(NewVal, RepPtr->getType(), "", IP); 3005f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner } 3006903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->replaceUsesOfWith(RepPtr, NewVal); 3007903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3008903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3009903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3010903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3011c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction 3012c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// selection, we want to be a bit careful about some things. In particular, if 3013c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// we have a GEP instruction that is used in a different block than it is 3014c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// defined, the addressing expression of the GEP cannot be folded into loads or 3015c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// stores that use it. In this case, decompose the GEP and move constant 3016c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// indices into blocks that use it. 3017903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeGEPExpression(GetElementPtrInst *GEPI, 3018a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD) { 3019c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP is only used inside the block it is defined in, there is no 3020c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // need to rewrite it. 3021c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool isUsedOutsideDefBB = false; 3022c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock *DefBB = GEPI->getParent(); 3023c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end(); 3024c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner UI != E; ++UI) { 3025c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (cast<Instruction>(*UI)->getParent() != DefBB) { 3026c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner isUsedOutsideDefBB = true; 3027c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3028c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3029c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3030903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!isUsedOutsideDefBB) return false; 3031c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3032c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP has no non-zero constant indices, there is nothing we can do, 3033c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // ignore it. 3034c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool hasConstantIndex = false; 3035903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool hasVariableIndex = false; 3036c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3037c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3038903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) { 3039c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue()) { 3040c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner hasConstantIndex = true; 3041c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3042c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3043903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3044903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner hasVariableIndex = true; 3045903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3046c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3047903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3048903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a "GEP X, 0, 0, 0", turn this into a cast. 3049903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !hasVariableIndex) { 3050903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Value *NC = new CastInst(GEPI->getOperand(0), GEPI->getType(), 3051903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->getName(), GEPI); 3052903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->replaceAllUsesWith(NC); 3053903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->eraseFromParent(); 3054903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3055903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3056903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 30573802c2552fe4475418db3c948e7601d7259f996dChris Lattner // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses. 3058903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0))) 3059903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return false; 3060c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3061c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the 3062c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constant offset (which we now know is non-zero) and deal with it later. 3063c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner uint64_t ConstantOffset = 0; 3064a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const Type *UIntPtrTy = TD->getIntPtrType(); 3065c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Ptr = new CastInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI); 3066c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner const Type *Ty = GEPI->getOperand(0)->getType(); 3067c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3068c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3069c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3070c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Idx = *OI; 3071c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 3072c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 3073c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (Field) 3074a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field]; 3075c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = StTy->getElementType(Field); 3076c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } else { 3077c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 3078c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3079c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Handle constant subscripts. 3080c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 3081c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue() == 0) continue; 3082c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3083c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 3084a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 3085c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner else 3086a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset+=TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 3087c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner continue; 3088c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3089c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3090c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Ptr = Ptr + Idx * ElementSize; 3091c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3092c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Cast Idx to UIntPtrTy if needed. 3093c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = new CastInst(Idx, UIntPtrTy, "", GEPI); 3094c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3095a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 3096c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Mask off bits that should not be set. 3097c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3098c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *SizeCst = ConstantUInt::get(UIntPtrTy, ElementSize); 3099c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3100c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Multiply by the element size and add to the base. 3101c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI); 3102c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI); 3103c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3104c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3105c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3106c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Make sure that the offset fits in uintptr_t. 3107c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3108c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *PtrOffset = ConstantUInt::get(UIntPtrTy, ConstantOffset); 3109c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3110c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Okay, we have now emitted all of the variable index parts to the BB that 3111c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // the GEP is defined in. Loop over all of the using instructions, inserting 3112c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // an "add Ptr, ConstantOffset" into each block that uses it and update the 3113c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // instruction to use the newly computed value, making GEPI dead. When the 3114c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // user is a load or store instruction address, we emit the add into the user 3115c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // block, otherwise we use a canonical version right next to the gep (these 3116c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // won't be foldable as addresses, so we might as well share the computation). 3117c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner 3118f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> InsertedExprs; 3119903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3120c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3121c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Finally, the GEP is dead, remove it. 3122c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner GEPI->eraseFromParent(); 3123903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3124903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3125c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner} 3126c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 31271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 31281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 31291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 31301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "\n\n\n=== " << Fn.getName() << "\n"); 31311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3132c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // First, split all critical edges for PHI nodes with incoming values that are 3133c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constants, this way the load of the constant into a vreg will not be placed 3134c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // into MBBs that are used some other way. 3135c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 31367e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // In this pass we also look for GEP and cast instructions that are used 31377e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // across basic blocks and rewrite them to improve basic-block-at-a-time 31387e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // selection. 31397e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // 3140c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 3141903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = true; 3142903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (MadeChange) { 3143903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = false; 314436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 314536b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner PHINode *PN; 3146c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock::iterator BBI; 3147c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (BBI = BB->begin(); (PN = dyn_cast<PHINode>(BBI)); ++BBI) 314836b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 314936b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner if (isa<Constant>(PN->getIncomingValue(i))) 315036b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner SplitCriticalEdge(PN->getIncomingBlock(i), BB); 3151c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 31527e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (BasicBlock::iterator E = BB->end(); BBI != E; ) { 31537e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *I = BBI++; 31547e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 3155903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData()); 31567e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } else if (CastInst *CI = dyn_cast<CastInst>(I)) { 31577e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is a noop copy, sink it into user blocks to reduce the number 31587e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // of virtual registers that must be created and coallesced. 31597e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 31607e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType DstVT = TLI.getValueType(CI->getType()); 31617e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 31627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // This is an fp<->int conversion? 31637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT)) 31647e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner continue; 31657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 31667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is an extension, it will be a zero or sign extension, which 31677e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // isn't a noop. 31687e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT < DstVT) continue; 31697e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 31707e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If these values will be promoted, find out what they will be promoted 31717e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 31727e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // are. 31737e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) 31747e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner SrcVT = TLI.getTypeToTransformTo(SrcVT); 31757e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(DstVT) == TargetLowering::Promote) 31767e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner DstVT = TLI.getTypeToTransformTo(DstVT); 31777e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 31787e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 31797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT == DstVT) 3180903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeNoopCopyExpression(CI); 31817e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 31827e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 318336b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner } 3184903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3185c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 31861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 31871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 31881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 31891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3190edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 31911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 31921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 31931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 31941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3195ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerSDOperand SelectionDAGISel:: 3196ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerCopyValueToVirtualRegister(SelectionDAGLowering &SDL, Value *V, unsigned Reg) { 3197f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner SDOperand Op = SDL.getValue(V); 319818c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3199d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 320018c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3201d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3202d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3203d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3204d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3205d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3206d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SelectionDAG &DAG = SDL.DAG; 3207d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3208d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 32091c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 321070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 321170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 321270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()), 321370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 32141c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 321570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 321670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 321770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 321870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 321970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 322070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 322170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 322270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 322370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 322470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> OutChains; 322570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Root = SDL.getRoot(); 322670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 322770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 322870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op, DAG.getConstant(i, MVT::i32)); 322970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 323070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 323170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 323270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 323370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 323470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 323570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 323670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 323770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 323870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 323970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 324070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 324170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 324270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 324370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt, DAG.getConstant(0, MVT::i32)); 324470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 324570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt, DAG.getConstant(1, MVT::i32)); 324670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 324770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 324870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 32491c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 325070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 3251d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else if (SrcVT < DestVT) { 3252d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 3253fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 3254fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 3255fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 3256fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 3257d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 3258d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 3259d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 3260d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3261d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op, DAG.getConstant(0, MVT::i32)); 3262d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3263d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op, DAG.getConstant(1, MVT::i32)); 3264d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op = DAG.getCopyToReg(SDL.getRoot(), Reg, Lo); 3265d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 3266d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 32671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3269068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 3270068a81e9fca511b9a3b3a0f28a8988a57f994652Chris LattnerLowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL, 3271068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 32721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 3273068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner Function &F = *BB->getParent(); 32740afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 3275bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 3276bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 3277bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3278bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 3279bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 3280bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 3281bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 3282bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 3283f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3284bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 3285bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 3286bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (FuncInfo.ValueMap.count(AI)) { 3287bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand Copy = 3288bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner CopyValueToVirtualRegister(SDL, AI, FuncInfo.ValueMap[AI]); 3289bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 3290bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 32910afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 3292bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3293bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 3294966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 3295bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 3296068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 3297068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3298068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 3299068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 3300f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3301068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 3302068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3303068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 3304edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3305bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 3306bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (LLVMBB == &LLVMBB->getParent()->front()) 3307bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 33081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 33101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 33111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 33131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 33141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 33151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 3316f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 33171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 33181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 33191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 3320f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 3321ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 33221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 3323ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3324ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, I, VMI->second)); 33251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 33261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 33281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 33291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 33301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 33311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 33321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 3333edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 33341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 33361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 33371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 33391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 33401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 33411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 33421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 33431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock::iterator MBBI = FuncInfo.MBBMap[SuccBB]->begin(); 33441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 33451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 33471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 33481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 33491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 3350f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 3351f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 3352f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned Reg; 3353f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 3354f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 3355f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned &RegOut = ConstantsOut[C]; 3356f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (RegOut == 0) { 3357f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner RegOut = FuncInfo.CreateRegForValue(C); 3358ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3359ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, C, RegOut)); 3360f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 3361f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = RegOut; 3362f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } else { 3363f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 3364ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner if (Reg == 0) { 3365edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman assert(isa<AllocaInst>(PHIOp) && 3366ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 3367ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner "Didn't codegen value into a register!??"); 3368ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 3369ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3370ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, PHIOp, Reg)); 3371ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner } 33721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3373edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3374f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // Remember that this register needs to added to the machine PHI node as 3375f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // the input for this MBB. 33767e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 33777e02151ce2686687446ba7293e66d6b096106e68Chris Lattner unsigned NumElements; 33787e02151ce2686687446ba7293e66d6b096106e68Chris Lattner if (VT != MVT::Vector) 33797e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = TLI.getNumElements(VT); 33807e02151ce2686687446ba7293e66d6b096106e68Chris Lattner else { 33817e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT1,VT2; 33827e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = 33837e02151ce2686687446ba7293e66d6b096106e68Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 33847e02151ce2686687446ba7293e66d6b096106e68Chris Lattner VT1, VT2); 33857e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 3386f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 3387f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 33881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 33891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 33901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 33911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3392ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 33935a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 33947436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 33957436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 33967436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 33977436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 33987436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 33997436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 34007436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 34017436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 34027436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 34037436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 34047436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 34057436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 3406ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, UnorderedChains)); 3407ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 3408ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 34091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 34101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*LLVMBB->getTerminator()); 3411a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 3412f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 341337efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 3414f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 3415f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 341637efe6764568a3829fee26aba532283131d1a104Nate Begeman JT = SDL.JT; 3417f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3418a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 3419a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 34201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 3423af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 3424af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(false); 34252300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 34261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Lowered selection DAG:\n"); 34271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 34291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 34301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 3431ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 3432f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 34331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Legalized selection DAG:\n"); 34341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3435f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3436af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 3437af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(true); 34382300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 3439a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 3440552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 3441a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 3442a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 34431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 3444f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 34451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Selected machine code:\n"); 34461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 3447f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 3448f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3449f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 3450f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3451f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 3452f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 3453f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3454f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 3455f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3456f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 3457f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 3458f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 34591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3460f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 3461f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 3462f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3463f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3464a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 34651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 346637efe6764568a3829fee26aba532283131d1a104Nate Begeman if (SwitchCases.empty() && JT.Reg == 0) { 3467f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 3468f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 3469f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3470f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3471f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[i].second); 3472f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3473f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3474f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 34751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3476f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 34779453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 34789453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 34799453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 348037efe6764568a3829fee26aba532283131d1a104Nate Begeman if (JT.Reg) { 348137efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(SwitchCases.empty() && "Cannot have jump table and lowered switch"); 348237efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 348337efe6764568a3829fee26aba532283131d1a104Nate Begeman CurDAG = &SDAG; 348437efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 34859453eea49bca1c3904047db495855c93e001d1cdNate Begeman MachineBasicBlock *RangeBB = BB; 348637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 348737efe6764568a3829fee26aba532283131d1a104Nate Begeman BB = JT.MBB; 348837efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.setCurrentBasicBlock(BB); 348937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 349037efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.visitJumpTable(JT); 349137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDAG.setRoot(SDL.getRoot()); 349237efe6764568a3829fee26aba532283131d1a104Nate Begeman CodeGenAndEmitDAG(SDAG); 349337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 349437efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 349537efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 349637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 349737efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 349837efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 3499f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (PHIBB == JT.Default) { 3500f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3501f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(RangeBB); 3502f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 3503f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 350437efe6764568a3829fee26aba532283131d1a104Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3505f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 350637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 350737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 350837efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 350937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 351037efe6764568a3829fee26aba532283131d1a104Nate Begeman 3511f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 3512f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 3513f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for(unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 3514f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3515f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 3516f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 3517f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 3518f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 3519f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 3520f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 3521f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 3522f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 3523f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 3524f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Iterate over the phi nodes, if there is a phi node in a successor of this 3525f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // block (for instance, the default block), then add a pair of operands to 3526f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the phi node for this block, as if we were coming from the original 3527f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // BB before switch expansion. 3528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 3529f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 3530f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 3531f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3532f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (PHIBB == SwitchCases[i].LHSBB || PHIBB == SwitchCases[i].RHSBB) { 3534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3535f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3536f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3537f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3538a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 35391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3540a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 3541a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 3542a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 3543a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 3544a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 3545a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 35464ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng ScheduleDAG *SL = NULL; 35474ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 35484ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng switch (ISHeuristic) { 35494ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng default: assert(0 && "Unrecognized scheduling heuristic"); 3550ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case defaultScheduling: 35513f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 35524a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer()); 35534a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner else { 35544a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner assert(TLI.getSchedulingPreference() == 35554a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 35563f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng SL = createBURRListDAGScheduler(DAG, BB); 35574a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner } 35583f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng break; 3559ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case noScheduling: 356020a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createBFS_DAGScheduler(DAG, BB); 356120a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner break; 3562ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case simpleScheduling: 356320a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createSimpleDAGScheduler(false, DAG, BB); 356420a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner break; 3565ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case simpleNoItinScheduling: 356620a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createSimpleDAGScheduler(true, DAG, BB); 35674ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng break; 3568ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingBURR: 3569f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng SL = createBURRListDAGScheduler(DAG, BB); 3570a5de484bc7c8f896b5903999797c4d57f4e45185Chris Lattner break; 3571ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingTDRR: 3572e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SL = createTDRRListDAGScheduler(DAG, BB); 3573e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng break; 3574ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingTD: 3575b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris Lattner SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer()); 3576a5de484bc7c8f896b5903999797c4d57f4e45185Chris Lattner break; 35774ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 3578a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 3579cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 3580a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 35810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 3582b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris LattnerHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 3583b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris Lattner return new HazardRecognizer(); 358403fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner} 358503fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 35860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 35870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 35880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 35890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 35900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 35910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 35920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 35930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 35940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 35950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 35960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 35970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 35980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 35990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 36010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 36020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 36030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 36040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 36050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 36060e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 36070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 36080e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 36090e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 36100e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 36110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::cerr << "Could not match memory address. Inline asm failure!\n"; 36120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 36130e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36140e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 36160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32)); 36170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 36180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 36190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 36230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 36240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 36250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 3626