blob: 86b9542f2f211401017d491f3f867f61fa870336 [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"
Stephen Hines37ed9c12014-12-01 14:51:49 -080039#include "llvm/Target/TargetSubtargetInfo.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000040#include <algorithm>
41using namespace llvm;
42
Stephen Hinesdce4a402014-05-29 02:49:00 -070043#define DEBUG_TYPE "function-lowering-info"
44
Dan Gohman6277eb22009-11-23 17:16:22 +000045/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
46/// PHI nodes or outside of the basic block that defines it, or used by a
47/// switch or atomic instruction, which may expand to multiple basic blocks.
Dan Gohmanae541aa2010-04-15 04:33:49 +000048static bool isUsedOutsideOfDefiningBlock(const Instruction *I) {
Dan Gohmand84e8062010-04-20 14:50:13 +000049 if (I->use_empty()) return false;
Dan Gohman6277eb22009-11-23 17:16:22 +000050 if (isa<PHINode>(I)) return true;
Dan Gohmanae541aa2010-04-15 04:33:49 +000051 const BasicBlock *BB = I->getParent();
Stephen Hines36b56882014-04-23 16:57:46 -070052 for (const User *U : I->users())
Gabor Greif03f09a32010-07-09 16:08:33 +000053 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U))
Dan Gohman6277eb22009-11-23 17:16:22 +000054 return true;
Stephen Hines36b56882014-04-23 16:57:46 -070055
Dan Gohman6277eb22009-11-23 17:16:22 +000056 return false;
57}
58
Stephen Hines37ed9c12014-12-01 14:51:49 -080059static ISD::NodeType getPreferredExtendForValue(const Value *V) {
60 // For the users of the source value being used for compare instruction, if
61 // the number of signed predicate is greater than unsigned predicate, we
62 // prefer to use SIGN_EXTEND.
63 //
64 // With this optimization, we would be able to reduce some redundant sign or
65 // zero extension instruction, and eventually more machine CSE opportunities
66 // can be exposed.
67 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
68 unsigned NumOfSigned = 0, NumOfUnsigned = 0;
69 for (const User *U : V->users()) {
70 if (const auto *CI = dyn_cast<CmpInst>(U)) {
71 NumOfSigned += CI->isSigned();
72 NumOfUnsigned += CI->isUnsigned();
73 }
74 }
75 if (NumOfSigned > NumOfUnsigned)
76 ExtendKind = ISD::SIGN_EXTEND;
77
78 return ExtendKind;
79}
80
Stephen Hines36b56882014-04-23 16:57:46 -070081void FunctionLoweringInfo::set(const Function &fn, MachineFunction &mf,
82 SelectionDAG *DAG) {
Dan Gohman6277eb22009-11-23 17:16:22 +000083 Fn = &fn;
84 MF = &mf;
Stephen Hines37ed9c12014-12-01 14:51:49 -080085 TLI = MF->getSubtarget().getTargetLowering();
Dan Gohman6277eb22009-11-23 17:16:22 +000086 RegInfo = &MF->getRegInfo();
87
Dan Gohman84023e02010-07-10 09:00:22 +000088 // Check whether the function can return without sret-demotion.
89 SmallVector<ISD::OutputArg, 4> Outs;
Bill Wendling384ceb82013-06-06 00:11:39 +000090 GetReturnInfo(Fn->getReturnType(), Fn->getAttributes(), Outs, *TLI);
91 CanLowerReturn = TLI->CanLowerReturn(Fn->getCallingConv(), *MF,
Stephen Hines37ed9c12014-12-01 14:51:49 -080092 Fn->isVarArg(), Outs, Fn->getContext());
Dan Gohman84023e02010-07-10 09:00:22 +000093
Dan Gohman6277eb22009-11-23 17:16:22 +000094 // Initialize the mapping of values to registers. This is only set up for
95 // instruction values that are used outside of the block that defines
96 // them.
Dan Gohmanae541aa2010-04-15 04:33:49 +000097 Function::const_iterator BB = Fn->begin(), EB = Fn->end();
Dan Gohman6277eb22009-11-23 17:16:22 +000098 for (; BB != EB; ++BB)
Eric Christopher5b13ed12012-02-24 01:59:01 +000099 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
100 I != E; ++I) {
Stephen Hines36b56882014-04-23 16:57:46 -0700101 if (const AllocaInst *AI = dyn_cast<AllocaInst>(I)) {
Stephen Hines37ed9c12014-12-01 14:51:49 -0800102 // Static allocas can be folded into the initial stack frame adjustment.
103 if (AI->isStaticAlloca()) {
104 const ConstantInt *CUI = cast<ConstantInt>(AI->getArraySize());
105 Type *Ty = AI->getAllocatedType();
106 uint64_t TySize = TLI->getDataLayout()->getTypeAllocSize(Ty);
107 unsigned Align =
108 std::max((unsigned)TLI->getDataLayout()->getPrefTypeAlignment(Ty),
109 AI->getAlignment());
110
111 TySize *= CUI->getZExtValue(); // Get total allocated size.
112 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
113
114 StaticAllocaMap[AI] =
115 MF->getFrameInfo()->CreateStackObject(TySize, Align, false, AI);
116
117 } else {
Stephen Hines36b56882014-04-23 16:57:46 -0700118 unsigned Align = std::max(
119 (unsigned)TLI->getDataLayout()->getPrefTypeAlignment(
120 AI->getAllocatedType()),
121 AI->getAlignment());
Stephen Hines37ed9c12014-12-01 14:51:49 -0800122 unsigned StackAlign =
123 MF->getSubtarget().getFrameLowering()->getStackAlignment();
Stephen Hines36b56882014-04-23 16:57:46 -0700124 if (Align <= StackAlign)
125 Align = 0;
126 // Inform the Frame Information that we have variable-sized objects.
127 MF->getFrameInfo()->CreateVariableSizedObject(Align ? Align : 1, AI);
128 }
129 }
130
131 // Look for inline asm that clobbers the SP register.
132 if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
133 ImmutableCallSite CS(I);
134 if (isa<InlineAsm>(CS.getCalledValue())) {
135 unsigned SP = TLI->getStackPointerRegisterToSaveRestore();
136 std::vector<TargetLowering::AsmOperandInfo> Ops =
137 TLI->ParseConstraints(CS);
138 for (size_t I = 0, E = Ops.size(); I != E; ++I) {
139 TargetLowering::AsmOperandInfo &Op = Ops[I];
140 if (Op.Type == InlineAsm::isClobber) {
141 // Clobbers don't have SDValue operands, hence SDValue().
142 TLI->ComputeConstraintToUse(Op, SDValue(), DAG);
Stephen Hines37ed9c12014-12-01 14:51:49 -0800143 std::pair<unsigned, const TargetRegisterClass *> PhysReg =
144 TLI->getRegForInlineAsmConstraint(Op.ConstraintCode,
145 Op.ConstraintVT);
Stephen Hines36b56882014-04-23 16:57:46 -0700146 if (PhysReg.first == SP)
147 MF->getFrameInfo()->setHasInlineAsmWithSPAdjust(true);
148 }
149 }
150 }
151 }
152
Stephen Hines37ed9c12014-12-01 14:51:49 -0800153 // Look for calls to the @llvm.va_start intrinsic. We can omit some
154 // prologue boilerplate for variadic functions that don't examine their
155 // arguments.
156 if (const auto *II = dyn_cast<IntrinsicInst>(I)) {
157 if (II->getIntrinsicID() == Intrinsic::vastart)
158 MF->getFrameInfo()->setHasVAStart(true);
159 }
160
161 // If we have a musttail call in a variadic funciton, we need to ensure we
162 // forward implicit register parameters.
163 if (const auto *CI = dyn_cast<CallInst>(I)) {
164 if (CI->isMustTailCall() && Fn->isVarArg())
165 MF->getFrameInfo()->setHasMustTailInVarArgFunc(true);
166 }
167
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000168 // Mark values used outside their block as exported, by allocating
169 // a virtual register for them.
Cameron Zwarich4ecc82e2011-02-22 03:24:52 +0000170 if (isUsedOutsideOfDefiningBlock(I))
Dan Gohman6277eb22009-11-23 17:16:22 +0000171 if (!isa<AllocaInst>(I) ||
172 !StaticAllocaMap.count(cast<AllocaInst>(I)))
173 InitializeRegForValue(I);
174
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000175 // Collect llvm.dbg.declare information. This is done now instead of
176 // during the initial isel pass through the IR so that it is done
177 // in a predictable order.
178 if (const DbgDeclareInst *DI = dyn_cast<DbgDeclareInst>(I)) {
179 MachineModuleInfo &MMI = MF->getMMI();
Manman Rencbafae62013-06-28 05:43:10 +0000180 DIVariable DIVar(DI->getVariable());
181 assert((!DIVar || DIVar.isVariable()) &&
182 "Variable in DbgDeclareInst should be either null or a DIVariable.");
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000183 if (MMI.hasDebugInfo() &&
Manman Rencbafae62013-06-28 05:43:10 +0000184 DIVar &&
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000185 !DI->getDebugLoc().isUnknown()) {
186 // Don't handle byval struct arguments or VLAs, for example.
187 // Non-byval arguments are handled here (they refer to the stack
188 // temporary alloca at this point).
189 const Value *Address = DI->getAddress();
190 if (Address) {
191 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
192 Address = BCI->getOperand(0);
193 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
194 DenseMap<const AllocaInst *, int>::iterator SI =
195 StaticAllocaMap.find(AI);
196 if (SI != StaticAllocaMap.end()) { // Check for VLAs.
197 int FI = SI->second;
Stephen Hines37ed9c12014-12-01 14:51:49 -0800198 MMI.setVariableDbgInfo(DI->getVariable(), DI->getExpression(),
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000199 FI, DI->getDebugLoc());
200 }
201 }
202 }
203 }
204 }
Stephen Hines37ed9c12014-12-01 14:51:49 -0800205
206 // Decide the preferred extend type for a value.
207 PreferredExtendType[I] = getPreferredExtendForValue(I);
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000208 }
209
Dan Gohman6277eb22009-11-23 17:16:22 +0000210 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
211 // also creates the initial PHI MachineInstrs, though none of the input
212 // operands are populated.
Dan Gohmand0d82752010-04-14 16:30:40 +0000213 for (BB = Fn->begin(); BB != EB; ++BB) {
Dan Gohman6277eb22009-11-23 17:16:22 +0000214 MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB);
215 MBBMap[BB] = MBB;
216 MF->push_back(MBB);
217
218 // Transfer the address-taken flag. This is necessary because there could
219 // be multiple MachineBasicBlocks corresponding to one BasicBlock, and only
220 // the first one should be marked.
221 if (BB->hasAddressTaken())
222 MBB->setHasAddressTaken();
223
224 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
225 // appropriate.
Dan Gohman3f1403f2010-04-20 14:46:25 +0000226 for (BasicBlock::const_iterator I = BB->begin();
227 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
228 if (PN->use_empty()) continue;
Dan Gohman6277eb22009-11-23 17:16:22 +0000229
Rafael Espindola3fa82832011-05-13 15:18:06 +0000230 // Skip empty types
231 if (PN->getType()->isEmptyTy())
232 continue;
233
Dan Gohmanc025c852010-04-20 14:48:02 +0000234 DebugLoc DL = PN->getDebugLoc();
Dan Gohman6277eb22009-11-23 17:16:22 +0000235 unsigned PHIReg = ValueMap[PN];
236 assert(PHIReg && "PHI node does not have an assigned virtual register!");
237
238 SmallVector<EVT, 4> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000239 ComputeValueVTs(*TLI, PN->getType(), ValueVTs);
Dan Gohman6277eb22009-11-23 17:16:22 +0000240 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
241 EVT VT = ValueVTs[vti];
Bill Wendling384ceb82013-06-06 00:11:39 +0000242 unsigned NumRegisters = TLI->getNumRegisters(Fn->getContext(), VT);
Stephen Hines37ed9c12014-12-01 14:51:49 -0800243 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
Dan Gohman6277eb22009-11-23 17:16:22 +0000244 for (unsigned i = 0; i != NumRegisters; ++i)
Chris Lattner518bb532010-02-09 19:54:29 +0000245 BuildMI(MBB, DL, TII->get(TargetOpcode::PHI), PHIReg + i);
Dan Gohman6277eb22009-11-23 17:16:22 +0000246 PHIReg += NumRegisters;
247 }
248 }
249 }
Dan Gohmande4c0a72010-04-14 16:32:56 +0000250
251 // Mark landing pad blocks.
252 for (BB = Fn->begin(); BB != EB; ++BB)
Dan Gohmanae541aa2010-04-15 04:33:49 +0000253 if (const InvokeInst *Invoke = dyn_cast<InvokeInst>(BB->getTerminator()))
Dan Gohmande4c0a72010-04-14 16:32:56 +0000254 MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
Dan Gohman6277eb22009-11-23 17:16:22 +0000255}
256
257/// clear - Clear out all the function-specific state. This returns this
258/// FunctionLoweringInfo to an empty state, ready to be used for a
259/// different function.
260void FunctionLoweringInfo::clear() {
Dan Gohman0e026722010-04-14 17:11:23 +0000261 assert(CatchInfoFound.size() == CatchInfoLost.size() &&
262 "Not all catch info was assigned to a landing pad!");
263
Dan Gohman6277eb22009-11-23 17:16:22 +0000264 MBBMap.clear();
265 ValueMap.clear();
266 StaticAllocaMap.clear();
267#ifndef NDEBUG
268 CatchInfoLost.clear();
269 CatchInfoFound.clear();
270#endif
271 LiveOutRegInfo.clear();
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000272 VisitedBBs.clear();
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000273 ArgDbgValues.clear();
Devang Patel0b48ead2010-08-31 22:22:42 +0000274 ByValArgFrameIndexMap.clear();
Dan Gohman84023e02010-07-10 09:00:22 +0000275 RegFixups.clear();
Stephen Hines37ed9c12014-12-01 14:51:49 -0800276 PreferredExtendType.clear();
Dan Gohman6277eb22009-11-23 17:16:22 +0000277}
278
Dan Gohman89496d02010-07-02 00:10:16 +0000279/// CreateReg - Allocate a single virtual register for the given type.
Patrik Hagglunda61b17c2012-12-13 06:34:11 +0000280unsigned FunctionLoweringInfo::CreateReg(MVT VT) {
Stephen Hines37ed9c12014-12-01 14:51:49 -0800281 return RegInfo->createVirtualRegister(
282 MF->getSubtarget().getTargetLowering()->getRegClassFor(VT));
Dan Gohman6277eb22009-11-23 17:16:22 +0000283}
284
Dan Gohman89496d02010-07-02 00:10:16 +0000285/// CreateRegs - Allocate the appropriate number of virtual registers of
Dan Gohman6277eb22009-11-23 17:16:22 +0000286/// the correctly promoted or expanded types. Assign these registers
287/// consecutive vreg numbers and return the first assigned number.
288///
289/// In the case that the given value has struct or array type, this function
290/// will assign registers for each member or element.
291///
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000292unsigned FunctionLoweringInfo::CreateRegs(Type *Ty) {
Stephen Hines37ed9c12014-12-01 14:51:49 -0800293 const TargetLowering *TLI = MF->getSubtarget().getTargetLowering();
Bill Wendlingd626d332013-06-19 20:32:16 +0000294
Dan Gohman6277eb22009-11-23 17:16:22 +0000295 SmallVector<EVT, 4> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000296 ComputeValueVTs(*TLI, Ty, ValueVTs);
Dan Gohman6277eb22009-11-23 17:16:22 +0000297
298 unsigned FirstReg = 0;
299 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
300 EVT ValueVT = ValueVTs[Value];
Bill Wendling384ceb82013-06-06 00:11:39 +0000301 MVT RegisterVT = TLI->getRegisterType(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000302
Bill Wendling384ceb82013-06-06 00:11:39 +0000303 unsigned NumRegs = TLI->getNumRegisters(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000304 for (unsigned i = 0; i != NumRegs; ++i) {
Dan Gohman89496d02010-07-02 00:10:16 +0000305 unsigned R = CreateReg(RegisterVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000306 if (!FirstReg) FirstReg = R;
307 }
308 }
309 return FirstReg;
310}
Dan Gohman66336ed2009-11-23 17:42:46 +0000311
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000312/// GetLiveOutRegInfo - Gets LiveOutInfo for a register, returning NULL if the
313/// register is a PHI destination and the PHI's LiveOutInfo is not valid. If
314/// the register's LiveOutInfo is for a smaller bit width, it is extended to
315/// the larger bit width by zero extension. The bit width must be no smaller
316/// than the LiveOutInfo's existing bit width.
317const FunctionLoweringInfo::LiveOutInfo *
318FunctionLoweringInfo::GetLiveOutRegInfo(unsigned Reg, unsigned BitWidth) {
319 if (!LiveOutRegInfo.inBounds(Reg))
Stephen Hinesdce4a402014-05-29 02:49:00 -0700320 return nullptr;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000321
322 LiveOutInfo *LOI = &LiveOutRegInfo[Reg];
323 if (!LOI->IsValid)
Stephen Hinesdce4a402014-05-29 02:49:00 -0700324 return nullptr;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000325
Cameron Zwarich33b55472011-02-25 01:10:55 +0000326 if (BitWidth > LOI->KnownZero.getBitWidth()) {
Cameron Zwarich8fbbdca2011-02-25 01:11:01 +0000327 LOI->NumSignBits = 1;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000328 LOI->KnownZero = LOI->KnownZero.zextOrTrunc(BitWidth);
329 LOI->KnownOne = LOI->KnownOne.zextOrTrunc(BitWidth);
330 }
331
332 return LOI;
333}
334
335/// ComputePHILiveOutRegInfo - Compute LiveOutInfo for a PHI's destination
336/// register based on the LiveOutInfo of its operands.
337void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000338 Type *Ty = PN->getType();
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000339 if (!Ty->isIntegerTy() || Ty->isVectorTy())
340 return;
341
342 SmallVector<EVT, 1> ValueVTs;
Bill Wendling384ceb82013-06-06 00:11:39 +0000343 ComputeValueVTs(*TLI, Ty, ValueVTs);
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000344 assert(ValueVTs.size() == 1 &&
345 "PHIs with non-vector integer types should have a single VT.");
346 EVT IntVT = ValueVTs[0];
347
Bill Wendling384ceb82013-06-06 00:11:39 +0000348 if (TLI->getNumRegisters(PN->getContext(), IntVT) != 1)
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000349 return;
Bill Wendling384ceb82013-06-06 00:11:39 +0000350 IntVT = TLI->getTypeToTransformTo(PN->getContext(), IntVT);
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000351 unsigned BitWidth = IntVT.getSizeInBits();
352
353 unsigned DestReg = ValueMap[PN];
354 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
355 return;
356 LiveOutRegInfo.grow(DestReg);
357 LiveOutInfo &DestLOI = LiveOutRegInfo[DestReg];
358
359 Value *V = PN->getIncomingValue(0);
360 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
361 DestLOI.NumSignBits = 1;
362 APInt Zero(BitWidth, 0);
363 DestLOI.KnownZero = Zero;
364 DestLOI.KnownOne = Zero;
365 return;
366 }
367
368 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
369 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
370 DestLOI.NumSignBits = Val.getNumSignBits();
371 DestLOI.KnownZero = ~Val;
372 DestLOI.KnownOne = Val;
373 } else {
374 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its"
375 "CopyToReg node was created.");
376 unsigned SrcReg = ValueMap[V];
377 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
378 DestLOI.IsValid = false;
379 return;
380 }
381 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
382 if (!SrcLOI) {
383 DestLOI.IsValid = false;
384 return;
385 }
386 DestLOI = *SrcLOI;
387 }
388
389 assert(DestLOI.KnownZero.getBitWidth() == BitWidth &&
390 DestLOI.KnownOne.getBitWidth() == BitWidth &&
391 "Masks should have the same bit width as the type.");
392
393 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i) {
394 Value *V = PN->getIncomingValue(i);
395 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
396 DestLOI.NumSignBits = 1;
397 APInt Zero(BitWidth, 0);
398 DestLOI.KnownZero = Zero;
399 DestLOI.KnownOne = Zero;
Eric Christopher471e4222011-06-08 23:55:35 +0000400 return;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000401 }
402
403 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
404 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
405 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, Val.getNumSignBits());
406 DestLOI.KnownZero &= ~Val;
407 DestLOI.KnownOne &= Val;
408 continue;
409 }
410
411 assert(ValueMap.count(V) && "V should have been placed in ValueMap when "
412 "its CopyToReg node was created.");
413 unsigned SrcReg = ValueMap[V];
414 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
415 DestLOI.IsValid = false;
416 return;
417 }
418 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
419 if (!SrcLOI) {
420 DestLOI.IsValid = false;
421 return;
422 }
423 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, SrcLOI->NumSignBits);
424 DestLOI.KnownZero &= SrcLOI->KnownZero;
425 DestLOI.KnownOne &= SrcLOI->KnownOne;
426 }
427}
428
Devang Patel9aee3352011-09-08 22:59:09 +0000429/// setArgumentFrameIndex - Record frame index for the byval
Devang Patel0b48ead2010-08-31 22:22:42 +0000430/// argument. This overrides previous frame index entry for this argument,
431/// if any.
Devang Patel9aee3352011-09-08 22:59:09 +0000432void FunctionLoweringInfo::setArgumentFrameIndex(const Argument *A,
Eric Christopher5b13ed12012-02-24 01:59:01 +0000433 int FI) {
Devang Patel0b48ead2010-08-31 22:22:42 +0000434 ByValArgFrameIndexMap[A] = FI;
435}
Eric Christopher471e4222011-06-08 23:55:35 +0000436
Devang Patel9aee3352011-09-08 22:59:09 +0000437/// getArgumentFrameIndex - Get frame index for the byval argument.
Devang Patel0b48ead2010-08-31 22:22:42 +0000438/// If the argument does not have any assigned frame index then 0 is
439/// returned.
Devang Patel9aee3352011-09-08 22:59:09 +0000440int FunctionLoweringInfo::getArgumentFrameIndex(const Argument *A) {
Eric Christopher471e4222011-06-08 23:55:35 +0000441 DenseMap<const Argument *, int>::iterator I =
Devang Patel0b48ead2010-08-31 22:22:42 +0000442 ByValArgFrameIndexMap.find(A);
443 if (I != ByValArgFrameIndexMap.end())
444 return I->second;
Eric Christopher0822e012012-02-23 03:39:43 +0000445 DEBUG(dbgs() << "Argument does not have assigned frame index!\n");
Devang Patel0b48ead2010-08-31 22:22:42 +0000446 return 0;
447}
448
Michael J. Spencerc9c137b2012-02-22 19:06:13 +0000449/// ComputeUsesVAFloatArgument - Determine if any floating-point values are
450/// being passed to this variadic function, and set the MachineModuleInfo's
451/// usesVAFloatArgument flag if so. This flag is used to emit an undefined
452/// reference to _fltused on Windows, which will link in MSVCRT's
453/// floating-point support.
454void llvm::ComputeUsesVAFloatArgument(const CallInst &I,
455 MachineModuleInfo *MMI)
456{
457 FunctionType *FT = cast<FunctionType>(
458 I.getCalledValue()->getType()->getContainedType(0));
459 if (FT->isVarArg() && !MMI->usesVAFloatArgument()) {
460 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
461 Type* T = I.getArgOperand(i)->getType();
462 for (po_iterator<Type*> i = po_begin(T), e = po_end(T);
463 i != e; ++i) {
464 if (i->isFloatingPointTy()) {
465 MMI->setUsesVAFloatArgument(true);
466 return;
467 }
468 }
469 }
470 }
471}
472
Dan Gohman66336ed2009-11-23 17:42:46 +0000473/// AddCatchInfo - Extract the personality and type infos from an eh.selector
474/// call, and add them to the specified machine basic block.
Dan Gohman25208642010-04-14 19:53:31 +0000475void llvm::AddCatchInfo(const CallInst &I, MachineModuleInfo *MMI,
Dan Gohman66336ed2009-11-23 17:42:46 +0000476 MachineBasicBlock *MBB) {
477 // Inform the MachineModuleInfo of the personality for this landing pad.
Gabor Greif15184442010-06-25 08:24:59 +0000478 const ConstantExpr *CE = cast<ConstantExpr>(I.getArgOperand(1));
Dan Gohman66336ed2009-11-23 17:42:46 +0000479 assert(CE->getOpcode() == Instruction::BitCast &&
480 isa<Function>(CE->getOperand(0)) &&
481 "Personality should be a function");
482 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
483
484 // Gather all the type infos for this landing pad and pass them along to
485 // MachineModuleInfo.
Stephen Hines37ed9c12014-12-01 14:51:49 -0800486 std::vector<const GlobalValue *> TyInfo;
Gabor Greife767e6b2010-06-30 13:45:50 +0000487 unsigned N = I.getNumArgOperands();
Dan Gohman66336ed2009-11-23 17:42:46 +0000488
Gabor Greife767e6b2010-06-30 13:45:50 +0000489 for (unsigned i = N - 1; i > 1; --i) {
490 if (const ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(i))) {
Dan Gohman66336ed2009-11-23 17:42:46 +0000491 unsigned FilterLength = CI->getZExtValue();
492 unsigned FirstCatch = i + FilterLength + !FilterLength;
Gabor Greife767e6b2010-06-30 13:45:50 +0000493 assert(FirstCatch <= N && "Invalid filter length");
Dan Gohman66336ed2009-11-23 17:42:46 +0000494
495 if (FirstCatch < N) {
496 TyInfo.reserve(N - FirstCatch);
497 for (unsigned j = FirstCatch; j < N; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000498 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000499 MMI->addCatchTypeInfo(MBB, TyInfo);
500 TyInfo.clear();
501 }
502
503 if (!FilterLength) {
504 // Cleanup.
505 MMI->addCleanup(MBB);
506 } else {
507 // Filter.
508 TyInfo.reserve(FilterLength - 1);
509 for (unsigned j = i + 1; j < FirstCatch; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000510 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000511 MMI->addFilterTypeInfo(MBB, TyInfo);
512 TyInfo.clear();
513 }
514
515 N = i;
516 }
517 }
518
Gabor Greife767e6b2010-06-30 13:45:50 +0000519 if (N > 2) {
520 TyInfo.reserve(N - 2);
521 for (unsigned j = 2; j < N; ++j)
522 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000523 MMI->addCatchTypeInfo(MBB, TyInfo);
524 }
525}
526
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000527/// AddLandingPadInfo - Extract the exception handling information from the
528/// landingpad instruction and add them to the specified machine module info.
529void llvm::AddLandingPadInfo(const LandingPadInst &I, MachineModuleInfo &MMI,
530 MachineBasicBlock *MBB) {
531 MMI.addPersonality(MBB,
532 cast<Function>(I.getPersonalityFn()->stripPointerCasts()));
533
534 if (I.isCleanup())
535 MMI.addCleanup(MBB);
536
537 // FIXME: New EH - Add the clauses in reverse order. This isn't 100% correct,
538 // but we need to do it this way because of how the DWARF EH emitter
539 // processes the clauses.
540 for (unsigned i = I.getNumClauses(); i != 0; --i) {
541 Value *Val = I.getClause(i - 1);
542 if (I.isCatch(i - 1)) {
543 MMI.addCatchTypeInfo(MBB,
Stephen Hines37ed9c12014-12-01 14:51:49 -0800544 dyn_cast<GlobalValue>(Val->stripPointerCasts()));
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000545 } else {
546 // Add filters in a list.
547 Constant *CVal = cast<Constant>(Val);
Stephen Hines37ed9c12014-12-01 14:51:49 -0800548 SmallVector<const GlobalValue*, 4> FilterList;
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000549 for (User::op_iterator
550 II = CVal->op_begin(), IE = CVal->op_end(); II != IE; ++II)
Stephen Hines37ed9c12014-12-01 14:51:49 -0800551 FilterList.push_back(cast<GlobalValue>((*II)->stripPointerCasts()));
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000552
553 MMI.addFilterTypeInfo(MBB, FilterList);
554 }
555 }
556}