SelectionDAGISel.cpp revision cf752aa502a2ce6eaca9db4640171143c49e1733
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" 40124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 41495a0b51915eb763576874f29192820b731edc22Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 427944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#include "llvm/Support/CommandLine.h" 437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <map> 464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner#include <set> 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include <iostream> 487e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 527944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 53a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 55a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 56a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 57a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 587944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 595e46a19ec848cd4fc9649bd5170c43d9e657668cChris Lattnerstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0; 607944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 617944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 62ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng// Scheduling heuristics 63ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Chengenum SchedHeuristics { 64ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng defaultScheduling, // Let the target specify its preference. 65ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng noScheduling, // No scheduling, emit breadth first sequence. 66ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng simpleScheduling, // Two pass, min. critical path, max. utilization. 67ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng simpleNoItinScheduling, // Same as above exact using generic latency. 68ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingBURR, // Bottom-up reg reduction list scheduling. 69ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingTDRR, // Top-down reg reduction list scheduling. 70ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng listSchedulingTD // Top-down list scheduler. 71ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng}; 72ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng 734ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 74ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng cl::opt<SchedHeuristics> 754ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng ISHeuristic( 764ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "sched", 774ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng cl::desc("Choose scheduling style"), 78ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng cl::init(defaultScheduling), 794ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng cl::values( 80ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(defaultScheduling, "default", 813f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng "Target preferred scheduling style"), 82ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(noScheduling, "none", 8317d52f723421ce28d1b9fe2fc058366ed43ec094Jim Laskey "No scheduling: breadth first sequencing"), 84ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(simpleScheduling, "simple", 854ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "Simple two pass scheduling: minimize critical path " 864ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "and maximize processor utilization"), 87ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(simpleNoItinScheduling, "simple-noitin", 884ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "Simple two pass scheduling: Same as simple " 894ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng "except using generic latency"), 90ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingBURR, "list-burr", 91e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng "Bottom-up register reduction list scheduling"), 92ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingTDRR, "list-tdrr", 93e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng "Top-down register reduction list scheduling"), 94ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng clEnumValN(listSchedulingTD, "list-td", 9503fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner "Top-down list scheduler"), 964ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng clEnumValEnd)); 974ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 984ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 99864635ad7b3046d3042311423071152c613961deChris Lattnernamespace { 100864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 101864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 102864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 103864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 104864635ad7b3046d3042311423071152c613961deChris Lattner struct RegsForValue { 105864635ad7b3046d3042311423071152c613961deChris Lattner /// Regs - This list hold the register (for legal and promoted values) 106864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 107864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 108864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 109864635ad7b3046d3042311423071152c613961deChris Lattner 110864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT - The value type of each register. 111864635ad7b3046d3042311423071152c613961deChris Lattner /// 112864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 113864635ad7b3046d3042311423071152c613961deChris Lattner 114864635ad7b3046d3042311423071152c613961deChris Lattner /// ValueVT - The value type of the LLVM value, which may be promoted from 115864635ad7b3046d3042311423071152c613961deChris Lattner /// RegVT or made from merging the two expanded parts. 116864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT; 117864635ad7b3046d3042311423071152c613961deChris Lattner 118864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue() : RegVT(MVT::Other), ValueVT(MVT::Other) {} 119864635ad7b3046d3042311423071152c613961deChris Lattner 120864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 121864635ad7b3046d3042311423071152c613961deChris Lattner : RegVT(regvt), ValueVT(valuevt) { 122864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 123864635ad7b3046d3042311423071152c613961deChris Lattner } 124864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue(const std::vector<unsigned> ®s, 125864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 126864635ad7b3046d3042311423071152c613961deChris Lattner : Regs(regs), RegVT(regvt), ValueVT(valuevt) { 127864635ad7b3046d3042311423071152c613961deChris Lattner } 128864635ad7b3046d3042311423071152c613961deChris Lattner 129864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 130864635ad7b3046d3042311423071152c613961deChris Lattner /// this value and returns the result as a ValueVT value. This uses 131864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 132864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 1339f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 134c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 135c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 136c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 137c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 138c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 1399f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const; 140c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 141c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 142c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 143c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 144c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1459f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 146864635ad7b3046d3042311423071152c613961deChris Lattner }; 147864635ad7b3046d3042311423071152c613961deChris Lattner} 1484ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 1521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 153f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 154f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 1551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 1561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 1571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 1581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SSARegMap *RegMap; 1591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 1611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 1631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 1641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 1681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, unsigned> ValueMap; 1691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 1711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 1721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 1731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 1741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 1761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 1771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 178edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1793c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 1803c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 1811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 1821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 1831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 1841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 1851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 1871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 190f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 191f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// switch instruction, which may expand to multiple basic blocks. 1921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 1931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 196f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 197f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 1981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 1991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 202bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 203f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 204f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 205bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 206bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 207bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 208f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 209bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 210bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 211bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 212bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 214edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 2151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegMap(MF.getSSARegMap()) { 2161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 217bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 218bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 21916ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 22016ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 221bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 222bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 224bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 225bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 226bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 2272aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(AI->getArraySize())) { 2311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 232a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 233ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 234a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 235ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 236a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 237a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // If the alignment of the value is smaller than the size of the value, 238a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // and if the size of the value is particularly small (<= 8 bytes), 239a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // round up to the size of the value for potentially better performance. 240a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // 241a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // FIXME: This could be made better with a preferred alignment hook in 242a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner // TargetData. It serves primarily to 8-byte align doubles for X86. 243a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner if (Align < TySize && TySize <= 8) Align = TySize; 2442dfa8192abaad8a3c29132dba50e8b85218e918cChris Lattner TySize *= CUI->getValue(); // Get total allocated size. 245d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 2461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 247f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2502aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 2512aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 2541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 2602aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 2631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 2661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 2671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 2681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(); 269f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 270f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 27170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 27270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NumElements; 27370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) 27470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = TLI.getNumElements(VT); 27570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else { 27670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType VT1,VT2; 27770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner NumElements = 27870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 27970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner VT1, VT2); 28070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 281f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned PHIReg = ValueMap[PN]; 282f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner assert(PHIReg &&"PHI node does not have an assigned virtual register!"); 283f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0; i != NumElements; ++i) 284f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner BuildMI(MBB, TargetInstrInfo::PHI, PN->getNumOperands(), PHIReg+i); 285f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2893c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 2903c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 2913c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 2923c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 2933c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType()); 2943c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2953c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The number of multiples of registers that we need, to, e.g., split up 2963c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // a <2 x int64> -> 4 x i32 registers. 2973c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumVectorRegs = 1; 2983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2993c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a packed type, figure out what type it will decompose into 3003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // and how many of the elements it will use. 3013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (VT == MVT::Vector) { 3023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner const PackedType *PTy = cast<PackedType>(V->getType()); 3033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NumElts = PTy->getNumElements(); 3043c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType EltTy = TLI.getValueType(PTy->getElementType()); 3053c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3063c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // Divide the input until we get to a supported size. This will always 3073c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // end with a scalar if the target doesn't support vectors. 3083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (NumElts > 1 && !TLI.isTypeLegal(getVectorType(EltTy, NumElts))) { 3093c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumElts >>= 1; 3103c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner NumVectorRegs <<= 1; 3113c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3126cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner if (NumElts == 1) 3136cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = EltTy; 3146cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner else 3156cb7004c3499f07c034a01f6335b5058aa80a5ceChris Lattner VT = getVectorType(EltTy, NumElts); 3163c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3173c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3183c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // The common case is that we will only create one register for this 3193c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // value. If we have that case, create and return the virtual register. 3203c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NV = TLI.getNumElements(VT); 3213c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner if (NV == 1) { 3223c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If we are promoting this value, pick the next largest supported type. 3233c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MVT::ValueType PromotedType = TLI.getTypeToTransformTo(VT); 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned Reg = MakeReg(PromotedType); 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this is a vector of supported or promoted types (e.g. 4 x i16), 3263c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // create all of the registers. 3273c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NumVectorRegs; ++i) 3283c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg(PromotedType); 3293c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return Reg; 3303c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner } 3313c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3323c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // If this value is represented with multiple target registers, make sure 3333c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner // to create enough consecutive registers of the right (smaller) type. 3343c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned NT = VT-1; // Find the type to use. 3353c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner while (TLI.getNumElements((MVT::ValueType)NT) != 1) 3363c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner --NT; 3373c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3383c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned R = MakeReg((MVT::ValueType)NT); 3393c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner for (unsigned i = 1; i != NV*NumVectorRegs; ++i) 3403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner MakeReg((MVT::ValueType)NT); 3413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner return R; 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const Value*, SDOperand> NodeMap; 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 355d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 356d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 357d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 358d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 359d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 360d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 361f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Case - A pair of values to record the Value for a switch case, and the 362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// case's target basic block. 363f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<Constant*, MachineBasicBlock*> Case; 364f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::vector<Case>::iterator CaseItr; 365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman typedef std::pair<CaseItr, CaseItr> CaseRange; 366f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 370f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 374f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 376f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 377f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 383f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 384f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// The comparison function for sorting Case values. 385f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman bool operator () (const Case& C1, const Case& C2) { 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (const ConstantUInt* U1 = dyn_cast<const ConstantUInt>(C1.first)) 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return U1->getValue() < cast<const ConstantUInt>(C2.first)->getValue(); 389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 390f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const ConstantSInt* S1 = dyn_cast<const ConstantSInt>(C1.first); 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return S1->getValue() < cast<const ConstantSInt>(C2.first)->getValue(); 392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 393f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 3961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 3971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 3981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 3991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 401a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 40637efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGISel::JumpTable JT; 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 413edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman FunctionLoweringInfo &funcinfo) 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), 4159453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT(0,0,0,0), FuncInfo(funcinfo) { 4161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 418a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// getRoot - Return the current virtual root of the Selection DAG. 419a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 420a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 421d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 422d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 423edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 424d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 425d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 426d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 427d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 428d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 429d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 430d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 431d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 432d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, PendingLoads); 433d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 434d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 435d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 436a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 437a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 4451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 4461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 4471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 4481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 4521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 45428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 45528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile); 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand getIntPtrConstant(uint64_t Val) { 4581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return DAG.getConstant(Val, TLI.getPointerTy()); 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 461199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const SDOperand &setValue(const Value *V, SDOperand NewN) { 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return N = NewN; 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 469864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue GetRegistersForValue(const std::string &ConstrCode, 470864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, 471864635ad7b3046d3042311423071152c613961deChris Lattner bool OutReg, bool InReg, 472864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 473864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &InputRegs); 474f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 478f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 481f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Helper for visitSwitch 482f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 48337efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 484f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitInvoke(InvokeInst &I) { assert(0 && "TODO"); } 4871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnwind(UnwindInst &I) { assert(0 && "TODO"); } 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4895fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitBinary(User &I, unsigned IntOp, unsigned FPOp, unsigned VecOp); 490e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 4915fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 4925fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::ADD, ISD::FADD, ISD::VADD); 49301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 494b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 4955fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitMul(User &I) { 4965fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::MUL, ISD::FMUL, ISD::VMUL); 49701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitDiv(User &I) { 49901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 5003e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng visitBinary(I, 5013e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::SDIV : ISD::UDIV, ISD::FDIV, 5023e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng Ty->isSigned() ? ISD::VSDIV : ISD::VUDIV); 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRem(User &I) { 50501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner const Type *Ty = I.getType(); 5065fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, Ty->isSigned() ? ISD::SREM : ISD::UREM, ISD::FREM, 0); 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5083e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitAnd(User &I) { visitBinary(I, ISD::AND, 0, ISD::VAND); } 5093e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitOr (User &I) { visitBinary(I, ISD::OR, 0, ISD::VOR); } 5103e1ce5a44d3d59b2b9ca68a21261f0f487d69269Evan Cheng void visitXor(User &I) { visitBinary(I, ISD::XOR, 0, ISD::VXOR); } 511e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShl(User &I) { visitShift(I, ISD::SHL); } 512e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShr(User &I) { 513e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman visitShift(I, I.getType()->isUnsigned() ? ISD::SRL : ISD::SRA); 5141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 516f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetCC(User &I, ISD::CondCode SignedOpc, ISD::CondCode UnsignedOpc, 517f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpc); 518f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetEQ(User &I) { visitSetCC(I, ISD::SETEQ, ISD::SETEQ, 519f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOEQ); } 520f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetNE(User &I) { visitSetCC(I, ISD::SETNE, ISD::SETNE, 521f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETUNE); } 522f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLE(User &I) { visitSetCC(I, ISD::SETLE, ISD::SETULE, 523f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLE); } 524f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGE(User &I) { visitSetCC(I, ISD::SETGE, ISD::SETUGE, 525f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGE); } 526f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetLT(User &I) { visitSetCC(I, ISD::SETLT, ISD::SETULT, 527f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOLT); } 528f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng void visitSetGT(User &I) { visitSetCC(I, ISD::SETGT, ISD::SETUGT, 529f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::SETOGT); } 5301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5312bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 5322bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 5333e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 534c7029805ef35ce9805931067b841e6af11db382eChris Lattner 5351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 5361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCast(User &I); 5371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 5381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 5401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 5411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 5421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 5431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 5441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 5451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 546ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner void visitInlineAsm(CallInst &I); 547c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 5480eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 5491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 5511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 5521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 5531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 55439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner void visitFrameReturnAddress(CallInst &I, bool isFrameAddress); 5551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5567041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner void visitMemIntrinsic(CallInst &I, unsigned Op); 5571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 5591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 5601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 5631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 5641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 5671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 5681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 569199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 570199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 571199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 572199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 573199862b74973198c2ab5a139f664c86713e7b579Chris Lattner const Type *VTy = V->getType(); 574199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType VT = TLI.getValueType(VTy); 575199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 576199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 577199862b74973198c2ab5a139f664c86713e7b579Chris Lattner visit(CE->getOpcode(), *CE); 578199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(N.Val && "visit didn't populate the ValueMap!"); 579199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 580199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { 581199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 582199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<ConstantPointerNull>(C)) { 583199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 584199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (isa<UndefValue>(C)) { 58523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner if (!isa<PackedType>(VTy)) 58623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 58723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 588b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR of undef nodes. 58923d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner const PackedType *PTy = cast<PackedType>(VTy); 59023d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner unsigned NumElements = PTy->getNumElements(); 59123d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 59223d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 59323d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner std::vector<SDOperand> Ops; 59423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.assign(NumElements, DAG.getNode(ISD::UNDEF, PVT)); 59523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner 59623d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner // Create a VConstant node with generic Vector type. 59723d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 59823d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 599b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 600199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 601199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstantFP(CFP->getValue(), VT); 602199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else if (const PackedType *PTy = dyn_cast<PackedType>(VTy)) { 603199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned NumElements = PTy->getNumElements(); 604199862b74973198c2ab5a139f664c86713e7b579Chris Lattner MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 605199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 606199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Now that we know the number and type of the elements, push a 607199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Constant or ConstantFP node onto the ops list for each element of 608199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // the packed constant. 609199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::vector<SDOperand> Ops; 610199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (ConstantPacked *CP = dyn_cast<ConstantPacked>(C)) { 6112bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner for (unsigned i = 0; i != NumElements; ++i) 6122bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner Ops.push_back(getValue(CP->getOperand(i))); 613199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 614199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(isa<ConstantAggregateZero>(C) && "Unknown packed constant!"); 615199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand Op; 616199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(PVT)) 617199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstantFP(0, PVT); 618199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 619199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Op = DAG.getConstant(0, PVT); 620199862b74973198c2ab5a139f664c86713e7b579Chris Lattner Ops.assign(NumElements, Op); 621199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 622199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 623b2827b0901162169bb2692b77a839c9767849134Chris Lattner // Create a VBUILD_VECTOR node with generic Vector type. 62423d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getConstant(NumElements, MVT::i32)); 62523d564c11fbe628dbebd6d8f09d7d07fa862b719Chris Lattner Ops.push_back(DAG.getValueType(PVT)); 626b2827b0901162169bb2692b77a839c9767849134Chris Lattner return N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 627199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 628199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // Canonicalize all constant ints to be unsigned. 629199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(cast<ConstantIntegral>(C)->getRawValue(),VT); 630199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 631199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 632199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 633199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 634199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 635199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 636199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 637199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 638199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 639199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 640199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const Value*, unsigned>::const_iterator VMI = 641199862b74973198c2ab5a139f664c86713e7b579Chris Lattner FuncInfo.ValueMap.find(V); 642199862b74973198c2ab5a139f664c86713e7b579Chris Lattner assert(VMI != FuncInfo.ValueMap.end() && "Value not in map!"); 643199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 644199862b74973198c2ab5a139f664c86713e7b579Chris Lattner unsigned InReg = VMI->second; 645199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 646199862b74973198c2ab5a139f664c86713e7b579Chris Lattner // If this type is not legal, make it so now. 64770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (VT != MVT::Vector) { 64870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(VT); 649199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 65070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getCopyFromReg(DAG.getEntryNode(), InReg, DestVT); 65170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (DestVT < VT) { 65270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Source must be expanded. This input value is actually coming from the 65370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // register pair VMI->second and VMI->second+1. 65470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::BUILD_PAIR, VT, N, 65570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getCopyFromReg(DAG.getEntryNode(), InReg+1, DestVT)); 65670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (DestVT > VT) { // Promotion case 657199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (MVT::isFloatingPoint(VT)) 658199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::FP_ROUND, VT, N); 659199862b74973198c2ab5a139f664c86713e7b579Chris Lattner else 660199862b74973198c2ab5a139f664c86713e7b579Chris Lattner N = DAG.getNode(ISD::TRUNCATE, VT, N); 661199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 66270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 66370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Otherwise, if this is a vector, make it available as a generic vector 66470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // here. 66570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 6662e2ef9535070bb352601482cceac1140c1158cddChris Lattner const PackedType *PTy = cast<PackedType>(VTy); 6672e2ef9535070bb352601482cceac1140c1158cddChris Lattner unsigned NE = TLI.getPackedTypeBreakdown(PTy, PTyElementVT, 66870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyLegalElementVT); 66970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 67070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Build a VBUILD_VECTOR with the input registers. 67170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> Ops; 67270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 67370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the value types are legal, just VBUILD the CopyFromReg nodes. 67470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) 67570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 67670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT)); 67770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyElementVT < PTyLegalElementVT) { 67870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was promoted, use TRUNCATE of FP_ROUND as appropriate. 67970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 68070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 68170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 68270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyElementVT)) 68370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::FP_ROUND, PTyElementVT, Op); 68470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 68570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::TRUNCATE, PTyElementVT, Op); 68670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(Op); 68770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 68870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 68970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // If the register was expanded, use BUILD_PAIR. 69070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner assert((NE & 1) == 0 && "Must expand into a multiple of 2 elements!"); 69170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE/2; ++i) { 69270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op0 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 69370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 69470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Op1 = DAG.getCopyFromReg(DAG.getEntryNode(), InReg++, 69570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT); 69670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Op0, Op1)); 69770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 69970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 70070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getConstant(NE, MVT::i32)); 70170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Ops.push_back(DAG.getValueType(PTyLegalElementVT)); 70270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner N = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 7032e2ef9535070bb352601482cceac1140c1158cddChris Lattner 7042e2ef9535070bb352601482cceac1140c1158cddChris Lattner // Finally, use a VBIT_CONVERT to make this available as the appropriate 7052e2ef9535070bb352601482cceac1140c1158cddChris Lattner // vector type. 7062e2ef9535070bb352601482cceac1140c1158cddChris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 7072e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getConstant(PTy->getNumElements(), 7082e2ef9535070bb352601482cceac1140c1158cddChris Lattner MVT::i32), 7092e2ef9535070bb352601482cceac1140c1158cddChris Lattner DAG.getValueType(TLI.getValueType(PTy->getElementType()))); 710199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 711199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 712199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N; 713199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 714199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 715199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 7161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 7171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 718a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getRoot())); 7191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 7201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 721ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman std::vector<SDOperand> NewValues; 722ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(getRoot()); 723ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 724ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 7258e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng bool isSigned = I.getOperand(i)->getType()->isSigned(); 726ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman 727ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // If this is an integer return value, we need to promote it ourselves to 728ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // the full width of a register, since LegalizeOp will use ANY_EXTEND rather 729ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman // than sign/zero. 7308e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 7318e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 732ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (MVT::isInteger(RetOp.getValueType()) && 733ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp.getValueType() < MVT::i64) { 734ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman MVT::ValueType TmpVT; 735ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman if (TLI.getTypeAction(MVT::i32) == TargetLowering::Promote) 736ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = TLI.getTypeToTransformTo(MVT::i32); 737ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 738ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman TmpVT = MVT::i32; 7391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7408e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng if (isSigned) 741ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::SIGN_EXTEND, TmpVT, RetOp); 742ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman else 743ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman RetOp = DAG.getNode(ISD::ZERO_EXTEND, TmpVT, RetOp); 744ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 745ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman NewValues.push_back(RetOp); 7468e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng NewValues.push_back(DAG.getConstant(isSigned, MVT::i32)); 7471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 748ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, NewValues)); 7491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 7501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 7521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 7531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 754f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ0MBB); 7551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 7571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 7581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 7591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 7601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 7611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 7631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 7641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 765a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 766dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 7671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 7681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 769f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(Succ1MBB); 7701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getCondition()); 7721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ1MBB == NextBlock) { 7731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is false, fall through. This means we should branch 7741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // if the condition is true to Succ #0. 775a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 776dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ0MBB))); 7771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else if (Succ0MBB == NextBlock) { 7781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If the condition is true, fall through. This means we should branch if 7791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the condition is false to Succ #1. Invert the condition first. 7801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand True = DAG.getConstant(1, Cond.getValueType()); 7811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 782a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), 783dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman Cond, DAG.getBasicBlock(Succ1MBB))); 7841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 785e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner std::vector<SDOperand> Ops; 786e7ccd4acd2ee9753e6d212efd522be5c7de154d7Chris Lattner Ops.push_back(getRoot()); 787298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // If the false case is the current basic block, then this is a self 788298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // loop. We do not want to emit "Loop: ... brcond Out; br Loop", as it 789298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // adds an extra instruction in the loop. Instead, invert the 790298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng // condition and emit "Loop: ... br!cond Loop; br Out. 791298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng if (CurMBB == Succ1MBB) { 792298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng std::swap(Succ0MBB, Succ1MBB); 793298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng SDOperand True = DAG.getConstant(1, Cond.getValueType()); 794298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 795298ebf2bd80ca415e58bbcbd9866ee58f167b620Evan Cheng } 79681e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman SDOperand True = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 79781e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ0MBB)); 79881e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, True, 79981e8097377529dc3b666f33bb525c49cfbac3f51Nate Begeman DAG.getBasicBlock(Succ1MBB))); 8001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 8031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 804f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 805f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 806f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 807f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand SwitchOp = getValue(CB.SwitchV); 808f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand CaseOp = getValue(CB.CaseC); 809f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand Cond = DAG.getSetCC(MVT::i1, SwitchOp, CaseOp, CB.CC); 810f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 811f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 812f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 813f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 814f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 815f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 816f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 817f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 818f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 819f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 820f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.LHSBB == NextBlock) { 821f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::swap(CB.LHSBB, CB.RHSBB); 822f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 823f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 824f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 825f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getRoot(), Cond, 826f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.LHSBB)); 827f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CB.RHSBB == NextBlock) 828f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 829f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 830f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 831f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(CB.RHSBB))); 832f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 833f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.LHSBB); 834f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMBB->addSuccessor(CB.RHSBB); 835f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 836f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 83737efe6764568a3829fee26aba532283131d1a104Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 83837efe6764568a3829fee26aba532283131d1a104Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 83937efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 84037efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Need to emit different code for PIC vs. Non-PIC, specifically, 84137efe6764568a3829fee26aba532283131d1a104Nate Begeman // we need to add the address of the jump table to the value loaded, since 84237efe6764568a3829fee26aba532283131d1a104Nate Begeman // the entries in the jump table will be differences rather than absolute 84337efe6764568a3829fee26aba532283131d1a104Nate Begeman // addresses. 84437efe6764568a3829fee26aba532283131d1a104Nate Begeman 84537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 84637efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 84737efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned PTyBytes = MVT::getSizeInBits(PTy)/8; 84837efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand Copy = DAG.getCopyFromReg(getRoot(), JT.Reg, PTy); 84937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand IDX = DAG.getNode(ISD::MUL, PTy, Copy, 85037efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(PTyBytes, PTy)); 85137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand ADD = DAG.getNode(ISD::ADD, PTy, IDX, DAG.getJumpTable(JT.JTI,PTy)); 85237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand LD = DAG.getLoad(PTy, Copy.getValue(1), ADD, DAG.getSrcValue(0)); 85337efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD)); 85437efe6764568a3829fee26aba532283131d1a104Nate Begeman} 85537efe6764568a3829fee26aba532283131d1a104Nate Begeman 856f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitch(SwitchInst &I) { 857f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 858f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 859f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 862f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 863f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 864f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 865f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (I.getNumOperands() == 2) { 866f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 867f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *DefaultMBB = FuncInfo.MBBMap[I.getDefaultDest()]; 868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 869f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (DefaultMBB != NextBlock) 870f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getRoot(), 871f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.getBasicBlock(DefaultMBB))); 872f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 873f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 875f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 876f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 877f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 878f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<Case> Cases; 879f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 1; i < I.getNumSuccessors(); ++i) { 880f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *SMBB = FuncInfo.MBBMap[I.getSuccessor(i)]; 881f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cases.push_back(Case(I.getSuccessorValue(i), SMBB)); 882f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 883f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::sort(Cases.begin(), Cases.end(), CaseCmp()); 884f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 885f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 886f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 887f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 888f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Value *SV = I.getOperand(0); 889f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Default = FuncInfo.MBBMap[I.getDefaultDest()]; 89037efe6764568a3829fee26aba532283131d1a104Nate Begeman 89137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Get the MachineFunction which holds the current MBB. This is used during 89237efe6764568a3829fee26aba532283131d1a104Nate Begeman // emission of jump tables, and when inserting any additional MBBs necessary 89337efe6764568a3829fee26aba532283131d1a104Nate Begeman // to represent the switch. 894f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction *CurMF = CurMBB->getParent(); 895f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman const BasicBlock *LLVMBB = CurMBB->getBasicBlock(); 89637efe6764568a3829fee26aba532283131d1a104Nate Begeman Reloc::Model Relocs = TLI.getTargetMachine().getRelocationModel(); 89737efe6764568a3829fee26aba532283131d1a104Nate Begeman 89817c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // If the switch has more than 5 blocks, and at least 31.25% dense, and the 89917c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // target supports indirect branches, then emit a jump table rather than 90017c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman // lowering the switch to a binary tree of conditional branches. 90137efe6764568a3829fee26aba532283131d1a104Nate Begeman // FIXME: Make this work with PIC code 9029453eea49bca1c3904047db495855c93e001d1cdNate Begeman if (TLI.isOperationLegal(ISD::BRIND, TLI.getPointerTy()) && 90337efe6764568a3829fee26aba532283131d1a104Nate Begeman (Relocs == Reloc::Static || Relocs == Reloc::DynamicNoPIC) && 904f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman Cases.size() > 5) { 90537efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t First = cast<ConstantIntegral>(Cases.front().first)->getRawValue(); 90637efe6764568a3829fee26aba532283131d1a104Nate Begeman uint64_t Last = cast<ConstantIntegral>(Cases.back().first)->getRawValue(); 907f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman double Density = (double)Cases.size() / (double)((Last - First) + 1ULL); 908f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 90917c275ff2ce9e94d647e781f6dac6320d088f899Nate Begeman if (Density >= 0.3125) { 91037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Create a new basic block to hold the code for loading the address 91137efe6764568a3829fee26aba532283131d1a104Nate Begeman // of the jump table, and jumping to it. Update successor information; 91237efe6764568a3829fee26aba532283131d1a104Nate Begeman // we will either branch to the default case for the switch, or the jump 91337efe6764568a3829fee26aba532283131d1a104Nate Begeman // table. 91437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 91537efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 91637efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(Default); 91737efe6764568a3829fee26aba532283131d1a104Nate Begeman CurMBB->addSuccessor(JumpTableBB); 91837efe6764568a3829fee26aba532283131d1a104Nate Begeman 91937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Subtract the lowest switch case value from the value being switched on 92037efe6764568a3829fee26aba532283131d1a104Nate Begeman // and conditional branch to default mbb if the result is greater than the 92137efe6764568a3829fee26aba532283131d1a104Nate Begeman // difference between smallest and largest cases. 92237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SwitchOp = getValue(SV); 92337efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType VT = SwitchOp.getValueType(); 92437efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 92537efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(First, VT)); 92637efe6764568a3829fee26aba532283131d1a104Nate Begeman 92737efe6764568a3829fee26aba532283131d1a104Nate Begeman // The SDNode we just created, which holds the value being switched on 92837efe6764568a3829fee26aba532283131d1a104Nate Begeman // minus the the smallest case value, needs to be copied to a virtual 92937efe6764568a3829fee26aba532283131d1a104Nate Begeman // register so it can be used as an index into the jump table in a 93037efe6764568a3829fee26aba532283131d1a104Nate Begeman // subsequent basic block. This value may be smaller or larger than the 93137efe6764568a3829fee26aba532283131d1a104Nate Begeman // target's pointer type, and therefore require extension or truncating. 93237efe6764568a3829fee26aba532283131d1a104Nate Begeman if (VT > TLI.getPointerTy()) 93337efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 93437efe6764568a3829fee26aba532283131d1a104Nate Begeman else 93537efe6764568a3829fee26aba532283131d1a104Nate Begeman SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 93637efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 93737efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CopyTo = DAG.getCopyToReg(getRoot(), JumpTableReg, SwitchOp); 93837efe6764568a3829fee26aba532283131d1a104Nate Begeman 93937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the range check for the jump table, and branch to the default 94037efe6764568a3829fee26aba532283131d1a104Nate Begeman // block for the switch statement if the value being switched on exceeds 94137efe6764568a3829fee26aba532283131d1a104Nate Begeman // the largest case in the switch. 94237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultTy(), SUB, 94337efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getConstant(Last-First,VT), ISD::SETUGT); 94437efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.setRoot(DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 94537efe6764568a3829fee26aba532283131d1a104Nate Begeman DAG.getBasicBlock(Default))); 94637efe6764568a3829fee26aba532283131d1a104Nate Begeman 947f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Build a vector of destination BBs, corresponding to each target 948f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // of the jump table. If the value of the jump table slot corresponds to 949f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // a case statement, push the case's BB onto the vector, otherwise, push 950f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // the default BB. 95137efe6764568a3829fee26aba532283131d1a104Nate Begeman std::set<MachineBasicBlock*> UniqueBBs; 95237efe6764568a3829fee26aba532283131d1a104Nate Begeman std::vector<MachineBasicBlock*> DestBBs; 953f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman uint64_t TEI = First; 954f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (CaseItr ii = Cases.begin(), ee = Cases.end(); ii != ee; ++TEI) { 955f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (cast<ConstantIntegral>(ii->first)->getRawValue() == TEI) { 956f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(ii->second); 957f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(ii->second); 958f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ++ii; 959f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } else { 960f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman DestBBs.push_back(Default); 961f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman UniqueBBs.insert(Default); 962f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 96337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 964f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 965f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Update successor info 966f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman for (std::set<MachineBasicBlock*>::iterator ii = UniqueBBs.begin(), 967f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman ee = UniqueBBs.end(); ii != ee; ++ii) 968f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman JumpTableBB->addSuccessor(*ii); 969f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman 970f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // Create a jump table index for this jump table, or return an existing 971f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman // one. 97237efe6764568a3829fee26aba532283131d1a104Nate Begeman unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 97337efe6764568a3829fee26aba532283131d1a104Nate Begeman 97437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the jump table information so that we can codegen it as a second 97537efe6764568a3829fee26aba532283131d1a104Nate Begeman // MachineBasicBlock 97637efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.Reg = JumpTableReg; 97737efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.JTI = JTI; 97837efe6764568a3829fee26aba532283131d1a104Nate Begeman JT.MBB = JumpTableBB; 9799453eea49bca1c3904047db495855c93e001d1cdNate Begeman JT.Default = Default; 98037efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 98137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 98237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 983f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 984f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Push the initial CaseRec onto the worklist 985f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<CaseRec> CaseVec; 986f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 987f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 988f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman while (!CaseVec.empty()) { 989f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Grab a record representing a case range to process off the worklist 990f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec CR = CaseVec.back(); 991f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.pop_back(); 992f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 993f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Size is the number of Cases represented by this range. If Size is 1, 994f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // then we are processing a leaf of the binary search tree. Otherwise, 995f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // we need to pick a pivot, and push left and right ranges onto the 996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // worklist. 997f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman unsigned Size = CR.Range.second - CR.Range.first; 998f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 999f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (Size == 1) { 1000f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1001f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the Case's target mbb if the value being switched on SV is equal 1002f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // to C. Otherwise, branch to default. 1003f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = CR.Range.first->first; 1004f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *Target = CR.Range.first->second; 1005f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(ISD::SETEQ, SV, C, Target, Default, 1006f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CR.CaseBB); 1007f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the MBB representing the leaf node is the current MBB, then just 1008f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // call visitSwitchCase to emit the code into the current block. 1009f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, push the CaseBlock onto the vector to be later processed 1010f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // by SDISel, and insert the node's MBB before the next MBB. 1011f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1012f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1013f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1014f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1015f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1016f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1017f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1018f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // split case range at pivot 1019f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseItr Pivot = CR.Range.first + (Size / 2); 1020f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange LHSR(CR.Range.first, Pivot); 1021f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange RHSR(Pivot, CR.Range.second); 1022f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *C = Pivot->first; 1023f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *RHSBB = 0, *LHSBB = 0; 1024f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // We know that we branch to the LHS if the Value being switched on is 1025f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // less than the Pivot value, C. We use this to optimize our binary 1026f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // tree a bit, by recognizing that if SV is greater than or equal to the 1027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // LHS's Case Value, and that Case Value is exactly one less than the 1028f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Pivot's Value, then we can branch directly to the LHS's Target, 1029f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // rather than creating a leaf node for it. 1030f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((LHSR.second - LHSR.first) == 1 && 1031f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSR.first->first == CR.GE && 1032f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(C)->getRawValue() == 1033f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.GE)->getRawValue() + 1ULL)) { 1034f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = LHSR.first->second; 1035f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1036f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman LHSBB = new MachineBasicBlock(LLVMBB); 1037f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(LHSBB,C,CR.GE,LHSR)); 1038f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1039f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Similar to the optimization above, if the Value being switched on is 1040f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // known to be less than the Constant CR.LT, and the current Case Value 1041f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // is CR.LT - 1, then we can branch directly to the target block for 1042f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the current Case Value, rather than emitting a RHS leaf node for it. 1043f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1044f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman cast<ConstantIntegral>(RHSR.first->first)->getRawValue() == 1045f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman (cast<ConstantIntegral>(CR.LT)->getRawValue() - 1ULL)) { 1046f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = RHSR.first->second; 1047f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } else { 1048f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman RHSBB = new MachineBasicBlock(LLVMBB); 1049f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseVec.push_back(CaseRec(RHSBB,CR.LT,C,RHSR)); 1050f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1051f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Create a CaseBlock record representing a conditional branch to 1052f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the LHS node if the value being switched on SV is less than C. 1053f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Otherwise, branch to LHS. 1054f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman ISD::CondCode CC = C->getType()->isSigned() ? ISD::SETLT : ISD::SETULT; 1055f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGISel::CaseBlock CB(CC, SV, C, LHSBB, RHSBB, CR.CaseBB); 1056f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (CR.CaseBB == CurMBB) 1057f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman visitSwitchCase(CB); 1058f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else { 1059f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.push_back(CB); 1060f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurMF->getBasicBlockList().insert(BBI, CR.CaseBB); 1061f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1062f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1063f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1064f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1065f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1066b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 1067b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 106801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (I.getType()->isFloatingPoint()) { 106901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 107001b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (CFP->isExactlyValue(-0.0)) { 107101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 107201b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 107301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 107401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 107501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 10765fbb5d2459a5410590f285250faa604576308a93Nate Begeman visitBinary(I, ISD::SUB, ISD::FSUB, ISD::VSUB); 1077b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 1078b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 10795fbb5d2459a5410590f285250faa604576308a93Nate Begemanvoid SelectionDAGLowering::visitBinary(User &I, unsigned IntOp, unsigned FPOp, 10805fbb5d2459a5410590f285250faa604576308a93Nate Begeman unsigned VecOp) { 10815fbb5d2459a5410590f285250faa604576308a93Nate Begeman const Type *Ty = I.getType(); 10821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 10831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 10842c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1085b67eb9131c5c04d2e55c6b587fde954619feceafChris Lattner if (Ty->isIntegral()) { 10865fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(IntOp, Op1.getValueType(), Op1, Op2)); 10875fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else if (Ty->isFloatingPoint()) { 10885fbb5d2459a5410590f285250faa604576308a93Nate Begeman setValue(&I, DAG.getNode(FPOp, Op1.getValueType(), Op1, Op2)); 10895fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 10905fbb5d2459a5410590f285250faa604576308a93Nate Begeman const PackedType *PTy = cast<PackedType>(Ty); 1091c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Num = DAG.getConstant(PTy->getNumElements(), MVT::i32); 1092c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand Typ = DAG.getValueType(TLI.getValueType(PTy->getElementType())); 1093c7029805ef35ce9805931067b841e6af11db382eChris Lattner setValue(&I, DAG.getNode(VecOp, MVT::Vector, Op1, Op2, Num, Typ)); 10945fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1095e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman} 10962c49f2795514a7c56b680ba0310d7eb0a8a43289Chris Lattner 1097e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 1098e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 1099e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 1100e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 1101e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 1102e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 11031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 11041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSetCC(User &I,ISD::CondCode SignedOpcode, 1107f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode UnsignedOpcode, 1108f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng ISD::CondCode FPOpcode) { 11091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 11101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 11111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ISD::CondCode Opcode = SignedOpcode; 111280235d508e5f7a9603ef43ba6625984173ff0323Evan Cheng if (!FiniteOnlyFPMath() && I.getOperand(0)->getType()->isFloatingPoint()) 1113f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng Opcode = FPOpcode; 1114f6f9581983c85f8b4d2775b22870c1a4516fabdfEvan Cheng else if (I.getOperand(0)->getType()->isUnsigned()) 11151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Opcode = UnsignedOpcode; 11167cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 11171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 11201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 11211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 11221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 1123b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner if (!isa<PackedType>(I.getType())) { 1124b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 1125b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner TrueVal, FalseVal)); 1126b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } else { 1127b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner setValue(&I, DAG.getNode(ISD::VSELECT, MVT::Vector, Cond, TrueVal, FalseVal, 1128b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-2), 1129b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner *(TrueVal.Val->op_end()-1))); 1130b22e35a3c3bec07f5559c1476b3143e0d6d64269Chris Lattner } 11311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCast(User &I) { 11341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 1135e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 113628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 11371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1138e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner if (DestVT == MVT::Vector) { 1139e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast to a vector from something else. This is always a bit 1140e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1141e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 1142e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 1143e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N, 1144e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getConstant(DestTy->getNumElements(),MVT::i32), 1145e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner DAG.getValueType(EltVT))); 1146e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (SrcVT == DestVT) { 11471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); // noop cast. 114828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (DestVT == MVT::i1) { 1149ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner // Cast to bool is a comparison against zero, not truncation to zero. 115028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand Zero = isInteger(SrcVT) ? DAG.getConstant(0, N.getValueType()) : 1151ef311aa7cf26ae0cbb6e784d767801b9058dd24bChris Lattner DAG.getConstantFP(0.0, N.getValueType()); 11527cf7e3f33f25544d08492d47cc8a1cbba25dc8d7Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1, N, Zero, ISD::SETNE)); 115328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isInteger(SrcVT)) { 115428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isInteger(DestVT)) { // Int -> Int cast 115528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Truncating cast? 115628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 1157ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else if (I.getOperand(0)->getType()->isSigned()) 115828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 1159ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 116028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 11617e358908b885f50fb9258b7d10509bad20ca4c3bChris Lattner } else if (isFloatingPoint(DestVT)) { // Int -> FP cast 1162ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getOperand(0)->getType()->isSigned()) 116328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 1164ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 116528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 1166e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1167e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1168ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 116928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else if (isFloatingPoint(SrcVT)) { 117028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isFloatingPoint(DestVT)) { // FP -> FP cast 117128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (DestVT < SrcVT) // Rounding cast? 117228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N)); 1173ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 117428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 1175e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else if (isInteger(DestVT)) { // FP -> Int cast. 1176ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner if (I.getType()->isSigned()) 117728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 1178ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner else 117928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 118028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner } else { 1181e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(0 && "Unknown cast!"); 1182ae0aacb8331e1227abea6601e531a10d0e65fdcaChris Lattner } 1183e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner } else { 1184e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(SrcVT == MVT::Vector && "Unknown cast!"); 1185e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner assert(DestVT != MVT::Vector && "Casts to vector already handled!"); 1186e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // This is a cast from a vector to something else. This is always a bit 1187e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner // convert. Get information about the input vector. 1188e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner setValue(&I, DAG.getNode(ISD::VBIT_CONVERT, DestVT, N)); 11891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 11901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11922bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 1193c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1194c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 1195c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1196c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 1197c7029805ef35ce9805931067b841e6af11db382eChris Lattner 11982332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Num = *(InVec.Val->op_end()-2); 11992332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 12002332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner setValue(&I, DAG.getNode(ISD::VINSERT_VECTOR_ELT, MVT::Vector, 12012332b9f16fe17d1886566729b2241b8cd90f9916Chris Lattner InVec, InVal, InIdx, Num, Typ)); 1202c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 1203c7029805ef35ce9805931067b841e6af11db382eChris Lattner 12042bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 1205384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 1206384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 1207384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 1208384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand Typ = *(InVec.Val->op_end()-1); 1209384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner setValue(&I, DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, 1210384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 1211384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 1212c7029805ef35ce9805931067b841e6af11db382eChris Lattner 12133e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 12143e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 12153e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 12163e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 12173e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12183e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Num = *(V1.Val->op_end()-2); 12193e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Typ = *(V2.Val->op_end()-1); 12203e104b11168da4692b69cc6b236c1da22adff959Chris Lattner setValue(&I, DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 12213e104b11168da4692b69cc6b236c1da22adff959Chris Lattner V1, V2, Mask, Num, Typ)); 12223e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 12233e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12243e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 12251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 12261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 12271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 12281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 12301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 12311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 1232c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 12331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 12341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 12351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 1236a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t Offset = TD->getStructLayout(StTy)->MemberOffsets[Field]; 12371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 1238dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman getIntPtrConstant(Offset)); 12391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 12411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 12421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 12437c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12447c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 12457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 12467c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (CI->getRawValue() == 0) continue; 12477c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12487c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner uint64_t Offs; 12497c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 1250a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 12517c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 1252a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Offs = TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 12537c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, getIntPtrConstant(Offs)); 12547c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12557c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 12567c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12577c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 1258a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 12597c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 12607c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12617c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 12627c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 12637c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 12647c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (Idx->getType()->isSigned()) 12657c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 12667c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner else 12677c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::ZERO_EXTEND, N.getValueType(), IdxN); 12687c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 12697c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 12707c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12717c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 12727c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 12737c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 12747c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 12757c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 12766b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 12771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12787c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 12791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12807c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 12817c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand Scale = getIntPtrConstant(ElementSize); 12827c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 12837c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 12841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 12871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 12881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 12901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 12911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 12921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 12931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 12941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 12951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 1296a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty); 1297a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson unsigned Align = std::max((unsigned)TLI.getTargetData()->getTypeAlignment(Ty), 1298ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman I.getAlignment()); 12991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 130168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 130268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 130368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 130468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 130568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 13061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 130768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 13081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(TySize)); 13091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle alignment. If the requested alignment is less than or equal to the 13111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment, ignore it and round the size of the allocation up to the 13121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // stack alignment size. If the size is greater than the stack alignment, we 13131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // note this in the DYNAMIC_STACKALLOC node. 13141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 13151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 13161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Align <= StackAlign) { 13171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 13181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Add SA-1 to the size. 13191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 13201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(StackAlign-1)); 13211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Mask out the low bits for alignment purposes. 13221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 13231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner getIntPtrConstant(~(uint64_t)(StackAlign-1))); 13241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 13251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1326adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<MVT::ValueType> VTs; 1327adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(AllocSize.getValueType()); 1328adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner VTs.push_back(MVT::Other); 1329adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner std::vector<SDOperand> Ops; 1330adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getRoot()); 1331adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(AllocSize); 1332adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner Ops.push_back(getIntPtrConstant(Align)); 1333adf6c2a0cb638e8b211200b57b927d16f6e1cfc4Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, Ops); 13341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DAG.setRoot(setValue(&I, DSA).getValue(1)); 13351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 13371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 13381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 13391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 13421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 1343edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1344d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 1345d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 1346d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 1347d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 1348d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 1349d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 1350d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 135128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 135228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner setValue(&I, getLoadFrom(I.getType(), Ptr, DAG.getSrcValue(I.getOperand(0)), 135328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner Root, I.isVolatile())); 135428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 135528b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 135628b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 135728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand SrcValue, SDOperand Root, 135828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner bool isVolatile) { 13595fbb5d2459a5410590f285250faa604576308a93Nate Begeman SDOperand L; 13608cfa57b1b4eade4e0101195b2f94ab288cd03563Nate Begeman if (const PackedType *PTy = dyn_cast<PackedType>(Ty)) { 13614ef3b817fee7ea5be7219e00ab8e15976bfe279fNate Begeman MVT::ValueType PVT = TLI.getValueType(PTy->getElementType()); 1362c7029805ef35ce9805931067b841e6af11db382eChris Lattner L = DAG.getVecLoad(PTy->getNumElements(), PVT, Root, Ptr, SrcValue); 13635fbb5d2459a5410590f285250faa604576308a93Nate Begeman } else { 136428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner L = DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SrcValue); 13655fbb5d2459a5410590f285250faa604576308a93Nate Begeman } 1366d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 136728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 1368d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 1369d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 1370d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 137128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 137228b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 13731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 13771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 13781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 13791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 1380369e6db9b6033bb60519b0ad84afeacc9ec9b416Chris Lattner DAG.setRoot(DAG.getNode(ISD::STORE, MVT::Other, getRoot(), Src, Ptr, 138106ef88472f7bac3512e224974e87a0a456471b82Andrew Lenharth DAG.getSrcValue(I.getOperand(1)))); 13821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13840eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// IntrinsicCannotAccessMemory - Return true if the specified intrinsic cannot 13850eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// access memory and has no other side effects at all. 13860eade319cdb72e24c11d068728a98083737c6435Chris Lattnerstatic bool IntrinsicCannotAccessMemory(unsigned IntrinsicID) { 13870eade319cdb72e24c11d068728a98083737c6435Chris Lattner#define GET_NO_MEMORY_INTRINSICS 13880eade319cdb72e24c11d068728a98083737c6435Chris Lattner#include "llvm/Intrinsics.gen" 13890eade319cdb72e24c11d068728a98083737c6435Chris Lattner#undef GET_NO_MEMORY_INTRINSICS 13900eade319cdb72e24c11d068728a98083737c6435Chris Lattner return false; 13910eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 13920eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1393e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// IntrinsicOnlyReadsMemory - Return true if the specified intrinsic doesn't 1394e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner// have any side-effects or if it only reads memory. 1395e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattnerstatic bool IntrinsicOnlyReadsMemory(unsigned IntrinsicID) { 1396e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#define GET_SIDE_EFFECT_INFO 1397e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#include "llvm/Intrinsics.gen" 1398e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner#undef GET_SIDE_EFFECT_INFO 1399e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner return false; 1400e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner} 1401e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner 14020eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 14030eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 14040eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 14050eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 14067255a545613f9e713779ca81f55711c0863d9cc9Chris Lattner bool HasChain = !IntrinsicCannotAccessMemory(Intrinsic); 1407e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner bool OnlyLoad = HasChain && IntrinsicOnlyReadsMemory(Intrinsic); 14080eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14090eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 14100eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<SDOperand> Ops; 1411e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 1412e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 1413e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 1414e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 1415e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 1416e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 1417e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 1418e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14190eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14200eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 14210eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 14220eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14230eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 14240eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 14250eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 14260eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14270eade319cdb72e24c11d068728a98083737c6435Chris Lattner // If this is a vector type, force it to the right packed type. 14280eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (Op.getValueType() == MVT::Vector) { 14290eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *OpTy = cast<PackedType>(I.getOperand(i)->getType()); 14300eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(OpTy->getElementType()); 14310eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14320eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VVT = MVT::getVectorType(EltVT, OpTy->getNumElements()); 14330eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VVT != MVT::Other && "Intrinsic uses a non-legal type?"); 14340eade319cdb72e24c11d068728a98083737c6435Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, VVT, Op); 14350eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14360eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14370eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 14380eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 14390eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 14400eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14410eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14420eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 14430eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14440eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 14450eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (VT == MVT::Vector) { 14460eade319cdb72e24c11d068728a98083737c6435Chris Lattner const PackedType *DestTy = cast<PackedType>(I.getType()); 14470eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 14480eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14490eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 14500eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 14510eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14520eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14530eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 14540eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 14550eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14560eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 14570eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 14580eade319cdb72e24c11d068728a98083737c6435Chris Lattner 14590eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 146048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 146148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 146248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTs, Ops); 146348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 146448b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTs, Ops); 146548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 146648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTs, Ops); 146748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 1468e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 1469e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 1470e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 1471e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 1472e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 1473e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 1474e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 14750eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 14760eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (const PackedType *PTy = dyn_cast<PackedType>(I.getType())) { 14770eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EVT = TLI.getValueType(PTy->getElementType()); 14780eade319cdb72e24c11d068728a98083737c6435Chris Lattner Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 14790eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getConstant(PTy->getNumElements(), MVT::i32), 14800eade319cdb72e24c11d068728a98083737c6435Chris Lattner DAG.getValueType(EVT)); 14810eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14820eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 14830eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 14840eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 14850eade319cdb72e24c11d068728a98083737c6435Chris Lattner 1486c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 1487c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 1488c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 1489c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 1490c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 1491c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 14920eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 14930eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 14940eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 14950eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 1496c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 1497c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 1498c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 1499c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::returnaddress: visitFrameReturnAddress(I, false); return 0; 1500c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::frameaddress: visitFrameReturnAddress(I, true); return 0; 1501c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 1502c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_setjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1503c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 1504c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 1505c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return "_longjmp"+!TLI.usesUnderscoreSetJmpLongJmp(); 1506c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 150703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 150803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i64: 150903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMCPY); 151003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 151103dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 151203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i64: 151303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMSET); 151403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 151503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 151603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i64: 151703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner visitMemIntrinsic(I, ISD::MEMMOVE); 151803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 1519c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 152086cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 1521ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 152243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 1523fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && SPI.getContext() && DebugInfo->Verify(SPI.getContext())) { 1524ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey std::vector<SDOperand> Ops; 152536ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 1526ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(getRoot()); 152743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getLineValue())); 152843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getValue(SPI.getColumnValue())); 1529ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 153043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfoDesc *DD = DebugInfo->getDescFor(SPI.getContext()); 1531ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 153243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 153343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1534ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getFileName())); 1535ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey Ops.push_back(DAG.getString(CompileUnit->getDirectory())); 1536ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 153743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops)); 153886cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 153943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1540b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 154136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 154243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 154343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 154443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 1545fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && RSI.getContext() && DebugInfo->Verify(RSI.getContext())) { 154643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 154743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 154843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(RSI.getContext()); 154943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 155143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 155243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 155343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 155443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 155543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1556b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 155743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 155843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 155943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 156043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 1561fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && REI.getContext() && DebugInfo->Verify(REI.getContext())) { 156243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 156343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionEnd(REI.getContext()); 156543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 156743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 156843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 156943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 157043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 157143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1572b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 157343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 157443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 157543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 157643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 1577fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey if (DebugInfo && FSI.getSubprogram() && 1578fbcf23c3c12449c264f1448a2eee524be0b799f7Jim Laskey DebugInfo->Verify(FSI.getSubprogram())) { 157943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 158043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 158143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey unsigned LabelID = DebugInfo->RecordRegionStart(FSI.getSubprogram()); 158243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 158343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(getRoot()); 158443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey Ops.push_back(DAG.getConstant(LabelID, MVT::i32)); 158543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 158643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DAG.setRoot(DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops)); 158743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 158843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 1589b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 159043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 159143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 159243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); 159343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 1594bf7637d59028a5d9911769810f537c499e23bb8eJim Laskey if (DebugInfo && DI.getVariable() && DebugInfo->Verify(DI.getVariable())) { 159543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey std::vector<SDOperand> Ops; 159643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 15970892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey SDOperand AddressOp = getValue(DI.getAddress()); 15980892cee81fa8c1ea6a0901b268fe9ad2b8fa733aJim Laskey if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(AddressOp)) { 159943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DebugInfo->RecordVariable(DI.getVariable(), FI->getIndex()); 160043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 160143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 160243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 160343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 160443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 1605c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16060b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f32: 16070b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::isunordered_f64: 1608c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getSetCC(MVT::i1,getValue(I.getOperand(1)), 1609c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(2)), ISD::SETUO)); 1610c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1611c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16120b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f32: 16130b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::sqrt_f64: 1614c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 1615c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1616c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1617c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1618c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 1619c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1620c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 1621c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1622c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 16238b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 16248b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<MVT::ValueType> VTs; 16258b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::i64); 16268b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth VTs.push_back(MVT::Other); 16278b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth std::vector<SDOperand> Ops; 16288b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth Ops.push_back(getRoot()); 16298b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, VTs, Ops); 16308b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 16318b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 163251b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 16338b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 1634d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i16: 1635d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i32: 1636d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman case Intrinsic::bswap_i64: 1637d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 1638d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 1639d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 1640d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 16410b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i8: 16420b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i16: 16430b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i32: 16440b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::cttz_i64: 1645c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTTZ, 1646c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1647c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1648c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16490b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i8: 16500b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i16: 16510b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i32: 16520b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctlz_i64: 1653c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTLZ, 1654c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1655c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1656c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 16570b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i8: 16580b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i16: 16590b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i32: 16600b118206bf3411722707f2e5cab8fd2eedcd50d6Reid Spencer case Intrinsic::ctpop_i64: 1661c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::CTPOP, 1662c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 1663c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 1664c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 1665140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 1666140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<MVT::ValueType> VTs; 1667140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(TLI.getPointerTy()); 1668140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner VTs.push_back(MVT::Other); 1669140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner std::vector<SDOperand> Ops; 1670140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner Ops.push_back(getRoot()); 1671140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, VTs, Ops); 1672140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 1673140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 1674140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 1675140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 167639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 167739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 167839a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 1679140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 168039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 1681ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner case Intrinsic::prefetch: 1682ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner // FIXME: Currently discarding prefetches. 1683ac22c83e6853c759a10eb7310b019b22e1d42d16Chris Lattner return 0; 1684c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1685c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 1686c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 1687c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 16881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 168964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 1690c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 1691c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (F->isExternal()) 1692c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 1693c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 1694c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 1695c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 1696c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else { // Not an LLVM intrinsic. 1697c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const std::string &Name = F->getName(); 1698a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (Name[0] == 'c' && (Name == "copysign" || Name == "copysignf")) { 1699a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 1700a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1701a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(1)->getType() && 1702a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner I.getType() == I.getOperand(2)->getType()) { 1703a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand LHS = getValue(I.getOperand(1)); 1704a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner SDOperand RHS = getValue(I.getOperand(2)); 1705a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 1706a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner LHS, RHS)); 1707a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner return; 1708a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } 1709a09f848c11c9db3c2614e0275a3256310ac26653Chris Lattner } else if (Name[0] == 'f' && (Name == "fabs" || Name == "fabsf")) { 1710c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1711c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 1712c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1713c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1714c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 1715c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner return; 1716c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1717c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 's' && (Name == "sin" || Name == "sinf")) { 1718f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1719f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 172006a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1721c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1722f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 1723f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1724f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1725c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } else if (Name[0] == 'c' && (Name == "cos" || Name == "cosf")) { 1726f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 1727f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 172806a248c9b398049d41cf6dd1a3f9eecc75603401Chris Lattner I.getType() == I.getOperand(1)->getType()) { 1729c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 1730f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 1731f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner return; 1732f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1733f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 1734c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 1735ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 1736ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner visitInlineAsm(I); 1737ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 1738c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 1739edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 174064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 174164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 174264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 174364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 174464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 17451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 1746c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner Args.reserve(I.getNumOperands()); 17471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 17481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Arg = I.getOperand(i); 17491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand ArgNode = getValue(Arg); 17501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(ArgNode, Arg->getType())); 17511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1752edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 17538e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const PointerType *PT = cast<PointerType>(I.getCalledValue()->getType()); 17548e21e71b248365c69c0f666518c378b5819ce6fbNate Begeman const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 1755edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 1756cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 17579092fa310c8b2b1645b0d448c4c34b1e8ddc131dChris Lattner TLI.LowerCallTo(getRoot(), I.getType(), FTy->isVarArg(), I.getCallingConv(), 1758adf6a965a321372c640845407195594835921eb4Chris Lattner I.isTailCall(), Callee, Args, DAG); 17591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getType() != Type::VoidTy) 1760cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); 1761cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 17621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1764864635ad7b3046d3042311423071152c613961deChris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 17659f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag)const{ 1766864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Val = DAG.getCopyFromReg(Chain, Regs[0], RegVT, Flag); 1767864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1768864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 1769864635ad7b3046d3042311423071152c613961deChris Lattner 1770864635ad7b3046d3042311423071152c613961deChris Lattner // If the result was expanded, copy from the top part. 1771864635ad7b3046d3042311423071152c613961deChris Lattner if (Regs.size() > 1) { 1772864635ad7b3046d3042311423071152c613961deChris Lattner assert(Regs.size() == 2 && 1773864635ad7b3046d3042311423071152c613961deChris Lattner "Cannot expand to more than 2 elts yet!"); 1774864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand Hi = DAG.getCopyFromReg(Chain, Regs[1], RegVT, Flag); 1775864635ad7b3046d3042311423071152c613961deChris Lattner Chain = Val.getValue(1); 1776864635ad7b3046d3042311423071152c613961deChris Lattner Flag = Val.getValue(2); 17779f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (DAG.getTargetLoweringInfo().isLittleEndian()) 17789f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Val, Hi); 17799f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner else 17809f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner return DAG.getNode(ISD::BUILD_PAIR, ValueVT, Hi, Val); 1781864635ad7b3046d3042311423071152c613961deChris Lattner } 1782864635ad7b3046d3042311423071152c613961deChris Lattner 1783cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Otherwise, if the return value was promoted or extended, truncate it to the 1784864635ad7b3046d3042311423071152c613961deChris Lattner // appropriate type. 1785864635ad7b3046d3042311423071152c613961deChris Lattner if (RegVT == ValueVT) 1786864635ad7b3046d3042311423071152c613961deChris Lattner return Val; 1787864635ad7b3046d3042311423071152c613961deChris Lattner 1788cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (MVT::isInteger(RegVT)) { 1789cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner if (ValueVT < RegVT) 1790cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1791cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner else 1792cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 1793cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } else { 1794864635ad7b3046d3042311423071152c613961deChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val); 1795cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner } 1796864635ad7b3046d3042311423071152c613961deChris Lattner} 1797864635ad7b3046d3042311423071152c613961deChris Lattner 1798c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 1799c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// specified value into the registers specified by this object. This uses 1800c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// Chain/Flag as the input and updates them for the output Chain/Flag. 1801c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 18029f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner SDOperand &Chain, SDOperand &Flag) const { 1803c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (Regs.size() == 1) { 1804c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // If there is a single register and the types differ, this must be 1805c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // a promotion. 1806c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (RegVT != ValueVT) { 1807c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (MVT::isInteger(RegVT)) 1808c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::ANY_EXTEND, RegVT, Val); 1809c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner else 1810c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Val = DAG.getNode(ISD::FP_EXTEND, RegVT, Val); 1811c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1812c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Chain = DAG.getCopyToReg(Chain, Regs[0], Val, Flag); 1813c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1814c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } else { 18159f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<unsigned> R(Regs); 18169f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner if (!DAG.getTargetLoweringInfo().isLittleEndian()) 18179f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::reverse(R.begin(), R.end()); 18189f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner 18199f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner for (unsigned i = 0, e = R.size(); i != e; ++i) { 1820c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner SDOperand Part = DAG.getNode(ISD::EXTRACT_ELEMENT, RegVT, Val, 1821c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner DAG.getConstant(i, MVT::i32)); 18229f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner Chain = DAG.getCopyToReg(Chain, R[i], Part, Flag); 1823c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Flag = Chain.getValue(1); 1824c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1825c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 1826c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1827864635ad7b3046d3042311423071152c613961deChris Lattner 1828c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 1829c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 1830c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 1831c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 18329f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 1833c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getConstant(Code | (Regs.size() << 3), MVT::i32)); 1834c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = Regs.size(); i != e; ++i) 1835c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Ops.push_back(DAG.getRegister(Regs[i], RegVT)); 1836c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 1837864635ad7b3046d3042311423071152c613961deChris Lattner 1838864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 1839864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 1840864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 1841864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 18429b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 18439b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetLowering &TLI, const MRegisterInfo *MRI) { 1844f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 1845f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 18469b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (MRegisterInfo::regclass_iterator RCI = MRI->regclass_begin(), 18479b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = MRI->regclass_end(); RCI != E; ++RCI) { 1848f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 1849f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 18509b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 18519b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 18529b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 18539b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 18549b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 18559b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 1856f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 1857f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 1858f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 1859f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 1860f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 1861f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 1862f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1863f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 18649b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18659b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 18669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1867f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 18689b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 1869864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 1870864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 1871864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 1872864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 18739b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 18749b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 1875f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 1876f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 1877f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 1878f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 1879f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 1880f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 1881f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 1882864635ad7b3046d3042311423071152c613961deChris Lattner } 1883f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 1884864635ad7b3046d3042311423071152c613961deChris Lattner} 1885864635ad7b3046d3042311423071152c613961deChris Lattner 1886864635ad7b3046d3042311423071152c613961deChris LattnerRegsForValue SelectionDAGLowering:: 1887864635ad7b3046d3042311423071152c613961deChris LattnerGetRegistersForValue(const std::string &ConstrCode, 1888864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType VT, bool isOutReg, bool isInReg, 1889864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 18904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 1891864635ad7b3046d3042311423071152c613961deChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 1892864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegForInlineAsmConstraint(ConstrCode, VT); 1893864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> Regs; 1894864635ad7b3046d3042311423071152c613961deChris Lattner 1895864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumRegs = VT != MVT::Other ? TLI.getNumElements(VT) : 1; 1896864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 1897864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType ValueVT = VT; 1898864635ad7b3046d3042311423071152c613961deChris Lattner 1899864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 1900864635ad7b3046d3042311423071152c613961deChris Lattner if (VT == MVT::Other) 1901864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 1902cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 1903cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 1904cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 1905cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 1906cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 1907864635ad7b3046d3042311423071152c613961deChris Lattner 1908864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 1909864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 1910864635ad7b3046d3042311423071152c613961deChris Lattner 1911864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 1912864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 1913864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 1914864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 1915864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 1916864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 1917864635ad7b3046d3042311423071152c613961deChris Lattner 1918864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 1919864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 1920864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 1921864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 1922864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 1923864635ad7b3046d3042311423071152c613961deChris Lattner } 1924864635ad7b3046d3042311423071152c613961deChris Lattner } 1925864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, RegVT, ValueVT); 1926864635ad7b3046d3042311423071152c613961deChris Lattner } 1927864635ad7b3046d3042311423071152c613961deChris Lattner 1928864635ad7b3046d3042311423071152c613961deChris Lattner // This is a reference to a register class. Allocate NumRegs consecutive, 1929864635ad7b3046d3042311423071152c613961deChris Lattner // available, registers from the class. 1930864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<unsigned> RegClassRegs = 1931864635ad7b3046d3042311423071152c613961deChris Lattner TLI.getRegClassForInlineAsmConstraint(ConstrCode, VT); 1932864635ad7b3046d3042311423071152c613961deChris Lattner 19334e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner const MRegisterInfo *MRI = DAG.getTarget().getRegisterInfo(); 19344e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner MachineFunction &MF = *CurMBB->getParent(); 1935864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 1936864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 1937864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 19384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 1939864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 1940864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 1941864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1942864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1943864635ad7b3046d3042311423071152c613961deChris Lattner continue; 1944864635ad7b3046d3042311423071152c613961deChris Lattner } 1945864635ad7b3046d3042311423071152c613961deChris Lattner 19464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 19474e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 19489b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, MRI); 1949864635ad7b3046d3042311423071152c613961deChris Lattner if (!RC) { 1950864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 1951864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 1952864635ad7b3046d3042311423071152c613961deChris Lattner continue; 19534e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 19544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1955864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 1956864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 1957864635ad7b3046d3042311423071152c613961deChris Lattner 1958864635ad7b3046d3042311423071152c613961deChris Lattner // If we allocated enough consecutive 1959864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 1960864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 1961864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 1962864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 1963864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) { 1964864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 1965864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(Reg); 1966864635ad7b3046d3042311423071152c613961deChris Lattner if (isOutReg) OutputRegs.insert(Reg); // Mark reg used. 1967864635ad7b3046d3042311423071152c613961deChris Lattner if (isInReg) InputRegs.insert(Reg); // Mark reg used. 1968864635ad7b3046d3042311423071152c613961deChris Lattner } 1969864635ad7b3046d3042311423071152c613961deChris Lattner 1970864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(Regs, *RC->vt_begin(), VT); 1971864635ad7b3046d3042311423071152c613961deChris Lattner } 19724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 1973864635ad7b3046d3042311423071152c613961deChris Lattner 1974864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 1975864635ad7b3046d3042311423071152c613961deChris Lattner return RegsForValue(); 19764e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 19774e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 1978864635ad7b3046d3042311423071152c613961deChris Lattner 1979ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 1980ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 1981ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattnervoid SelectionDAGLowering::visitInlineAsm(CallInst &I) { 1982ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner InlineAsm *IA = cast<InlineAsm>(I.getOperand(0)); 1983ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1984ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand AsmStr = DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 1985ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner MVT::Other); 1986ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1987ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Note, we treat inline asms both with and without side-effects as the same. 1988ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // If an inline asm doesn't have side effects and doesn't access memory, we 1989ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // could not choose to not chain it. 1990ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner bool hasSideEffects = IA->hasSideEffects(); 1991ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 19922cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::vector<InlineAsm::ConstraintInfo> Constraints = IA->ParseConstraints(); 19931efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner std::vector<MVT::ValueType> ConstraintVTs; 1994ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 1995ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// AsmNodeOperands - A list of pairs. The first element is a register, the 1996ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// second is a bitfield where bit #0 is set if it is a use and bit #1 is set 1997ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner /// if it is a def of that register. 1998ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<SDOperand> AsmNodeOperands; 1999ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 2000ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands.push_back(AsmStr); 2001ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2002ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 2003ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 2004ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 20054e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We fully assign registers here at isel time. This is not optimal, but 20064e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // should work. For register classes that correspond to LLVM classes, we 20074e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // could let the LLVM RA do its thing, but we currently don't. Do a prepass 20084e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // over the constraints, collecting fixed registers that we know we can't use. 20094e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 20101efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner unsigned OpNum = 1; 20114e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 20124e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 20134e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 20142223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 20151efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner MVT::ValueType OpVT; 20161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // Compute the value type for each operand and add it to ConstraintVTs. 20181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner switch (Constraints[i].Type) { 20191efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 20201efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner if (!Constraints[i].isIndirectOutput) { 20211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 20221efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getType()); 20231efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } else { 202422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner const Type *OpTy = I.getOperand(OpNum)->getType(); 20251efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(cast<PointerType>(OpTy)->getElementType()); 20261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20271efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20281efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20291efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20301efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = TLI.getValueType(I.getOperand(OpNum)->getType()); 20311efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum++; // Consumes a call operand. 20321efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20331efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 20341efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpVT = MVT::Other; 20351efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20361efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 20371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20381efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner ConstraintVTs.push_back(OpVT); 20391efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2040864635ad7b3046d3042311423071152c613961deChris Lattner if (TLI.getRegForInlineAsmConstraint(ConstraintCode, OpVT).first == 0) 2041864635ad7b3046d3042311423071152c613961deChris Lattner continue; // Not assigned a fixed reg. 20421efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 2043864635ad7b3046d3042311423071152c613961deChris Lattner // Build a list of regs that this operand uses. This always has a single 2044864635ad7b3046d3042311423071152c613961deChris Lattner // element for promoted/expanded operands. 2045864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = GetRegistersForValue(ConstraintCode, OpVT, 2046864635ad7b3046d3042311423071152c613961deChris Lattner false, false, 2047864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 20484e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 20494e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner switch (Constraints[i].Type) { 20504e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isOutput: 20514e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // We can't assign any other output to this register. 2052864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20534e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // If this is an early-clobber output, it cannot be assigned to the same 20544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // value as the input reg. 20552223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2056864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20574e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20581efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 20591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner // We can't assign any other input to this register. 2060864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 20624e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner case InlineAsm::isClobber: 20634e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Clobbered regs cannot be used as inputs or outputs. 2064864635ad7b3046d3042311423071152c613961deChris Lattner InputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 2065864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs.insert(Regs.Regs.begin(), Regs.Regs.end()); 20664e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner break; 20674e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20684e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 20692cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 20700f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 20710f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 2072864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 2073864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 20741efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner OpNum = 1; 20750f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 20766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = Constraints.size(); i != e; ++i) { 20772cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(Constraints[i].Codes.size() == 1 && "Only handles one code so far!"); 20782cc2f66c25d9576743026688fdae5ed402726532Chris Lattner std::string &ConstraintCode = Constraints[i].Codes[0]; 20791efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 20802cc2f66c25d9576743026688fdae5ed402726532Chris Lattner switch (Constraints[i].Type) { 20812cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 208222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 208322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 208422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 208522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 208622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (CTy == TargetLowering::C_Memory) { 208722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Memory output. 208822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 208922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Check that the operand (the address to store to) isn't a float. 209122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 209222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 209322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (!Constraints[i].isIndirectOutput) 209522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(0 && "MATCH FAIL!"); 209622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner OpNum++; // Consumes a call operand. 209822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 209922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Extend/truncate to the right pointer type if needed. 210022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 210122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner if (InOperandVal.getValueType() < PtrType) 210222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 210322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner else if (InOperandVal.getValueType() > PtrType) 210422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 210522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 210622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 210722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 210822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 210922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner AsmNodeOperands.push_back(InOperandVal); 211022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 211122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 211222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 211322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Otherwise, this is a register output. 211422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 211522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 2116864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an early-clobber output, or if there is an input 2117864635ad7b3046d3042311423071152c613961deChris Lattner // constraint that matches this, we need to reserve the input register 2118864635ad7b3046d3042311423071152c613961deChris Lattner // so no other inputs allocate to it. 2119864635ad7b3046d3042311423071152c613961deChris Lattner bool UsesInputRegister = false; 2120864635ad7b3046d3042311423071152c613961deChris Lattner if (Constraints[i].isEarlyClobber || Constraints[i].hasMatchingInput) 2121864635ad7b3046d3042311423071152c613961deChris Lattner UsesInputRegister = true; 21222223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner 2123864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 2124864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 2125864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue Regs = 2126864635ad7b3046d3042311423071152c613961deChris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 2127864635ad7b3046d3042311423071152c613961deChris Lattner true, UsesInputRegister, 2128864635ad7b3046d3042311423071152c613961deChris Lattner OutputRegs, InputRegs); 2129864635ad7b3046d3042311423071152c613961deChris Lattner assert(!Regs.Regs.empty() && "Couldn't allocate output reg!"); 21302cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 21312cc2f66c25d9576743026688fdae5ed402726532Chris Lattner if (!Constraints[i].isIndirectOutput) { 2132864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 21332cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 21342cc2f66c25d9576743026688fdae5ed402726532Chris Lattner assert(I.getType() != Type::VoidTy && "Bad inline asm!"); 2135864635ad7b3046d3042311423071152c613961deChris Lattner RetValRegs = Regs; 21362cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 213722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner IndirectStoresToEmit.push_back(std::make_pair(Regs, 213822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner I.getOperand(OpNum))); 21392cc2f66c25d9576743026688fdae5ed402726532Chris Lattner OpNum++; // Consumes a call operand. 21402cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 21416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 21426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 21436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 2144c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner Regs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, AsmNodeOperands); 21456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 21466656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 21476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 214822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner SDOperand InOperandVal = getValue(I.getOperand(OpNum)); 21494e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner OpNum++; // Consumes a call operand. 21503d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 21512223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner if (isdigit(ConstraintCode[0])) { // Matching constraint? 21522223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 21532223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 21542223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner unsigned OperandNo = atoi(ConstraintCode.c_str()); 21553d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 2156c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 2157c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 2158c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 2159c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 2160c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 2161c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2162c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2163c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2164c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2165c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 2166c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2167c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2168c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 2169c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 2170c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner assert((NumOps & 7) == 2 /*REGDEF*/ && 2171c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 2172c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2173c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 2174c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue MatchedRegs; 2175c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.ValueVT = InOperandVal.getValueType(); 2176c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.RegVT = AsmNodeOperands[CurOp+1].getValueType(); 2177c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 2178c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned Reg=cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 2179c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.Regs.push_back(Reg); 2180c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 2181c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 2182c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Use the produced MatchedRegs object to 2183c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag); 2184c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 218587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 218687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 218787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 218887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner TargetLowering::ConstraintType CTy = TargetLowering::C_RegisterClass; 218987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (ConstraintCode.size() == 1) // not a physreg name. 219087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner CTy = TLI.getConstraintType(ConstraintCode[0]); 21913d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 219287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (CTy == TargetLowering::C_Other) { 219387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!TLI.isOperandValidForConstraint(InOperandVal, ConstraintCode[0])) 219487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2195c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 219687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 219787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 3 /*IMM*/ | (1 << 3); 219887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 219987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 220087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 220187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } else if (CTy == TargetLowering::C_Memory) { 220287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Memory input. 220387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 220487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Check that the operand isn't a float. 220587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (!MVT::isInteger(InOperandVal.getValueType())) 220687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(0 && "MATCH FAIL!"); 2207c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 220887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Extend/truncate to the right pointer type if needed. 220987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner MVT::ValueType PtrType = TLI.getPointerTy(); 221087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner if (InOperandVal.getValueType() < PtrType) 221187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::ZERO_EXTEND, PtrType, InOperandVal); 221287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner else if (InOperandVal.getValueType() > PtrType) 221387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InOperandVal = DAG.getNode(ISD::TRUNCATE, PtrType, InOperandVal); 221487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 221587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 221687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 221787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(DAG.getConstant(ResOpType, MVT::i32)); 221887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 2219c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 22202223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 222187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 222287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(CTy == TargetLowering::C_RegisterClass && "Unknown op type!"); 222387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 222487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 222587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner RegsForValue InRegs = 222687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner GetRegistersForValue(ConstraintCode, ConstraintVTs[i], 222787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner false, true, OutputRegs, InputRegs); 222887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // FIXME: should be match fail. 222987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner assert(!InRegs.Regs.empty() && "Couldn't allocate input reg!"); 223087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 223187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.getCopyToRegs(InOperandVal, DAG, Chain, Flag); 223287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 223387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner InRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, AsmNodeOperands); 22346656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2236c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 2237c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner RegsForValue ClobberedRegs = 2238c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner GetRegistersForValue(ConstraintCode, MVT::Other, false, false, 2239c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner OutputRegs, InputRegs); 2240c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 2241c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 2242c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner if (!ClobberedRegs.Regs.empty()) 2243c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner ClobberedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, AsmNodeOperands); 22446656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 22456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2246c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 22476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2248ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2249ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 2250ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 2251ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 2252ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2253ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner std::vector<MVT::ValueType> VTs; 2254ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Other); 2255ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner VTs.push_back(MVT::Flag); 2256ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, VTs, AsmNodeOperands); 2257ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 2258ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 22606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 2261864635ad7b3046d3042311423071152c613961deChris Lattner if (!RetValRegs.Regs.empty()) 2262864635ad7b3046d3042311423071152c613961deChris Lattner setValue(&I, RetValRegs.getCopyFromRegs(DAG, Chain, Flag)); 22636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 22656656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 22666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 22676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 22686656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 2269864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 22706656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 2271864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, Flag); 2272864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 22736656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 2274ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 22766656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<SDOperand> OutChains; 22776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 22786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner OutChains.push_back(DAG.getNode(ISD::STORE, MVT::Other, Chain, 22796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner StoresToEmit[i].first, 22806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 22816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner DAG.getSrcValue(StoresToEmit[i].second))); 22826656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 22836656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 2284ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 2285ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 2286ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 2287ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 22881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 22891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 22901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 229268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 229368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 229468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 229568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 229668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 22971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 2299a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(I.getType()->getElementType()); 23001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 23011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src, getIntPtrConstant(ElementSize)); 23021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 2304a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson Args.push_back(std::make_pair(Src, TLI.getTargetData()->getIntPtrType())); 2305cf5734dddd66af9388a171b44996505ede47feedChris Lattner 2306cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2307adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), I.getType(), false, CallingConv::C, true, 2308cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("malloc", IntPtr), 2309cf5734dddd66af9388a171b44996505ede47feedChris Lattner Args, DAG); 2310cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 2311cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 23121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 23151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::vector<std::pair<SDOperand, const Type*> > Args; 23161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Args.push_back(std::make_pair(getValue(I.getOperand(0)), 2317a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson TLI.getTargetData()->getIntPtrType())); 23181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 2319cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 2320adf6a965a321372c640845407195594835921eb4Chris Lattner TLI.LowerCallTo(getRoot(), Type::VoidTy, false, CallingConv::C, true, 2321cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 2322cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 23231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2325025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// InsertAtEndOfBasicBlock - This method should be implemented by targets that 2326025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// mark instructions with the 'usesCustomDAGSchedInserter' flag. These 2327025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 2328025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 2329025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 2330025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris LattnerMachineBasicBlock *TargetLowering::InsertAtEndOfBasicBlock(MachineInstr *MI, 2331025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 2332025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner std::cerr << "If a target marks an instruction with " 2333025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "'usesCustomDAGSchedInserter', it must implement " 2334025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner "TargetLowering::InsertAtEndOfBasicBlock!\n"; 2335025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 2336025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 2337025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 2338025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 233939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 2340acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 2341acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2342acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 234339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 234439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 23451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 2346acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 2347acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 2348acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 2349acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 2350acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 23511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 2354acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 2355acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2356acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 23571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 2360acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 2361acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 2362acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 2363acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 2364acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 23651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2367fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 2368fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 2369f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 2370f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 2371fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 2372fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 2373fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 2374fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 23758c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 2376fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 2377fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 2378fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2379fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 2380fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 2381fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2382fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2383fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2384fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2385fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2386fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2387fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(VT); 2388fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2389fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: 2390fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(getTypeToTransformTo(VT)); 2391fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2392fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2393fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2394fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be broken up into small 2395fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the destination type is and how many small 2396fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it turns into. 2397fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2398fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2399fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (unsigned i = 0; i != NumVals; ++i) 2400fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(NVT); 2401fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2402fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2403fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2404fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumElems = cast<PackedType>(I->getType())->getNumElements(); 2405fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner const Type *EltTy = cast<PackedType>(I->getType())->getElementType(); 2406f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2407fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2408fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2409fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2410fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2411fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner RetVals.push_back(TVT); 2412fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2413fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2414fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2415fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2416fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2417fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2418fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 24193b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 24208c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 2421fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2422fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 2423fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, RetVals, Ops).Val; 24248c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner 24258c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner DAG.setRoot(SDOperand(Result, Result->getNumValues()-1)); 2426fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2427fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 2428fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 2429fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 2430fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; ++I) { 2431fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 2432fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2433fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner switch (getTypeAction(VT)) { 2434fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner default: assert(0 && "Unknown type action!"); 2435fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Legal: 2436fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(SDOperand(Result, i++)); 2437fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2438fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Promote: { 2439fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Op(Result, i++); 2440fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (MVT::isInteger(VT)) { 2441fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned AssertOp = I->getType()->isSigned() ? ISD::AssertSext 2442fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner : ISD::AssertZext; 2443fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(AssertOp, Op.getValueType(), Op, DAG.getValueType(VT)); 2444fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::TRUNCATE, VT, Op); 2445fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2446fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2447fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Op = DAG.getNode(ISD::FP_ROUND, VT, Op); 2448fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2449fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(Op); 2450fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2451fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2452fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner case Expand: 2453fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (VT != MVT::Vector) { 2454fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // If this is a large integer, it needs to be reassembled from small 2455fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers. Figure out what the source elt type is and how many small 2456fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // integers it is. 2457fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2458fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2459fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (NumVals == 2) { 2460fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Lo = SDOperand(Result, i++); 2461fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner SDOperand Hi = SDOperand(Result, i++); 2462fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2463fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner if (!isLittleEndian()) 2464fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::swap(Lo, Hi); 2465fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2466fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi)); 2467fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2468fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Value scalarized into many values. Unimp for now. 2469fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2470fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2471fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } else { 2472fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Otherwise, this is a vector type. We only support legal vectors 2473fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // right now. 2474020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const PackedType *PTy = cast<PackedType>(I->getType()); 2475020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng unsigned NumElems = PTy->getNumElements(); 2476020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng const Type *EltTy = PTy->getElementType(); 2477f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 2478fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Figure out if there is a Packed type corresponding to this Vector 2479fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // type. If so, convert to the packed type. 2480fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2481d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2482020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng SDOperand N = SDOperand(Result, i++); 2483020c41f21e8b6b01bc40db69e660c3c6e29b0978Evan Cheng // Handle copies from generic vectors to registers. 2484d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner N = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, N, 2485d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 2486d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 2487d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner Ops.push_back(N); 2488d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner } else { 2489fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner assert(0 && "Don't support illegal by-val vector arguments yet!"); 2490da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2491fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2492fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2493fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner break; 2494fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2495fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 2496fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 2497fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 2498fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 2499f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2500f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 2501f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 2502f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 2503f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 2504f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 2505f4ec817299a4187044a6162c2f520772b3ad69a0Chris LattnerTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, bool isVarArg, 2506f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned CallingConv, bool isTailCall, 2507f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 2508f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 2509f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<SDOperand> Ops; 2510f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 2511f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 2512f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 2513f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 2514f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 2515f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2516f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 2517f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 2518f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(Args[i].second); 2519f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Op = Args[i].first; 2520f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng bool isSigned = Args[i].second->isSigned(); 2521f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2522f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2523f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2524f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2525d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2526f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2527f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2528f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (MVT::isInteger(VT)) { 2529f6d62c2e2a53e3ebf2e25f0891e5f1a0b772b368Evan Cheng unsigned ExtOp = isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 2530f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ExtOp, getTypeToTransformTo(VT), Op); 2531f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2532f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT) && "Not int or FP?"); 2533f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, getTypeToTransformTo(VT), Op); 2534f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2535f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Op); 2536d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2537f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2538f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2539f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2540f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be broken down into small 2541f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2542f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2543f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2544f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2545f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (NumVals == 2) { 2546f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2547f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(0, getPointerTy())); 2548f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, NVT, Op, 2549f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getConstant(1, getPointerTy())); 2550f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (!isLittleEndian()) 2551f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::swap(Lo, Hi); 2552f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2553f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Lo); 2554d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2555f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Hi); 2556d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 2557f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2558f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Value scalarized into many values. Unimp for now. 2559f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Cannot expand i64 -> i16 yet!"); 2560f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2561f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2562da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 2563da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 2564da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(Args[i].second); 2565da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 2566da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 2567da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2568da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2569da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2570da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 25711b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 25721b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner // Insert a VBIT_CONVERT of the MVT::Vector type to the packed type. 25731b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, TVT, Op); 25741b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner Ops.push_back(Op); 2575d61c4820c9e39500a67bec4d6cfe521a833afdccEvan Cheng Ops.push_back(DAG.getConstant(isSigned, MVT::i32)); 25761b8daae71b0118b489cbecf2f1b8ed86b6bc8e57Chris Lattner } else { 2577da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call args yet!"); 2578da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2579da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2580f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2581f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2582f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2583f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2584f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2585f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Figure out the result value types. 2586f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner std::vector<MVT::ValueType> RetTys; 2587f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2588f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTy != Type::VoidTy) { 2589f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2590f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner switch (getTypeAction(VT)) { 2591f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner default: assert(0 && "Unknown type action!"); 2592f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Legal: 2593f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(VT); 2594f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2595f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Promote: 2596f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(getTypeToTransformTo(VT)); 2597f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner break; 2598f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner case Expand: 2599f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (VT != MVT::Vector) { 2600f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this is a large integer, it needs to be reassembled from small 2601f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers. Figure out what the source elt type is and how many small 2602f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // integers it is. 2603f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType NVT = getTypeToTransformTo(VT); 2604f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned NumVals = MVT::getSizeInBits(VT)/MVT::getSizeInBits(NVT); 2605f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0; i != NumVals; ++i) 2606f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(NVT); 2607f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2608da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Otherwise, this is a vector type. We only support legal vectors 2609da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // right now. 2610da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const PackedType *PTy = cast<PackedType>(RetTy); 2611da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = PTy->getNumElements(); 2612da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = PTy->getElementType(); 2613da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2614da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2615da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2616da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2617da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2618da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner RetTys.push_back(TVT); 2619da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 2620da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner assert(0 && "Don't support illegal by-val vector call results yet!"); 2621da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2622da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2623f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2624f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2625f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2626f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2627f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner RetTys.push_back(MVT::Other); // Always has a chain. 2628f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2629f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Finally, create the CALL node. 2630f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, RetTys, Ops); 2631f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2632f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // This returns a pair of operands. The first element is the 2633f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // return value for the function (if RetTy is not VoidTy). The second 2634f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // element is the outgoing token chain. 2635f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand ResVal; 2636f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() != 1) { 2637f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner MVT::ValueType VT = getValueType(RetTy); 2638f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (RetTys.size() == 2) { 2639f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = Res; 2640f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2641f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // If this value was promoted, truncate it down. 2642f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner if (ResVal.getValueType() != VT) { 2643da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (VT == MVT::Vector) { 2644da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBITCONVERT to convert from the packed result type to the 2645da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // MVT::Vector type. 2646da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner unsigned NumElems = cast<PackedType>(RetTy)->getNumElements(); 2647da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner const Type *EltTy = cast<PackedType>(RetTy)->getElementType(); 2648da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner 2649da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Figure out if there is a Packed type corresponding to this Vector 2650da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // type. If so, convert to the packed type. 2651da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner MVT::ValueType TVT = MVT::getVectorType(getValueType(EltTy), NumElems); 2652da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner if (TVT != MVT::Other && isTypeLegal(TVT)) { 2653da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // Insert a VBIT_CONVERT of the FORMAL_ARGUMENTS to a 2654da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner // "N x PTyElementVT" MVT::Vector type. 2655da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner ResVal = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, ResVal, 2656d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getConstant(NumElems, MVT::i32), 2657d202ca4d988b5ee3f30656a7e82443db4752dd91Chris Lattner DAG.getValueType(getValueType(EltTy))); 2658da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else { 2659da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner abort(); 2660da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } 2661da098e7d1017e9435617d4c3de58ff72ae01ca22Chris Lattner } else if (MVT::isInteger(VT)) { 2662f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner unsigned AssertOp = RetTy->isSigned() ? 2663f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ISD::AssertSext : ISD::AssertZext; 2664f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(AssertOp, ResVal.getValueType(), ResVal, 2665f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner DAG.getValueType(VT)); 2666f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::TRUNCATE, VT, ResVal); 2667f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2668f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(MVT::isFloatingPoint(VT)); 2669f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::FP_ROUND, VT, ResVal); 2670f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2671f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2672f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else if (RetTys.size() == 3) { 2673f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ResVal = DAG.getNode(ISD::BUILD_PAIR, VT, 2674f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Res.getValue(0), Res.getValue(1)); 2675f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2676f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } else { 2677f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner assert(0 && "Case not handled yet!"); 2678f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2679f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 2680f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2681f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner return std::make_pair(ResVal, Res.getValue(Res.Val->getNumValues()-1)); 2682f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 2683f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2684f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 2685f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 268639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// It is always conservatively correct for llvm.returnaddress and 268739ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner// llvm.frameaddress to return 0. 2688f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// 2689f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// FIXME: Change this to insert a FRAMEADDR/RETURNADDR node, and have that be 2690f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner// expanded to 0 if the target wants. 269139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnerstd::pair<SDOperand, SDOperand> 269239ae3622791986a0232f7e4797b633f8fa9e54d2Chris LattnerTargetLowering::LowerFrameReturnAddress(bool isFrameAddr, SDOperand Chain, 269339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth, SelectionDAG &DAG) { 269439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner return std::make_pair(DAG.getConstant(0, getPointerTy()), Chain); 26951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 269750381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 2698171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 2699171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 2700d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 2701171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 2702171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 27030aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 27040aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 27050aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 27060aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 27070aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 27080aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 27090aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 271039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitFrameReturnAddress(CallInst &I, bool isFrame) { 271139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner unsigned Depth = (unsigned)cast<ConstantUInt>(I.getOperand(1))->getValue(); 271239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner std::pair<SDOperand,SDOperand> Result = 2713a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner TLI.LowerFrameReturnAddress(isFrame, getRoot(), Depth, DAG); 271439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner setValue(&I, Result.first); 271539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner DAG.setRoot(Result.second); 271639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 27171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 271874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetValue - Vectorized representation of the memset value 27191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// operand. 27201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT, 2721a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SelectionDAG &DAG) { 27221db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType CurVT = VT; 27231db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) { 27241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng uint64_t Val = C->getValue() & 255; 27251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 27261db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 27271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Val = (Val << Shift) | Val; 27281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 27291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 27301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getConstant(Val, VT); 27321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 27331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value); 27341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Shift = 8; 27351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (CurVT != MVT::i8) { 27361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Value = 27371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::OR, VT, 27381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getNode(ISD::SHL, VT, Value, 27391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng DAG.getConstant(Shift, MVT::i8)), Value); 27401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Shift <<= 1; 27411db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng CurVT = (MVT::ValueType)((unsigned)CurVT - 1); 27421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27431db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27441db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return Value; 27451db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 274874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// getMemsetStringVal - Similar to getMemsetValue. Except this is only 274974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// used when a memcpy is turned into a memset when the source is a constant 275074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng/// string ptr. 275174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Chengstatic SDOperand getMemsetStringVal(MVT::ValueType VT, 275274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SelectionDAG &DAG, TargetLowering &TLI, 275374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string &Str, unsigned Offset) { 275474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng MVT::ValueType CurVT = VT; 275574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng uint64_t Val = 0; 275674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng unsigned MSB = getSizeInBits(VT) / 8; 275774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (TLI.isLittleEndian()) 275874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset = Offset + MSB - 1; 275974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng for (unsigned i = 0; i != MSB; ++i) { 276074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Val = (Val << 8) | Str[Offset]; 276174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Offset += TLI.isLittleEndian() ? -1 : 1; 276274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 276374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng return DAG.getConstant(Val, VT); 276474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng} 276574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 27661db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng/// getMemBasePlusOffset - Returns base and offset node for the 27671db92f947cc600dee5edb9305a4e0f1c5c872965Evan Chengstatic SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset, 27681db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SelectionDAG &DAG, TargetLowering &TLI) { 27691db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = Base.getValueType(); 27701db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT)); 27711db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 27721db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 2773c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng/// MeetsMaxMemopRequirement - Determines if the number of memory ops required 277480e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// to replace the memset / memcpy is below the threshold. It also returns the 277580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng/// types of the sequence of memory ops to perform memset / memcpy. 2776c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Chengstatic bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps, 2777c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Limit, uint64_t Size, 2778c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng unsigned Align, TargetLowering &TLI) { 27791db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT; 27801db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 27811db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (TLI.allowsUnalignedMemoryAccesses()) { 27821db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 27831db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } else { 27841db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Align & 7) { 27851db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 0: 27861db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i64; 27871db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27881db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 4: 27891db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i32; 27901db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27911db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case 2: 27921db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i16; 27931db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27941db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng default: 27951db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = MVT::i8; 27961db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng break; 27971db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27981db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 27991db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 280080e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng MVT::ValueType LVT = MVT::i64; 280180e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng while (!TLI.isTypeLegal(LVT)) 280280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng LVT = (MVT::ValueType)((unsigned)LVT - 1); 280380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(LVT)); 28041db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 280580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (VT > LVT) 280680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng VT = LVT; 280780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 2808dea7245997f37972ed2f94d4ca1ec50c5af5000aEvan Cheng unsigned NumMemOps = 0; 28091db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (Size != 0) { 28101db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 28111db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng while (VTSize > Size) { 28121db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VT = (MVT::ValueType)((unsigned)VT - 1); 28131db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng VTSize >>= 1; 28141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 281580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng assert(MVT::isInteger(VT)); 281680e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 281780e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng if (++NumMemOps > Limit) 281880e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return false; 28191db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MemOps.push_back(VT); 28201db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Size -= VTSize; 28211db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 282280e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng 282380e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng return true; 28241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng} 28251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28267041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattnervoid SelectionDAGLowering::visitMemIntrinsic(CallInst &I, unsigned Op) { 28271db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op1 = getValue(I.getOperand(1)); 28281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op2 = getValue(I.getOperand(2)); 28291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op3 = getValue(I.getOperand(3)); 28301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng SDOperand Op4 = getValue(I.getOperand(4)); 28311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Align = (unsigned)cast<ConstantSDNode>(Op4)->getValue(); 28321db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (Align == 0) Align = 1; 28331db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28341db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng if (ConstantSDNode *Size = dyn_cast<ConstantSDNode>(Op3)) { 28351db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<MVT::ValueType> MemOps; 28361db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 28371db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // Expand memset / memcpy to a series of load / store ops 28381db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng // if the size operand falls below a certain threshold. 28391db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng std::vector<SDOperand> OutChains; 28401db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng switch (Op) { 2841ac940ab1bf21be40f74a83b202419a20ad2e279fEvan Cheng default: break; // Do nothing for now. 28421db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng case ISD::MEMSET: { 2843c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(), 2844c4f8eee05447a1d7ead3deabbeb087e3e037f3f8Evan Cheng Size->getValue(), Align, TLI)) { 284580e89d7d6c02233a92d26bd4625e4188d48cbfa1Evan Cheng unsigned NumMemOps = MemOps.size(); 28461db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned Offset = 0; 28471db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 28481db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng MVT::ValueType VT = MemOps[i]; 28491db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 2850a47876d87a84fa94bf9f09cfef6756223575611dEvan Cheng SDOperand Value = getMemsetValue(Op2, VT, DAG); 2851c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, getRoot(), 2852c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Value, 2853864635ad7b3046d3042311423071152c613961deChris Lattner getMemBasePlusOffset(Op1, Offset, DAG, TLI), 2854864635ad7b3046d3042311423071152c613961deChris Lattner DAG.getSrcValue(I.getOperand(1), Offset)); 2855c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 2856c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Offset += VTSize; 2857c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2858c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2859c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 2860c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 2861c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng case ISD::MEMCPY: { 2862c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemcpy(), 2863c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng Size->getValue(), Align, TLI)) { 2864c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned NumMemOps = MemOps.size(); 2865cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng unsigned SrcOff = 0, DstOff = 0, SrcDelta = 0; 286674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalAddressSDNode *G = NULL; 286774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng std::string Str; 2868cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng bool CopyFromStr = false; 286974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 287074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (Op2.getOpcode() == ISD::GlobalAddress) 287174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2); 287274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng else if (Op2.getOpcode() == ISD::ADD && 287374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(0).getOpcode() == ISD::GlobalAddress && 287474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Op2.getOperand(1).getOpcode() == ISD::Constant) { 287574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng G = cast<GlobalAddressSDNode>(Op2.getOperand(0)); 2876cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcDelta = cast<ConstantSDNode>(Op2.getOperand(1))->getValue(); 287774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 287874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng if (G) { 287974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal()); 2880cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (GV) { 28810937103368992af8d3d8032d31a7d152aeae32d5Evan Cheng Str = GV->getStringValue(false); 2882cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (!Str.empty()) { 2883cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng CopyFromStr = true; 2884cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng SrcOff += SrcDelta; 2885cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 2886cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng } 288774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 288874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2889c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng for (unsigned i = 0; i < NumMemOps; i++) { 2890c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng MVT::ValueType VT = MemOps[i]; 2891c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng unsigned VTSize = getSizeInBits(VT) / 8; 289274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SDOperand Value, Chain, Store; 289374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng 2894cffbb5174f283d123d6bfc582292f4a9c84cb3edEvan Cheng if (CopyFromStr) { 289574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff); 289674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = getRoot(); 289774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 289874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 289974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 290074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 290174d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } else { 290274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Value = DAG.getLoad(VT, getRoot(), 290374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op2, SrcOff, DAG, TLI), 290474d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(2), SrcOff)); 290574d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Chain = Value.getValue(1); 290674d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng Store = 290774d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getNode(ISD::STORE, MVT::Other, Chain, Value, 290874d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng getMemBasePlusOffset(Op1, DstOff, DAG, TLI), 290974d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DAG.getSrcValue(I.getOperand(1), DstOff)); 291074d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng } 2911c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng OutChains.push_back(Store); 291274d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng SrcOff += VTSize; 291374d0aa9a4b1f5e021d2ce851a7af344e9b4ebb23Evan Cheng DstOff += VTSize; 29141db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29151db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2916c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng break; 29171db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29181db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 2919c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng 2920c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng if (!OutChains.empty()) { 2921c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains)); 2922c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng return; 2923c080d6fb3dc7769c5a1e00c6a77cb415453b0b89Evan Cheng } 29241db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng } 29251db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng 29267041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner std::vector<SDOperand> Ops; 2927a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner Ops.push_back(getRoot()); 29281db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op1); 29291db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op2); 29301db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op3); 29311db92f947cc600dee5edb9305a4e0f1c5c872965Evan Cheng Ops.push_back(Op4); 29327041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner DAG.setRoot(DAG.getNode(Op, MVT::Other, Ops)); 29331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29357041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 29367041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 29377041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 29381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 29401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return RegMap->createVirtualRegister(TLI.getRegClassFor(VT)); 29411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2943495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 294436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // FIXME: we only modify the CFG to split critical edges. This 294536b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner // updates dom and loop info. 2946495a0b51915eb763576874f29192820b731edc22Chris Lattner} 29471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2948c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 29497e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// OptimizeNoopCopyExpression - We have determined that the specified cast 29507e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// instruction is a noop copy (e.g. it's casting from one pointer type to 29517e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner/// another, int->uint, or int->sbyte on PPC. 2952903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// 2953903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// Return true if any changes are made. 2954903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeNoopCopyExpression(CastInst *CI) { 29557e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *DefBB = CI->getParent(); 29567e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29577e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner /// InsertedCasts - Only insert a cast in each block once. 29587e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner std::map<BasicBlock*, CastInst*> InsertedCasts; 29597e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 2960903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = false; 29617e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (Value::use_iterator UI = CI->use_begin(), E = CI->use_end(); 29627e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UI != E; ) { 29637e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Use &TheUse = UI.getUse(); 29647e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *User = cast<Instruction>(*UI); 29657e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29667e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Figure out which BB this cast is used in. For PHI's this is the 29677e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // appropriate predecessor block. 29687e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock *UserBB = User->getParent(); 29697e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (PHINode *PN = dyn_cast<PHINode>(User)) { 29707e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner unsigned OpVal = UI.getOperandNo()/2; 29717e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner UserBB = PN->getIncomingBlock(OpVal); 29727e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 29737e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29747e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Preincrement use iterator so we don't invalidate it. 29757e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner ++UI; 29767e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29777e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this user is in the same block as the cast, don't change the cast. 29787e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (UserBB == DefBB) continue; 29797e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29807e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If we have already inserted a cast into this block, use it. 29817e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner CastInst *&InsertedCast = InsertedCasts[UserBB]; 29827e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29837e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (!InsertedCast) { 29847e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner BasicBlock::iterator InsertPt = UserBB->begin(); 29857e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 29867e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29877e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner InsertedCast = 29887e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 2989903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = true; 29907e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 29917e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 29927e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // Replace a use of the cast with a use of the new casat. 29937e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner TheUse = InsertedCast; 29947e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 2995903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 2996903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If we removed all uses, nuke the cast. 2997903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->use_empty()) 2998903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner CI->eraseFromParent(); 2999903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3000903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return MadeChange; 30017e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner} 3002c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3003903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// InsertGEPComputeCode - Insert code into BB to compute Ptr+PtrOffset, 3004903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// casting to the type of GEPI. 3005f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattnerstatic Instruction *InsertGEPComputeCode(Instruction *&V, BasicBlock *BB, 3006f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *GEPI, Value *Ptr, 3007f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Value *PtrOffset) { 3008903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (V) return V; // Already computed. 3009903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3010903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner BasicBlock::iterator InsertPt; 3011903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (BB == GEPI->getParent()) { 3012903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If insert into the GEP's block, insert right after the GEP. 3013903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = GEPI; 3014903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ++InsertPt; 3015903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3016903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Otherwise, insert at the top of BB, after any PHI nodes 3017903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner InsertPt = BB->begin(); 3018903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (isa<PHINode>(InsertPt)) ++InsertPt; 3019903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3020903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3021903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If Ptr is itself a cast, but in some other BB, emit a copy of the cast into 3022903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // BB so that there is only one value live across basic blocks (the cast 3023903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // operand). 3024903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CastInst *CI = dyn_cast<CastInst>(Ptr)) 3025903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (CI->getParent() != BB && isa<PointerType>(CI->getOperand(0)->getType())) 3026903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = new CastInst(CI->getOperand(0), CI->getType(), "", InsertPt); 3027903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3028903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Add the offset, cast it to the right type. 3029903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr = BinaryOperator::createAdd(Ptr, PtrOffset, "", InsertPt); 3030f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner return V = new CastInst(Ptr, GEPI->getType(), "", InsertPt); 3031903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3032903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3033903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// ReplaceUsesOfGEPInst - Replace all uses of RepPtr with inserted code to 3034903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// compute its value. The RepPtr value can be computed with Ptr+PtrOffset. One 3035903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// trivial way of doing this would be to evaluate Ptr+PtrOffset in RepPtr's 3036903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// block, then ReplaceAllUsesWith'ing everything. However, we would prefer to 3037903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// sink PtrOffset into user blocks where doing so will likely allow us to fold 3038903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// the constant add into a load or store instruction. Additionally, if a user 3039903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner/// is a pointer-pointer cast, we look through it to find its users. 3040903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic void ReplaceUsesOfGEPInst(Instruction *RepPtr, Value *Ptr, 3041903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Constant *PtrOffset, BasicBlock *DefBB, 3042903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GetElementPtrInst *GEPI, 3043f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> &InsertedExprs) { 3044903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (!RepPtr->use_empty()) { 3045903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Instruction *User = cast<Instruction>(RepPtr->use_back()); 3046903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3047903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If the user is a Pointer-Pointer cast, recurse. 3048903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<CastInst>(User) && isa<PointerType>(User->getType())) { 3049903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(User, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3050903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3051903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // Drop the use of RepPtr. The cast is dead. Don't delete it now, else we 3052903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // could invalidate an iterator. 3053903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->setOperand(0, UndefValue::get(RepPtr->getType())); 3054903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner continue; 3055903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3056903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3057903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a load of the pointer, or a store through the pointer, emit 3058903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // the increment into the load/store block. 3059f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner Instruction *NewVal; 3060903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (isa<LoadInst>(User) || 3061903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner (isa<StoreInst>(User) && User->getOperand(0) != RepPtr)) { 3062903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[User->getParent()], 3063903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->getParent(), GEPI, 3064903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3065903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3066903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this use is not foldable into the addressing mode, use a version 3067903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // emitted in the GEP block. 3068903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner NewVal = InsertGEPComputeCode(InsertedExprs[DefBB], DefBB, GEPI, 3069903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Ptr, PtrOffset); 3070903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3071903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3072f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner if (GEPI->getType() != RepPtr->getType()) { 3073f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner BasicBlock::iterator IP = NewVal; 3074f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner ++IP; 3075f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner NewVal = new CastInst(NewVal, RepPtr->getType(), "", IP); 3076f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner } 3077903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner User->replaceUsesOfWith(RepPtr, NewVal); 3078903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3079903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner} 3080903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3081903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3082c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// OptimizeGEPExpression - Since we are doing basic-block-at-a-time instruction 3083c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// selection, we want to be a bit careful about some things. In particular, if 3084c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// we have a GEP instruction that is used in a different block than it is 3085c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// defined, the addressing expression of the GEP cannot be folded into loads or 3086c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// stores that use it. In this case, decompose the GEP and move constant 3087c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner/// indices into blocks that use it. 3088903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattnerstatic bool OptimizeGEPExpression(GetElementPtrInst *GEPI, 3089a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD) { 3090c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP is only used inside the block it is defined in, there is no 3091c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // need to rewrite it. 3092c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool isUsedOutsideDefBB = false; 3093c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock *DefBB = GEPI->getParent(); 3094c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (Value::use_iterator UI = GEPI->use_begin(), E = GEPI->use_end(); 3095c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner UI != E; ++UI) { 3096c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (cast<Instruction>(*UI)->getParent() != DefBB) { 3097c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner isUsedOutsideDefBB = true; 3098c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3099c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3100c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3101903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!isUsedOutsideDefBB) return false; 3102c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3103c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // If this GEP has no non-zero constant indices, there is nothing we can do, 3104c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // ignore it. 3105c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner bool hasConstantIndex = false; 3106903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool hasVariableIndex = false; 3107c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3108c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3109903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(*OI)) { 3110c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue()) { 3111c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner hasConstantIndex = true; 3112c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner break; 3113c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3114903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } else { 3115903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner hasVariableIndex = true; 3116903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3117c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3118903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3119903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner // If this is a "GEP X, 0, 0, 0", turn this into a cast. 3120903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !hasVariableIndex) { 3121903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner Value *NC = new CastInst(GEPI->getOperand(0), GEPI->getType(), 3122903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->getName(), GEPI); 3123903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->replaceAllUsesWith(NC); 3124903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner GEPI->eraseFromParent(); 3125903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3126903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3127903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 31283802c2552fe4475418db3c948e7601d7259f996dChris Lattner // If this is a GEP &Alloca, 0, 0, forward subst the frame index into uses. 3129903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner if (!hasConstantIndex && !isa<AllocaInst>(GEPI->getOperand(0))) 3130903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return false; 3131c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3132c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Otherwise, decompose the GEP instruction into multiplies and adds. Sum the 3133c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constant offset (which we now know is non-zero) and deal with it later. 3134c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner uint64_t ConstantOffset = 0; 3135a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const Type *UIntPtrTy = TD->getIntPtrType(); 3136c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Ptr = new CastInst(GEPI->getOperand(0), UIntPtrTy, "", GEPI); 3137c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner const Type *Ty = GEPI->getOperand(0)->getType(); 3138c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3139c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (GetElementPtrInst::op_iterator OI = GEPI->op_begin()+1, 3140c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner E = GEPI->op_end(); OI != E; ++OI) { 3141c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Value *Idx = *OI; 3142c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 3143c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner unsigned Field = cast<ConstantUInt>(Idx)->getValue(); 3144c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (Field) 3145a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += TD->getStructLayout(StTy)->MemberOffsets[Field]; 3146c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = StTy->getElementType(Field); 3147c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } else { 3148c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 3149c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3150c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Handle constant subscripts. 3151c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 3152c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (CI->getRawValue() == 0) continue; 3153c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3154c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(CI)) 3155a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset += (int64_t)TD->getTypeSize(Ty)*CSI->getValue(); 3156c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner else 3157a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson ConstantOffset+=TD->getTypeSize(Ty)*cast<ConstantUInt>(CI)->getValue(); 3158c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner continue; 3159c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3160c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3161c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Ptr = Ptr + Idx * ElementSize; 3162c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3163c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Cast Idx to UIntPtrTy if needed. 3164c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = new CastInst(Idx, UIntPtrTy, "", GEPI); 3165c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3166a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson uint64_t ElementSize = TD->getTypeSize(Ty); 3167c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Mask off bits that should not be set. 3168c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ElementSize &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3169c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *SizeCst = ConstantUInt::get(UIntPtrTy, ElementSize); 3170c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3171c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Multiply by the element size and add to the base. 3172c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Idx = BinaryOperator::createMul(Idx, SizeCst, "", GEPI); 3173c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Ptr = BinaryOperator::createAdd(Ptr, Idx, "", GEPI); 3174c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3175c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner } 3176c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3177c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Make sure that the offset fits in uintptr_t. 3178c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner ConstantOffset &= ~0ULL >> (64-UIntPtrTy->getPrimitiveSizeInBits()); 3179c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner Constant *PtrOffset = ConstantUInt::get(UIntPtrTy, ConstantOffset); 3180c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3181c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Okay, we have now emitted all of the variable index parts to the BB that 3182c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // the GEP is defined in. Loop over all of the using instructions, inserting 3183c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // an "add Ptr, ConstantOffset" into each block that uses it and update the 3184c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // instruction to use the newly computed value, making GEPI dead. When the 3185c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // user is a load or store instruction address, we emit the add into the user 3186c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // block, otherwise we use a canonical version right next to the gep (these 3187c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner // won't be foldable as addresses, so we might as well share the computation). 3188c78b0b740bcf2e00a8871090709c3571fe442f07Chris Lattner 3189f0df8824eb2bf8a5fb91ce6fd1db590caf34f994Chris Lattner std::map<BasicBlock*,Instruction*> InsertedExprs; 3190903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner ReplaceUsesOfGEPInst(GEPI, Ptr, PtrOffset, DefBB, GEPI, InsertedExprs); 3191c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 3192c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // Finally, the GEP is dead, remove it. 3193c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner GEPI->eraseFromParent(); 3194903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner 3195903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner return true; 3196c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner} 3197c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 31981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 31991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 32001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner RegMap = MF.getSSARegMap(); 32011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "\n\n\n=== " << Fn.getName() << "\n"); 32021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3203c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // First, split all critical edges for PHI nodes with incoming values that are 3204c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // constants, this way the load of the constant into a vreg will not be placed 3205c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // into MBBs that are used some other way. 3206c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 32077e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // In this pass we also look for GEP and cast instructions that are used 32087e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // across basic blocks and rewrite them to improve basic-block-at-a-time 32097e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // selection. 32107e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // 3211c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner // 3212903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner bool MadeChange = true; 3213903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner while (MadeChange) { 3214903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange = false; 321536b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 321636b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner PHINode *PN; 3217c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner BasicBlock::iterator BBI; 3218c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner for (BBI = BB->begin(); (PN = dyn_cast<PHINode>(BBI)); ++BBI) 321936b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) 322036b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner if (isa<Constant>(PN->getIncomingValue(i))) 322136b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner SplitCriticalEdge(PN->getIncomingBlock(i), BB); 3222c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 32237e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner for (BasicBlock::iterator E = BB->end(); BBI != E; ) { 32247e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner Instruction *I = BBI++; 32257e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) { 3226903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeGEPExpression(GEPI, TLI.getTargetData()); 32277e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } else if (CastInst *CI = dyn_cast<CastInst>(I)) { 32287e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is a noop copy, sink it into user blocks to reduce the number 32297e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // of virtual registers that must be created and coallesced. 32307e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType SrcVT = TLI.getValueType(CI->getOperand(0)->getType()); 32317e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner MVT::ValueType DstVT = TLI.getValueType(CI->getType()); 32327e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32337e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // This is an fp<->int conversion? 32347e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (MVT::isInteger(SrcVT) != MVT::isInteger(DstVT)) 32357e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner continue; 32367e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32377e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If this is an extension, it will be a zero or sign extension, which 32387e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // isn't a noop. 32397e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT < DstVT) continue; 32407e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32417e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If these values will be promoted, find out what they will be promoted 32427e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // to. This helps us consider truncates on PPC as noop copies when they 32437e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // are. 32447e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(SrcVT) == TargetLowering::Promote) 32457e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner SrcVT = TLI.getTypeToTransformTo(SrcVT); 32467e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (TLI.getTypeAction(DstVT) == TargetLowering::Promote) 32477e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner DstVT = TLI.getTypeToTransformTo(DstVT); 32487e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner 32497e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner // If, after promotion, these are the same types, this is a noop copy. 32507e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner if (SrcVT == DstVT) 3251903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner MadeChange |= OptimizeNoopCopyExpression(CI); 32527e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 32537e598096ea8db3f19f4ec8f4cb407aea996bd7c2Chris Lattner } 325436b708f05720c407f5e5657f2fd4b0677702ad46Chris Lattner } 3255903236468c3ebb3f9ae8f51b6f2e68f10c7e1d3aChris Lattner } 3256c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 32571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 32581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 32601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 3261edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 32621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 32631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 32641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 32651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3266ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerSDOperand SelectionDAGISel:: 3267ddb870b065984007a0df645ad97c6ad6a6f12de0Chris LattnerCopyValueToVirtualRegister(SelectionDAGLowering &SDL, Value *V, unsigned Reg) { 3268f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner SDOperand Op = SDL.getValue(V); 326918c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 3270d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 327118c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 3272d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner 3273d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // If this type is not legal, we must make sure to not create an invalid 3274d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // register use. 3275d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType SrcVT = Op.getValueType(); 3276d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner MVT::ValueType DestVT = TLI.getTypeToTransformTo(SrcVT); 3277d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SelectionDAG &DAG = SDL.DAG; 3278d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner if (SrcVT == DestVT) { 3279d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 32801c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } else if (SrcVT == MVT::Vector) { 328170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Handle copies from generic vectors to registers. 328270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner MVT::ValueType PTyElementVT, PTyLegalElementVT; 328370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner unsigned NE = TLI.getPackedTypeBreakdown(cast<PackedType>(V->getType()), 328470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner PTyElementVT, PTyLegalElementVT); 32851c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner 328670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Insert a VBIT_CONVERT of the input vector to a "N x PTyElementVT" 328770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // MVT::Vector type. 328870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Op, 328970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getConstant(NE, MVT::i32), 329070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner DAG.getValueType(PTyElementVT)); 329170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner 329270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Loop over all of the elements of the resultant vector, 329370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // VEXTRACT_VECTOR_ELT'ing them, converting them to PTyLegalElementVT, then 329470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // copying them into output registers. 329570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner std::vector<SDOperand> OutChains; 329670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Root = SDL.getRoot(); 329770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner for (unsigned i = 0; i != NE; ++i) { 329870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Elt = DAG.getNode(ISD::VEXTRACT_VECTOR_ELT, PTyElementVT, 329970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Op, DAG.getConstant(i, MVT::i32)); 330070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (PTyElementVT == PTyLegalElementVT) { 330170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are legal. 330270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 330370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else if (PTyLegalElementVT > PTyElementVT) { 330470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are promoted. 330570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner if (MVT::isFloatingPoint(PTyLegalElementVT)) 330670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::FP_EXTEND, PTyLegalElementVT, Elt); 330770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner else 330870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt = DAG.getNode(ISD::ANY_EXTEND, PTyLegalElementVT, Elt); 330970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Elt)); 331070c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } else { 331170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // Elements are expanded. 331270c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner // The src value is expanded into multiple registers. 331370c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 331470c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt, DAG.getConstant(0, MVT::i32)); 331570c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, PTyLegalElementVT, 331670c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner Elt, DAG.getConstant(1, MVT::i32)); 331770c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Lo)); 331870c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner OutChains.push_back(DAG.getCopyToReg(Root, Reg++, Hi)); 331970c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner } 33201c6191ffe764f3294cc2dda2bb3703403a416414Chris Lattner } 332170c2a61e0a0fb0a7e8b9bddd26bdcc92762772f0Chris Lattner return DAG.getNode(ISD::TokenFactor, MVT::Other, OutChains); 3322d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else if (SrcVT < DestVT) { 3323d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is promoted to the register. 3324fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner if (MVT::isFloatingPoint(SrcVT)) 3325fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner Op = DAG.getNode(ISD::FP_EXTEND, DestVT, Op); 3326fae59b99b8d1942f30a4be609423282c3fd62dd8Chris Lattner else 3327fab08875b73656f373b10a59aad475615df82bafChris Lattner Op = DAG.getNode(ISD::ANY_EXTEND, DestVT, Op); 3328d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(SDL.getRoot(), Reg, Op); 3329d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } else { 3330d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner // The src value is expanded into multiple registers. 3331d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3332d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op, DAG.getConstant(0, MVT::i32)); 3333d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner SDOperand Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DestVT, 3334d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op, DAG.getConstant(1, MVT::i32)); 3335d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner Op = DAG.getCopyToReg(SDL.getRoot(), Reg, Lo); 3336d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner return DAG.getCopyToReg(Op, Reg+1, Hi); 3337d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner } 33381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3340068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 3341068a81e9fca511b9a3b3a0f28a8988a57f994652Chris LattnerLowerArguments(BasicBlock *BB, SelectionDAGLowering &SDL, 3342068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> &UnorderedChains) { 33431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 3344068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner Function &F = *BB->getParent(); 33450afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 3346bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 3347bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 3348bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3349bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 3350bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 3351bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 3352bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 3353bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 3354f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 3355bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 3356bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 3357bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (FuncInfo.ValueMap.count(AI)) { 3358bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand Copy = 3359bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner CopyValueToVirtualRegister(SDL, AI, FuncInfo.ValueMap[AI]); 3360bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner UnorderedChains.push_back(Copy); 3361bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 33620afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 3363bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3364bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 3365966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 3366bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 3367068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 3368068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3369068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 3370068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 3371f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3372068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner SelectionDAGLowering SDL(DAG, TLI, FuncInfo); 3373068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 3374068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<SDOperand> UnorderedChains; 3375edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3376bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 3377bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (LLVMBB == &LLVMBB->getParent()->front()) 3378bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner LowerArguments(LLVMBB, SDL, UnorderedChains); 33791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 33811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 33821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 33841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 33851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 33861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 3387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 33881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 33891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // blocks are available as virtual registers. 33901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 3391f1fdacae8c1bd9e5ff4619546b3a28e93fb75ab5Chris Lattner if (!I->use_empty() && !isa<PHINode>(I)) { 3392ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner std::map<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 33931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 3394ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3395ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, I, VMI->second)); 33961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 33971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 33981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 33991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 34001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 34011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 34021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 34031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 3404edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 34051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 34071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 34081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Check successor nodes PHI nodes that expect a constant to be available from 34101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // this block. 34111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 34121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 34131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 34141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock::iterator MBBI = FuncInfo.MBBMap[SuccBB]->begin(); 34151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 34161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 34181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 34191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 34201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 3421f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner (PN = dyn_cast<PHINode>(I)); ++I) 3422f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (!PN->use_empty()) { 3423f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned Reg; 3424f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 3425f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 3426f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner unsigned &RegOut = ConstantsOut[C]; 3427f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner if (RegOut == 0) { 3428f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner RegOut = FuncInfo.CreateRegForValue(C); 3429ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3430ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, C, RegOut)); 3431f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } 3432f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = RegOut; 3433f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner } else { 3434f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 3435ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner if (Reg == 0) { 3436edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman assert(isa<AllocaInst>(PHIOp) && 3437ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 3438ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner "Didn't codegen value into a register!??"); 3439ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 3440ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner UnorderedChains.push_back( 3441ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner CopyValueToVirtualRegister(SDL, PHIOp, Reg)); 3442ee749d7488bd42df0f67e2d80048c63415943785Chris Lattner } 34431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3444edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3445f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // Remember that this register needs to added to the machine PHI node as 3446f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner // the input for this MBB. 34477e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 34487e02151ce2686687446ba7293e66d6b096106e68Chris Lattner unsigned NumElements; 34497e02151ce2686687446ba7293e66d6b096106e68Chris Lattner if (VT != MVT::Vector) 34507e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = TLI.getNumElements(VT); 34517e02151ce2686687446ba7293e66d6b096106e68Chris Lattner else { 34527e02151ce2686687446ba7293e66d6b096106e68Chris Lattner MVT::ValueType VT1,VT2; 34537e02151ce2686687446ba7293e66d6b096106e68Chris Lattner NumElements = 34547e02151ce2686687446ba7293e66d6b096106e68Chris Lattner TLI.getPackedTypeBreakdown(cast<PackedType>(PN->getType()), 34557e02151ce2686687446ba7293e66d6b096106e68Chris Lattner VT1, VT2); 34567e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 3457f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner for (unsigned i = 0, e = NumElements; i != e; ++i) 3458f44fd88e9cdd7b47acb71ac78e3dccb91319c72dChris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 34591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 34601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 34611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 34621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3463ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner // Turn all of the unordered chains into one factored node. 34645a6c6d98d561df671350a56c8031a3611f1c46faChris Lattner if (!UnorderedChains.empty()) { 34657436b57de32333cc337b8c7cea208c8863eee793Chris Lattner SDOperand Root = SDL.getRoot(); 34667436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (Root.getOpcode() != ISD::EntryToken) { 34677436b57de32333cc337b8c7cea208c8863eee793Chris Lattner unsigned i = 0, e = UnorderedChains.size(); 34687436b57de32333cc337b8c7cea208c8863eee793Chris Lattner for (; i != e; ++i) { 34697436b57de32333cc337b8c7cea208c8863eee793Chris Lattner assert(UnorderedChains[i].Val->getNumOperands() > 1); 34707436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (UnorderedChains[i].Val->getOperand(0) == Root) 34717436b57de32333cc337b8c7cea208c8863eee793Chris Lattner break; // Don't add the root if we already indirectly depend on it. 34727436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 34737436b57de32333cc337b8c7cea208c8863eee793Chris Lattner 34747436b57de32333cc337b8c7cea208c8863eee793Chris Lattner if (i == e) 34757436b57de32333cc337b8c7cea208c8863eee793Chris Lattner UnorderedChains.push_back(Root); 34767436b57de32333cc337b8c7cea208c8863eee793Chris Lattner } 3477ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, UnorderedChains)); 3478ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner } 3479ddb870b065984007a0df645ad97c6ad6a6f12de0Chris Lattner 34801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 34811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*LLVMBB->getTerminator()); 3482a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 3483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 348437efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 3485f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 3486f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 348737efe6764568a3829fee26aba532283131d1a104Nate Begeman JT = SDL.JT; 3488f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3489a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 3490a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner DAG.setRoot(SDL.getRoot()); 34911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 34921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3493f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 3494af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 3495af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(false); 34962300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 34971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Lowered selection DAG:\n"); 34981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3499f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 35011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 3502ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 3503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Legalized selection DAG:\n"); 35051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 3506f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3507af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 3508af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner DAG.Combine(true); 35092300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 3510a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 3511552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 3512a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 3513a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 35141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 3515f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(std::cerr << "Selected machine code:\n"); 35171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 3518f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 3519f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3520f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 3521f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 3522f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 3523f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 3524f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3525f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 3526f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3527f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 3528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 3529f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 35301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3531f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 3532f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 3533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 3535a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 35361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 353737efe6764568a3829fee26aba532283131d1a104Nate Begeman if (SwitchCases.empty() && JT.Reg == 0) { 3538f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 3539f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 3540f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3541f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3542f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[i].second); 3543f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3544f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3545f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 35461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3547f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 35489453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 35499453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 35509453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 355137efe6764568a3829fee26aba532283131d1a104Nate Begeman if (JT.Reg) { 355237efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(SwitchCases.empty() && "Cannot have jump table and lowered switch"); 355337efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 355437efe6764568a3829fee26aba532283131d1a104Nate Begeman CurDAG = &SDAG; 355537efe6764568a3829fee26aba532283131d1a104Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 35569453eea49bca1c3904047db495855c93e001d1cdNate Begeman MachineBasicBlock *RangeBB = BB; 355737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 355837efe6764568a3829fee26aba532283131d1a104Nate Begeman BB = JT.MBB; 355937efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.setCurrentBasicBlock(BB); 356037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 356137efe6764568a3829fee26aba532283131d1a104Nate Begeman SDL.visitJumpTable(JT); 356237efe6764568a3829fee26aba532283131d1a104Nate Begeman SDAG.setRoot(SDL.getRoot()); 356337efe6764568a3829fee26aba532283131d1a104Nate Begeman CodeGenAndEmitDAG(SDAG); 356437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 356537efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 356637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 356737efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 356837efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 356937efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 3570f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (PHIBB == JT.Default) { 3571f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3572f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(RangeBB); 3573f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 3574f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 357537efe6764568a3829fee26aba532283131d1a104Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3576f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman PHI->addMachineBasicBlockOperand(BB); 357737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 357837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 357937efe6764568a3829fee26aba532283131d1a104Nate Begeman return; 358037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 358137efe6764568a3829fee26aba532283131d1a104Nate Begeman 3582f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 3583f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 3584f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for(unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 3585f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineDebugInfo>()); 3586f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 3587f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SelectionDAGLowering SDL(SDAG, TLI, FuncInfo); 3588f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 3589f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 3590f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 3591f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 3592f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 3593f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 3594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 3595f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Iterate over the phi nodes, if there is a phi node in a successor of this 3596f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // block (for instance, the default block), then add a pair of operands to 3597f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // the phi node for this block, as if we were coming from the original 3598f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // BB before switch expansion. 3599f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 3600f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 3601f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 3602f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 3603f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 3604f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (PHIBB == SwitchCases[i].LHSBB || PHIBB == SwitchCases[i].RHSBB) { 3605f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addRegOperand(PHINodesToUpdate[pi].second); 3606f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman PHI->addMachineBasicBlockOperand(BB); 3607f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3608f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 3609a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 36101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3611a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 3612a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 3613a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 3614a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 3615a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 3616a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 36174ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng ScheduleDAG *SL = NULL; 36184ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 36194ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng switch (ISHeuristic) { 36204ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng default: assert(0 && "Unrecognized scheduling heuristic"); 3621ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case defaultScheduling: 36223f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 36234a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer()); 36244a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner else { 36254a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner assert(TLI.getSchedulingPreference() == 36264a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 36273f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng SL = createBURRListDAGScheduler(DAG, BB); 36284a1cd9c61e3e648587d33d5f02ddad97e87f16aaChris Lattner } 36293f23952404cd03a8ab934cedcef7916f52a796c0Evan Cheng break; 3630ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case noScheduling: 363120a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createBFS_DAGScheduler(DAG, BB); 363220a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner break; 3633ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case simpleScheduling: 363420a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createSimpleDAGScheduler(false, DAG, BB); 363520a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner break; 3636ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case simpleNoItinScheduling: 363720a4921791eafc0cce00fb01dcacfcfc15a0d0fcChris Lattner SL = createSimpleDAGScheduler(true, DAG, BB); 36384ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng break; 3639ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingBURR: 3640f0f9c90204c650b9f3c3feb02ccfcb1e40c6acddEvan Cheng SL = createBURRListDAGScheduler(DAG, BB); 3641a5de484bc7c8f896b5903999797c4d57f4e45185Chris Lattner break; 3642ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingTDRR: 3643e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng SL = createTDRRListDAGScheduler(DAG, BB); 3644e165a78551a91d8420cd8f074d97701e8788f8b5Evan Cheng break; 3645ee00a1d12c631eb7360ddd4809bdde72331b2736Evan Cheng case listSchedulingTD: 3646b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris Lattner SL = createTDListDAGScheduler(DAG, BB, CreateTargetHazardRecognizer()); 3647a5de484bc7c8f896b5903999797c4d57f4e45185Chris Lattner break; 36484ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 3649a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 3650cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 3651a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 36520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 3653b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris LattnerHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 3654b0d21ef20c29f4ea46d21b488f17feaa6a8760e1Chris Lattner return new HazardRecognizer(); 365503fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner} 365603fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 36570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 36580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 36590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 36600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 36610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 36620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 36630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 36650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 36660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 36680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 36690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 36700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 36720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 36730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 36740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 36750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 36760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 36770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 36780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 36790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 36800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 36810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 36820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::cerr << "Could not match memory address. Inline asm failure!\n"; 36830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 36840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 36870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(DAG.getConstant(4/*MEM*/ | (SelOps.size() << 3), MVT::i32)); 36880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 36890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 36900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 36920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 36930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 36940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 36950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 36960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 3697