blob: ae124e852a91cc91d30c63feab0788f9f5447a73 [file] [log] [blame]
Dan Gohman6277eb22009-11-23 17:16:22 +00001//===-- FunctionLoweringInfo.cpp ------------------------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This implements routines for translating functions from LLVM IR into
11// Machine IR.
12//
13//===----------------------------------------------------------------------===//
14
Dan Gohman4c3fd9f2010-07-07 16:01:37 +000015#include "llvm/CodeGen/FunctionLoweringInfo.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +000016#include "llvm/ADT/PostOrderIterator.h"
17#include "llvm/CodeGen/Analysis.h"
18#include "llvm/CodeGen/MachineFrameInfo.h"
19#include "llvm/CodeGen/MachineFunction.h"
20#include "llvm/CodeGen/MachineInstrBuilder.h"
21#include "llvm/CodeGen/MachineModuleInfo.h"
22#include "llvm/CodeGen/MachineRegisterInfo.h"
Chandler Carruth0b8c9a82013-01-02 11:36:10 +000023#include "llvm/IR/DataLayout.h"
Stephen Hines36b56882014-04-23 16:57:46 -070024#include "llvm/IR/DebugInfo.h"
Chandler Carruth0b8c9a82013-01-02 11:36:10 +000025#include "llvm/IR/DerivedTypes.h"
26#include "llvm/IR/Function.h"
27#include "llvm/IR/Instructions.h"
28#include "llvm/IR/IntrinsicInst.h"
29#include "llvm/IR/LLVMContext.h"
30#include "llvm/IR/Module.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000031#include "llvm/Support/Debug.h"
32#include "llvm/Support/ErrorHandling.h"
33#include "llvm/Support/MathExtras.h"
Stephen Hines36b56882014-04-23 16:57:46 -070034#include "llvm/Target/TargetFrameLowering.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +000035#include "llvm/Target/TargetInstrInfo.h"
36#include "llvm/Target/TargetLowering.h"
37#include "llvm/Target/TargetOptions.h"
38#include "llvm/Target/TargetRegisterInfo.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000039#include <algorithm>
40using namespace llvm;
41
Stephen Hinesdce4a402014-05-29 02:49:00 -070042#define DEBUG_TYPE "function-lowering-info"
43
Dan Gohman6277eb22009-11-23 17:16:22 +000044/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
45/// PHI nodes or outside of the basic block that defines it, or used by a
46/// switch or atomic instruction, which may expand to multiple basic blocks.
Dan Gohmanae541aa2010-04-15 04:33:49 +000047static bool isUsedOutsideOfDefiningBlock(const Instruction *I) {
Dan Gohmand84e8062010-04-20 14:50:13 +000048 if (I->use_empty()) return false;
Dan Gohman6277eb22009-11-23 17:16:22 +000049 if (isa<PHINode>(I)) return true;
Dan Gohmanae541aa2010-04-15 04:33:49 +000050 const BasicBlock *BB = I->getParent();
Stephen Hines36b56882014-04-23 16:57:46 -070051 for (const User *U : I->users())
Gabor Greif03f09a32010-07-09 16:08:33 +000052 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U))
Dan Gohman6277eb22009-11-23 17:16:22 +000053 return true;
Stephen Hines36b56882014-04-23 16:57:46 -070054
Dan Gohman6277eb22009-11-23 17:16:22 +000055 return false;
56}
57
Stephen Hines36b56882014-04-23 16:57:46 -070058void FunctionLoweringInfo::set(const Function &fn, MachineFunction &mf,
59 SelectionDAG *DAG) {
Bill Wendlingd626d332013-06-19 20:32:16 +000060 const TargetLowering *TLI = TM.getTargetLowering();
61
Dan Gohman6277eb22009-11-23 17:16:22 +000062 Fn = &fn;
63 MF = &mf;
64 RegInfo = &MF->getRegInfo();
65
Dan Gohman84023e02010-07-10 09:00:22 +000066 // Check whether the function can return without sret-demotion.
67 SmallVector<ISD::OutputArg, 4> Outs;
Bill Wendling384ceb82013-06-06 00:11:39 +000068 GetReturnInfo(Fn->getReturnType(), Fn->getAttributes(), Outs, *TLI);
69 CanLowerReturn = TLI->CanLowerReturn(Fn->getCallingConv(), *MF,
70 Fn->isVarArg(),
71 Outs, Fn->getContext());
Dan Gohman84023e02010-07-10 09:00:22 +000072
Dan Gohman6277eb22009-11-23 17:16:22 +000073 // Initialize the mapping of values to registers. This is only set up for
74 // instruction values that are used outside of the block that defines
75 // them.
Dan Gohmanae541aa2010-04-15 04:33:49 +000076 Function::const_iterator BB = Fn->begin(), EB = Fn->end();
77 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
Stephen Hines36b56882014-04-23 16:57:46 -070078 if (const AllocaInst *AI = dyn_cast<AllocaInst>(I)) {
79 // Don't fold inalloca allocas or other dynamic allocas into the initial
80 // stack frame allocation, even if they are in the entry block.
81 if (!AI->isStaticAlloca())
82 continue;
83
Dan Gohmanae541aa2010-04-15 04:33:49 +000084 if (const ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +000085 Type *Ty = AI->getAllocatedType();
Bill Wendling384ceb82013-06-06 00:11:39 +000086 uint64_t TySize = TLI->getDataLayout()->getTypeAllocSize(Ty);
Dan Gohman6277eb22009-11-23 17:16:22 +000087 unsigned Align =
Bill Wendling384ceb82013-06-06 00:11:39 +000088 std::max((unsigned)TLI->getDataLayout()->getPrefTypeAlignment(Ty),
Dan Gohman6277eb22009-11-23 17:16:22 +000089 AI->getAlignment());
90
91 TySize *= CUI->getZExtValue(); // Get total allocated size.
92 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
Bill Wendlingdfc2c512010-07-27 01:55:19 +000093
Dan Gohman6277eb22009-11-23 17:16:22 +000094 StaticAllocaMap[AI] =
Stephen Hines36b56882014-04-23 16:57:46 -070095 MF->getFrameInfo()->CreateStackObject(TySize, Align, false, AI);
Dan Gohman6277eb22009-11-23 17:16:22 +000096 }
Stephen Hines36b56882014-04-23 16:57:46 -070097 }
Dan Gohman6277eb22009-11-23 17:16:22 +000098
99 for (; BB != EB; ++BB)
Eric Christopher5b13ed12012-02-24 01:59:01 +0000100 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
101 I != E; ++I) {
Stephen Hines36b56882014-04-23 16:57:46 -0700102 // Look for dynamic allocas.
103 if (const AllocaInst *AI = dyn_cast<AllocaInst>(I)) {
104 if (!AI->isStaticAlloca()) {
105 unsigned Align = std::max(
106 (unsigned)TLI->getDataLayout()->getPrefTypeAlignment(
107 AI->getAllocatedType()),
108 AI->getAlignment());
109 unsigned StackAlign = TM.getFrameLowering()->getStackAlignment();
110 if (Align <= StackAlign)
111 Align = 0;
112 // Inform the Frame Information that we have variable-sized objects.
113 MF->getFrameInfo()->CreateVariableSizedObject(Align ? Align : 1, AI);
114 }
115 }
116
117 // Look for inline asm that clobbers the SP register.
118 if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
119 ImmutableCallSite CS(I);
120 if (isa<InlineAsm>(CS.getCalledValue())) {
121 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
122 std::vector<TargetLowering::AsmOperandInfo> Ops =
123 TLI->ParseConstraints(CS);
124 for (size_t I = 0, E = Ops.size(); I != E; ++I) {
125 TargetLowering::AsmOperandInfo &Op = Ops[I];
126 if (Op.Type == InlineAsm::isClobber) {
127 // Clobbers don't have SDValue operands, hence SDValue().
128 TLI->ComputeConstraintToUse(Op, SDValue(), DAG);
129 std::pair<unsigned, const TargetRegisterClass*> PhysReg =
130 TLI->getRegForInlineAsmConstraint(Op.ConstraintCode,
131 Op.ConstraintVT);
132 if (PhysReg.first == SP)
133 MF->getFrameInfo()->setHasInlineAsmWithSPAdjust(true);
134 }
135 }
136 }
137 }
138
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000139 // Mark values used outside their block as exported, by allocating
140 // a virtual register for them.
Cameron Zwarich4ecc82e2011-02-22 03:24:52 +0000141 if (isUsedOutsideOfDefiningBlock(I))
Dan Gohman6277eb22009-11-23 17:16:22 +0000142 if (!isa<AllocaInst>(I) ||
143 !StaticAllocaMap.count(cast<AllocaInst>(I)))
144 InitializeRegForValue(I);
145
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000146 // Collect llvm.dbg.declare information. This is done now instead of
147 // during the initial isel pass through the IR so that it is done
148 // in a predictable order.
149 if (const DbgDeclareInst *DI = dyn_cast<DbgDeclareInst>(I)) {
150 MachineModuleInfo &MMI = MF->getMMI();
Manman Rencbafae62013-06-28 05:43:10 +0000151 DIVariable DIVar(DI->getVariable());
152 assert((!DIVar || DIVar.isVariable()) &&
153 "Variable in DbgDeclareInst should be either null or a DIVariable.");
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000154 if (MMI.hasDebugInfo() &&
Manman Rencbafae62013-06-28 05:43:10 +0000155 DIVar &&
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000156 !DI->getDebugLoc().isUnknown()) {
157 // Don't handle byval struct arguments or VLAs, for example.
158 // Non-byval arguments are handled here (they refer to the stack
159 // temporary alloca at this point).
160 const Value *Address = DI->getAddress();
161 if (Address) {
162 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
163 Address = BCI->getOperand(0);
164 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
165 DenseMap<const AllocaInst *, int>::iterator SI =
166 StaticAllocaMap.find(AI);
167 if (SI != StaticAllocaMap.end()) { // Check for VLAs.
168 int FI = SI->second;
169 MMI.setVariableDbgInfo(DI->getVariable(),
170 FI, DI->getDebugLoc());
171 }
172 }
173 }
174 }
175 }
176 }
177
Dan Gohman6277eb22009-11-23 17:16:22 +0000178 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
179 // also creates the initial PHI MachineInstrs, though none of the input
180 // operands are populated.
Dan Gohmand0d82752010-04-14 16:30:40 +0000181 for (BB = Fn->begin(); BB != EB; ++BB) {
Dan Gohman6277eb22009-11-23 17:16:22 +0000182 MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB);
183 MBBMap[BB] = MBB;
184 MF->push_back(MBB);
185
186 // Transfer the address-taken flag. This is necessary because there could
187 // be multiple MachineBasicBlocks corresponding to one BasicBlock, and only
188 // the first one should be marked.
189 if (BB->hasAddressTaken())
190 MBB->setHasAddressTaken();
191
192 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
193 // appropriate.
Dan Gohman3f1403f2010-04-20 14:46:25 +0000194 for (BasicBlock::const_iterator I = BB->begin();
195 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
196 if (PN->use_empty()) continue;
Dan Gohman6277eb22009-11-23 17:16:22 +0000197
Rafael Espindola3fa82832011-05-13 15:18:06 +0000198 // Skip empty types
199 if (PN->getType()->isEmptyTy())
200 continue;
201
Dan Gohmanc025c852010-04-20 14:48:02 +0000202 DebugLoc DL = PN->getDebugLoc();
Dan Gohman6277eb22009-11-23 17:16:22 +0000203 unsigned PHIReg = ValueMap[PN];
204 assert(PHIReg && "PHI node does not have an assigned virtual register!");
205
206 SmallVector<EVT, 4> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000207 ComputeValueVTs(*TLI, PN->getType(), ValueVTs);
Dan Gohman6277eb22009-11-23 17:16:22 +0000208 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
209 EVT VT = ValueVTs[vti];
Bill Wendling384ceb82013-06-06 00:11:39 +0000210 unsigned NumRegisters = TLI->getNumRegisters(Fn->getContext(), VT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000211 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
212 for (unsigned i = 0; i != NumRegisters; ++i)
Chris Lattner518bb532010-02-09 19:54:29 +0000213 BuildMI(MBB, DL, TII->get(TargetOpcode::PHI), PHIReg + i);
Dan Gohman6277eb22009-11-23 17:16:22 +0000214 PHIReg += NumRegisters;
215 }
216 }
217 }
Dan Gohmande4c0a72010-04-14 16:32:56 +0000218
219 // Mark landing pad blocks.
220 for (BB = Fn->begin(); BB != EB; ++BB)
Dan Gohmanae541aa2010-04-15 04:33:49 +0000221 if (const InvokeInst *Invoke = dyn_cast<InvokeInst>(BB->getTerminator()))
Dan Gohmande4c0a72010-04-14 16:32:56 +0000222 MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
Dan Gohman6277eb22009-11-23 17:16:22 +0000223}
224
225/// clear - Clear out all the function-specific state. This returns this
226/// FunctionLoweringInfo to an empty state, ready to be used for a
227/// different function.
228void FunctionLoweringInfo::clear() {
Dan Gohman0e026722010-04-14 17:11:23 +0000229 assert(CatchInfoFound.size() == CatchInfoLost.size() &&
230 "Not all catch info was assigned to a landing pad!");
231
Dan Gohman6277eb22009-11-23 17:16:22 +0000232 MBBMap.clear();
233 ValueMap.clear();
234 StaticAllocaMap.clear();
235#ifndef NDEBUG
236 CatchInfoLost.clear();
237 CatchInfoFound.clear();
238#endif
239 LiveOutRegInfo.clear();
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000240 VisitedBBs.clear();
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000241 ArgDbgValues.clear();
Devang Patel0b48ead2010-08-31 22:22:42 +0000242 ByValArgFrameIndexMap.clear();
Dan Gohman84023e02010-07-10 09:00:22 +0000243 RegFixups.clear();
Dan Gohman6277eb22009-11-23 17:16:22 +0000244}
245
Dan Gohman89496d02010-07-02 00:10:16 +0000246/// CreateReg - Allocate a single virtual register for the given type.
Patrik Hagglunda61b17c2012-12-13 06:34:11 +0000247unsigned FunctionLoweringInfo::CreateReg(MVT VT) {
Bill Wendlingd626d332013-06-19 20:32:16 +0000248 return RegInfo->
249 createVirtualRegister(TM.getTargetLowering()->getRegClassFor(VT));
Dan Gohman6277eb22009-11-23 17:16:22 +0000250}
251
Dan Gohman89496d02010-07-02 00:10:16 +0000252/// CreateRegs - Allocate the appropriate number of virtual registers of
Dan Gohman6277eb22009-11-23 17:16:22 +0000253/// the correctly promoted or expanded types. Assign these registers
254/// consecutive vreg numbers and return the first assigned number.
255///
256/// In the case that the given value has struct or array type, this function
257/// will assign registers for each member or element.
258///
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000259unsigned FunctionLoweringInfo::CreateRegs(Type *Ty) {
Bill Wendlingd626d332013-06-19 20:32:16 +0000260 const TargetLowering *TLI = TM.getTargetLowering();
261
Dan Gohman6277eb22009-11-23 17:16:22 +0000262 SmallVector<EVT, 4> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000263 ComputeValueVTs(*TLI, Ty, ValueVTs);
Dan Gohman6277eb22009-11-23 17:16:22 +0000264
265 unsigned FirstReg = 0;
266 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
267 EVT ValueVT = ValueVTs[Value];
Bill Wendling384ceb82013-06-06 00:11:39 +0000268 MVT RegisterVT = TLI->getRegisterType(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000269
Bill Wendling384ceb82013-06-06 00:11:39 +0000270 unsigned NumRegs = TLI->getNumRegisters(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000271 for (unsigned i = 0; i != NumRegs; ++i) {
Dan Gohman89496d02010-07-02 00:10:16 +0000272 unsigned R = CreateReg(RegisterVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000273 if (!FirstReg) FirstReg = R;
274 }
275 }
276 return FirstReg;
277}
Dan Gohman66336ed2009-11-23 17:42:46 +0000278
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000279/// GetLiveOutRegInfo - Gets LiveOutInfo for a register, returning NULL if the
280/// register is a PHI destination and the PHI's LiveOutInfo is not valid. If
281/// the register's LiveOutInfo is for a smaller bit width, it is extended to
282/// the larger bit width by zero extension. The bit width must be no smaller
283/// than the LiveOutInfo's existing bit width.
284const FunctionLoweringInfo::LiveOutInfo *
285FunctionLoweringInfo::GetLiveOutRegInfo(unsigned Reg, unsigned BitWidth) {
286 if (!LiveOutRegInfo.inBounds(Reg))
Stephen Hinesdce4a402014-05-29 02:49:00 -0700287 return nullptr;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000288
289 LiveOutInfo *LOI = &LiveOutRegInfo[Reg];
290 if (!LOI->IsValid)
Stephen Hinesdce4a402014-05-29 02:49:00 -0700291 return nullptr;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000292
Cameron Zwarich33b55472011-02-25 01:10:55 +0000293 if (BitWidth > LOI->KnownZero.getBitWidth()) {
Cameron Zwarich8fbbdca2011-02-25 01:11:01 +0000294 LOI->NumSignBits = 1;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000295 LOI->KnownZero = LOI->KnownZero.zextOrTrunc(BitWidth);
296 LOI->KnownOne = LOI->KnownOne.zextOrTrunc(BitWidth);
297 }
298
299 return LOI;
300}
301
302/// ComputePHILiveOutRegInfo - Compute LiveOutInfo for a PHI's destination
303/// register based on the LiveOutInfo of its operands.
304void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000305 Type *Ty = PN->getType();
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000306 if (!Ty->isIntegerTy() || Ty->isVectorTy())
307 return;
308
Bill Wendlingd626d332013-06-19 20:32:16 +0000309 const TargetLowering *TLI = TM.getTargetLowering();
310
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000311 SmallVector<EVT, 1> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000312 ComputeValueVTs(*TLI, Ty, ValueVTs);
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000313 assert(ValueVTs.size() == 1 &&
314 "PHIs with non-vector integer types should have a single VT.");
315 EVT IntVT = ValueVTs[0];
316
Bill Wendling384ceb82013-06-06 00:11:39 +0000317 if (TLI->getNumRegisters(PN->getContext(), IntVT) != 1)
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000318 return;
Bill Wendling384ceb82013-06-06 00:11:39 +0000319 IntVT = TLI->getTypeToTransformTo(PN->getContext(), IntVT);
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000320 unsigned BitWidth = IntVT.getSizeInBits();
321
322 unsigned DestReg = ValueMap[PN];
323 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
324 return;
325 LiveOutRegInfo.grow(DestReg);
326 LiveOutInfo &DestLOI = LiveOutRegInfo[DestReg];
327
328 Value *V = PN->getIncomingValue(0);
329 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
330 DestLOI.NumSignBits = 1;
331 APInt Zero(BitWidth, 0);
332 DestLOI.KnownZero = Zero;
333 DestLOI.KnownOne = Zero;
334 return;
335 }
336
337 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
338 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
339 DestLOI.NumSignBits = Val.getNumSignBits();
340 DestLOI.KnownZero = ~Val;
341 DestLOI.KnownOne = Val;
342 } else {
343 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its"
344 "CopyToReg node was created.");
345 unsigned SrcReg = ValueMap[V];
346 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
347 DestLOI.IsValid = false;
348 return;
349 }
350 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
351 if (!SrcLOI) {
352 DestLOI.IsValid = false;
353 return;
354 }
355 DestLOI = *SrcLOI;
356 }
357
358 assert(DestLOI.KnownZero.getBitWidth() == BitWidth &&
359 DestLOI.KnownOne.getBitWidth() == BitWidth &&
360 "Masks should have the same bit width as the type.");
361
362 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i) {
363 Value *V = PN->getIncomingValue(i);
364 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
365 DestLOI.NumSignBits = 1;
366 APInt Zero(BitWidth, 0);
367 DestLOI.KnownZero = Zero;
368 DestLOI.KnownOne = Zero;
Eric Christopher471e4222011-06-08 23:55:35 +0000369 return;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000370 }
371
372 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
373 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
374 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, Val.getNumSignBits());
375 DestLOI.KnownZero &= ~Val;
376 DestLOI.KnownOne &= Val;
377 continue;
378 }
379
380 assert(ValueMap.count(V) && "V should have been placed in ValueMap when "
381 "its CopyToReg node was created.");
382 unsigned SrcReg = ValueMap[V];
383 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
384 DestLOI.IsValid = false;
385 return;
386 }
387 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
388 if (!SrcLOI) {
389 DestLOI.IsValid = false;
390 return;
391 }
392 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, SrcLOI->NumSignBits);
393 DestLOI.KnownZero &= SrcLOI->KnownZero;
394 DestLOI.KnownOne &= SrcLOI->KnownOne;
395 }
396}
397
Devang Patel9aee3352011-09-08 22:59:09 +0000398/// setArgumentFrameIndex - Record frame index for the byval
Devang Patel0b48ead2010-08-31 22:22:42 +0000399/// argument. This overrides previous frame index entry for this argument,
400/// if any.
Devang Patel9aee3352011-09-08 22:59:09 +0000401void FunctionLoweringInfo::setArgumentFrameIndex(const Argument *A,
Eric Christopher5b13ed12012-02-24 01:59:01 +0000402 int FI) {
Devang Patel0b48ead2010-08-31 22:22:42 +0000403 ByValArgFrameIndexMap[A] = FI;
404}
Eric Christopher471e4222011-06-08 23:55:35 +0000405
Devang Patel9aee3352011-09-08 22:59:09 +0000406/// getArgumentFrameIndex - Get frame index for the byval argument.
Devang Patel0b48ead2010-08-31 22:22:42 +0000407/// If the argument does not have any assigned frame index then 0 is
408/// returned.
Devang Patel9aee3352011-09-08 22:59:09 +0000409int FunctionLoweringInfo::getArgumentFrameIndex(const Argument *A) {
Eric Christopher471e4222011-06-08 23:55:35 +0000410 DenseMap<const Argument *, int>::iterator I =
Devang Patel0b48ead2010-08-31 22:22:42 +0000411 ByValArgFrameIndexMap.find(A);
412 if (I != ByValArgFrameIndexMap.end())
413 return I->second;
Eric Christopher0822e012012-02-23 03:39:43 +0000414 DEBUG(dbgs() << "Argument does not have assigned frame index!\n");
Devang Patel0b48ead2010-08-31 22:22:42 +0000415 return 0;
416}
417
Michael J. Spencerc9c137b2012-02-22 19:06:13 +0000418/// ComputeUsesVAFloatArgument - Determine if any floating-point values are
419/// being passed to this variadic function, and set the MachineModuleInfo's
420/// usesVAFloatArgument flag if so. This flag is used to emit an undefined
421/// reference to _fltused on Windows, which will link in MSVCRT's
422/// floating-point support.
423void llvm::ComputeUsesVAFloatArgument(const CallInst &I,
424 MachineModuleInfo *MMI)
425{
426 FunctionType *FT = cast<FunctionType>(
427 I.getCalledValue()->getType()->getContainedType(0));
428 if (FT->isVarArg() && !MMI->usesVAFloatArgument()) {
429 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
430 Type* T = I.getArgOperand(i)->getType();
431 for (po_iterator<Type*> i = po_begin(T), e = po_end(T);
432 i != e; ++i) {
433 if (i->isFloatingPointTy()) {
434 MMI->setUsesVAFloatArgument(true);
435 return;
436 }
437 }
438 }
439 }
440}
441
Dan Gohman66336ed2009-11-23 17:42:46 +0000442/// AddCatchInfo - Extract the personality and type infos from an eh.selector
443/// call, and add them to the specified machine basic block.
Dan Gohman25208642010-04-14 19:53:31 +0000444void llvm::AddCatchInfo(const CallInst &I, MachineModuleInfo *MMI,
Dan Gohman66336ed2009-11-23 17:42:46 +0000445 MachineBasicBlock *MBB) {
446 // Inform the MachineModuleInfo of the personality for this landing pad.
Gabor Greif15184442010-06-25 08:24:59 +0000447 const ConstantExpr *CE = cast<ConstantExpr>(I.getArgOperand(1));
Dan Gohman66336ed2009-11-23 17:42:46 +0000448 assert(CE->getOpcode() == Instruction::BitCast &&
449 isa<Function>(CE->getOperand(0)) &&
450 "Personality should be a function");
451 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
452
453 // Gather all the type infos for this landing pad and pass them along to
454 // MachineModuleInfo.
Dan Gohman46510a72010-04-15 01:51:59 +0000455 std::vector<const GlobalVariable *> TyInfo;
Gabor Greife767e6b2010-06-30 13:45:50 +0000456 unsigned N = I.getNumArgOperands();
Dan Gohman66336ed2009-11-23 17:42:46 +0000457
Gabor Greife767e6b2010-06-30 13:45:50 +0000458 for (unsigned i = N - 1; i > 1; --i) {
459 if (const ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(i))) {
Dan Gohman66336ed2009-11-23 17:42:46 +0000460 unsigned FilterLength = CI->getZExtValue();
461 unsigned FirstCatch = i + FilterLength + !FilterLength;
Gabor Greife767e6b2010-06-30 13:45:50 +0000462 assert(FirstCatch <= N && "Invalid filter length");
Dan Gohman66336ed2009-11-23 17:42:46 +0000463
464 if (FirstCatch < N) {
465 TyInfo.reserve(N - FirstCatch);
466 for (unsigned j = FirstCatch; j < N; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000467 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000468 MMI->addCatchTypeInfo(MBB, TyInfo);
469 TyInfo.clear();
470 }
471
472 if (!FilterLength) {
473 // Cleanup.
474 MMI->addCleanup(MBB);
475 } else {
476 // Filter.
477 TyInfo.reserve(FilterLength - 1);
478 for (unsigned j = i + 1; j < FirstCatch; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000479 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000480 MMI->addFilterTypeInfo(MBB, TyInfo);
481 TyInfo.clear();
482 }
483
484 N = i;
485 }
486 }
487
Gabor Greife767e6b2010-06-30 13:45:50 +0000488 if (N > 2) {
489 TyInfo.reserve(N - 2);
490 for (unsigned j = 2; j < N; ++j)
491 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000492 MMI->addCatchTypeInfo(MBB, TyInfo);
493 }
494}
495
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000496/// AddLandingPadInfo - Extract the exception handling information from the
497/// landingpad instruction and add them to the specified machine module info.
498void llvm::AddLandingPadInfo(const LandingPadInst &I, MachineModuleInfo &MMI,
499 MachineBasicBlock *MBB) {
500 MMI.addPersonality(MBB,
501 cast<Function>(I.getPersonalityFn()->stripPointerCasts()));
502
503 if (I.isCleanup())
504 MMI.addCleanup(MBB);
505
506 // FIXME: New EH - Add the clauses in reverse order. This isn't 100% correct,
507 // but we need to do it this way because of how the DWARF EH emitter
508 // processes the clauses.
509 for (unsigned i = I.getNumClauses(); i != 0; --i) {
510 Value *Val = I.getClause(i - 1);
511 if (I.isCatch(i - 1)) {
512 MMI.addCatchTypeInfo(MBB,
513 dyn_cast<GlobalVariable>(Val->stripPointerCasts()));
514 } else {
515 // Add filters in a list.
516 Constant *CVal = cast<Constant>(Val);
517 SmallVector<const GlobalVariable*, 4> FilterList;
518 for (User::op_iterator
519 II = CVal->op_begin(), IE = CVal->op_end(); II != IE; ++II)
520 FilterList.push_back(cast<GlobalVariable>((*II)->stripPointerCasts()));
521
522 MMI.addFilterTypeInfo(MBB, FilterList);
523 }
524 }
525}