blob: 8799effe208831d0c1aba85cc5a407c1982476e5 [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
15#define DEBUG_TYPE "function-lowering-info"
Dan Gohman4c3fd9f2010-07-07 16:01:37 +000016#include "llvm/CodeGen/FunctionLoweringInfo.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +000017#include "llvm/ADT/PostOrderIterator.h"
18#include "llvm/CodeGen/Analysis.h"
19#include "llvm/CodeGen/MachineFrameInfo.h"
20#include "llvm/CodeGen/MachineFunction.h"
21#include "llvm/CodeGen/MachineInstrBuilder.h"
22#include "llvm/CodeGen/MachineModuleInfo.h"
23#include "llvm/CodeGen/MachineRegisterInfo.h"
24#include "llvm/DataLayout.h"
Bill Wendling0bcbd1d2012-06-28 00:05:13 +000025#include "llvm/DebugInfo.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000026#include "llvm/DerivedTypes.h"
27#include "llvm/Function.h"
28#include "llvm/Instructions.h"
Dan Gohman5fca8b12009-11-23 18:12:11 +000029#include "llvm/IntrinsicInst.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000030#include "llvm/LLVMContext.h"
31#include "llvm/Module.h"
Dan Gohman6277eb22009-11-23 17:16:22 +000032#include "llvm/Support/Debug.h"
33#include "llvm/Support/ErrorHandling.h"
34#include "llvm/Support/MathExtras.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
Dan Gohman6277eb22009-11-23 17:16:22 +000042/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by
43/// PHI nodes or outside of the basic block that defines it, or used by a
44/// switch or atomic instruction, which may expand to multiple basic blocks.
Dan Gohmanae541aa2010-04-15 04:33:49 +000045static bool isUsedOutsideOfDefiningBlock(const Instruction *I) {
Dan Gohmand84e8062010-04-20 14:50:13 +000046 if (I->use_empty()) return false;
Dan Gohman6277eb22009-11-23 17:16:22 +000047 if (isa<PHINode>(I)) return true;
Dan Gohmanae541aa2010-04-15 04:33:49 +000048 const BasicBlock *BB = I->getParent();
49 for (Value::const_use_iterator UI = I->use_begin(), E = I->use_end();
Gabor Greif03f09a32010-07-09 16:08:33 +000050 UI != E; ++UI) {
51 const User *U = *UI;
52 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U))
Dan Gohman6277eb22009-11-23 17:16:22 +000053 return true;
Gabor Greif03f09a32010-07-09 16:08:33 +000054 }
Dan Gohman6277eb22009-11-23 17:16:22 +000055 return false;
56}
57
Dan Gohmand858e902010-04-17 15:26:15 +000058FunctionLoweringInfo::FunctionLoweringInfo(const TargetLowering &tli)
Dan Gohman6277eb22009-11-23 17:16:22 +000059 : TLI(tli) {
60}
61
Dan Gohman7451d3e2010-05-29 17:03:36 +000062void FunctionLoweringInfo::set(const Function &fn, MachineFunction &mf) {
Dan Gohman6277eb22009-11-23 17:16:22 +000063 Fn = &fn;
64 MF = &mf;
65 RegInfo = &MF->getRegInfo();
66
Dan Gohman84023e02010-07-10 09:00:22 +000067 // Check whether the function can return without sret-demotion.
68 SmallVector<ISD::OutputArg, 4> Outs;
69 GetReturnInfo(Fn->getReturnType(),
70 Fn->getAttributes().getRetAttributes(), Outs, TLI);
Eric Christopher471e4222011-06-08 23:55:35 +000071 CanLowerReturn = TLI.CanLowerReturn(Fn->getCallingConv(), *MF,
Eric Christopher5b13ed12012-02-24 01:59:01 +000072 Fn->isVarArg(),
Dan Gohman84023e02010-07-10 09:00:22 +000073 Outs, Fn->getContext());
74
Dan Gohman6277eb22009-11-23 17:16:22 +000075 // Initialize the mapping of values to registers. This is only set up for
76 // instruction values that are used outside of the block that defines
77 // them.
Dan Gohmanae541aa2010-04-15 04:33:49 +000078 Function::const_iterator BB = Fn->begin(), EB = Fn->end();
79 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I != E; ++I)
80 if (const AllocaInst *AI = dyn_cast<AllocaInst>(I))
81 if (const ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +000082 Type *Ty = AI->getAllocatedType();
Micah Villmow3574eca2012-10-08 16:38:25 +000083 uint64_t TySize = TLI.getDataLayout()->getTypeAllocSize(Ty);
Dan Gohman6277eb22009-11-23 17:16:22 +000084 unsigned Align =
Micah Villmow3574eca2012-10-08 16:38:25 +000085 std::max((unsigned)TLI.getDataLayout()->getPrefTypeAlignment(Ty),
Dan Gohman6277eb22009-11-23 17:16:22 +000086 AI->getAlignment());
87
88 TySize *= CUI->getZExtValue(); // Get total allocated size.
89 if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects.
Bill Wendlingdfc2c512010-07-27 01:55:19 +000090
91 // The object may need to be placed onto the stack near the stack
92 // protector if one exists. Determine here if this object is a suitable
93 // candidate. I.e., it would trigger the creation of a stack protector.
94 bool MayNeedSP =
95 (AI->isArrayAllocation() ||
Bill Wendling9c674bb2011-11-02 23:20:58 +000096 (TySize >= 8 && isa<ArrayType>(Ty) &&
Bill Wendlingdfc2c512010-07-27 01:55:19 +000097 cast<ArrayType>(Ty)->getElementType()->isIntegerTy(8)));
Dan Gohman6277eb22009-11-23 17:16:22 +000098 StaticAllocaMap[AI] =
Eric Christopher5b13ed12012-02-24 01:59:01 +000099 MF->getFrameInfo()->CreateStackObject(TySize, Align, false,
Nadav Rotemc05d3062012-09-06 09:17:37 +0000100 MayNeedSP, AI);
Dan Gohman6277eb22009-11-23 17:16:22 +0000101 }
102
103 for (; BB != EB; ++BB)
Eric Christopher5b13ed12012-02-24 01:59:01 +0000104 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end();
105 I != E; ++I) {
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000106 // Mark values used outside their block as exported, by allocating
107 // a virtual register for them.
Cameron Zwarich4ecc82e2011-02-22 03:24:52 +0000108 if (isUsedOutsideOfDefiningBlock(I))
Dan Gohman6277eb22009-11-23 17:16:22 +0000109 if (!isa<AllocaInst>(I) ||
110 !StaticAllocaMap.count(cast<AllocaInst>(I)))
111 InitializeRegForValue(I);
112
Dan Gohman9c3d5e42010-07-16 17:54:27 +0000113 // Collect llvm.dbg.declare information. This is done now instead of
114 // during the initial isel pass through the IR so that it is done
115 // in a predictable order.
116 if (const DbgDeclareInst *DI = dyn_cast<DbgDeclareInst>(I)) {
117 MachineModuleInfo &MMI = MF->getMMI();
118 if (MMI.hasDebugInfo() &&
119 DIVariable(DI->getVariable()).Verify() &&
120 !DI->getDebugLoc().isUnknown()) {
121 // Don't handle byval struct arguments or VLAs, for example.
122 // Non-byval arguments are handled here (they refer to the stack
123 // temporary alloca at this point).
124 const Value *Address = DI->getAddress();
125 if (Address) {
126 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address))
127 Address = BCI->getOperand(0);
128 if (const AllocaInst *AI = dyn_cast<AllocaInst>(Address)) {
129 DenseMap<const AllocaInst *, int>::iterator SI =
130 StaticAllocaMap.find(AI);
131 if (SI != StaticAllocaMap.end()) { // Check for VLAs.
132 int FI = SI->second;
133 MMI.setVariableDbgInfo(DI->getVariable(),
134 FI, DI->getDebugLoc());
135 }
136 }
137 }
138 }
139 }
140 }
141
Dan Gohman6277eb22009-11-23 17:16:22 +0000142 // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This
143 // also creates the initial PHI MachineInstrs, though none of the input
144 // operands are populated.
Dan Gohmand0d82752010-04-14 16:30:40 +0000145 for (BB = Fn->begin(); BB != EB; ++BB) {
Dan Gohman6277eb22009-11-23 17:16:22 +0000146 MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB);
147 MBBMap[BB] = MBB;
148 MF->push_back(MBB);
149
150 // Transfer the address-taken flag. This is necessary because there could
151 // be multiple MachineBasicBlocks corresponding to one BasicBlock, and only
152 // the first one should be marked.
153 if (BB->hasAddressTaken())
154 MBB->setHasAddressTaken();
155
156 // Create Machine PHI nodes for LLVM PHI nodes, lowering them as
157 // appropriate.
Dan Gohman3f1403f2010-04-20 14:46:25 +0000158 for (BasicBlock::const_iterator I = BB->begin();
159 const PHINode *PN = dyn_cast<PHINode>(I); ++I) {
160 if (PN->use_empty()) continue;
Dan Gohman6277eb22009-11-23 17:16:22 +0000161
Rafael Espindola3fa82832011-05-13 15:18:06 +0000162 // Skip empty types
163 if (PN->getType()->isEmptyTy())
164 continue;
165
Dan Gohmanc025c852010-04-20 14:48:02 +0000166 DebugLoc DL = PN->getDebugLoc();
Dan Gohman6277eb22009-11-23 17:16:22 +0000167 unsigned PHIReg = ValueMap[PN];
168 assert(PHIReg && "PHI node does not have an assigned virtual register!");
169
170 SmallVector<EVT, 4> ValueVTs;
171 ComputeValueVTs(TLI, PN->getType(), ValueVTs);
172 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
173 EVT VT = ValueVTs[vti];
174 unsigned NumRegisters = TLI.getNumRegisters(Fn->getContext(), VT);
175 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
176 for (unsigned i = 0; i != NumRegisters; ++i)
Chris Lattner518bb532010-02-09 19:54:29 +0000177 BuildMI(MBB, DL, TII->get(TargetOpcode::PHI), PHIReg + i);
Dan Gohman6277eb22009-11-23 17:16:22 +0000178 PHIReg += NumRegisters;
179 }
180 }
181 }
Dan Gohmande4c0a72010-04-14 16:32:56 +0000182
183 // Mark landing pad blocks.
184 for (BB = Fn->begin(); BB != EB; ++BB)
Dan Gohmanae541aa2010-04-15 04:33:49 +0000185 if (const InvokeInst *Invoke = dyn_cast<InvokeInst>(BB->getTerminator()))
Dan Gohmande4c0a72010-04-14 16:32:56 +0000186 MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad();
Dan Gohman6277eb22009-11-23 17:16:22 +0000187}
188
189/// clear - Clear out all the function-specific state. This returns this
190/// FunctionLoweringInfo to an empty state, ready to be used for a
191/// different function.
192void FunctionLoweringInfo::clear() {
Dan Gohman0e026722010-04-14 17:11:23 +0000193 assert(CatchInfoFound.size() == CatchInfoLost.size() &&
194 "Not all catch info was assigned to a landing pad!");
195
Dan Gohman6277eb22009-11-23 17:16:22 +0000196 MBBMap.clear();
197 ValueMap.clear();
198 StaticAllocaMap.clear();
199#ifndef NDEBUG
200 CatchInfoLost.clear();
201 CatchInfoFound.clear();
202#endif
203 LiveOutRegInfo.clear();
Cameron Zwaricha46cd972011-02-24 10:00:13 +0000204 VisitedBBs.clear();
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000205 ArgDbgValues.clear();
Devang Patel0b48ead2010-08-31 22:22:42 +0000206 ByValArgFrameIndexMap.clear();
Dan Gohman84023e02010-07-10 09:00:22 +0000207 RegFixups.clear();
Dan Gohman6277eb22009-11-23 17:16:22 +0000208}
209
Dan Gohman89496d02010-07-02 00:10:16 +0000210/// CreateReg - Allocate a single virtual register for the given type.
211unsigned FunctionLoweringInfo::CreateReg(EVT VT) {
Dan Gohman6277eb22009-11-23 17:16:22 +0000212 return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT));
213}
214
Dan Gohman89496d02010-07-02 00:10:16 +0000215/// CreateRegs - Allocate the appropriate number of virtual registers of
Dan Gohman6277eb22009-11-23 17:16:22 +0000216/// the correctly promoted or expanded types. Assign these registers
217/// consecutive vreg numbers and return the first assigned number.
218///
219/// In the case that the given value has struct or array type, this function
220/// will assign registers for each member or element.
221///
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000222unsigned FunctionLoweringInfo::CreateRegs(Type *Ty) {
Dan Gohman6277eb22009-11-23 17:16:22 +0000223 SmallVector<EVT, 4> ValueVTs;
Dan Gohmanffda6ba2010-07-01 03:55:39 +0000224 ComputeValueVTs(TLI, Ty, ValueVTs);
Dan Gohman6277eb22009-11-23 17:16:22 +0000225
226 unsigned FirstReg = 0;
227 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
228 EVT ValueVT = ValueVTs[Value];
Dan Gohmanffda6ba2010-07-01 03:55:39 +0000229 EVT RegisterVT = TLI.getRegisterType(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000230
Dan Gohmanffda6ba2010-07-01 03:55:39 +0000231 unsigned NumRegs = TLI.getNumRegisters(Ty->getContext(), ValueVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000232 for (unsigned i = 0; i != NumRegs; ++i) {
Dan Gohman89496d02010-07-02 00:10:16 +0000233 unsigned R = CreateReg(RegisterVT);
Dan Gohman6277eb22009-11-23 17:16:22 +0000234 if (!FirstReg) FirstReg = R;
235 }
236 }
237 return FirstReg;
238}
Dan Gohman66336ed2009-11-23 17:42:46 +0000239
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000240/// GetLiveOutRegInfo - Gets LiveOutInfo for a register, returning NULL if the
241/// register is a PHI destination and the PHI's LiveOutInfo is not valid. If
242/// the register's LiveOutInfo is for a smaller bit width, it is extended to
243/// the larger bit width by zero extension. The bit width must be no smaller
244/// than the LiveOutInfo's existing bit width.
245const FunctionLoweringInfo::LiveOutInfo *
246FunctionLoweringInfo::GetLiveOutRegInfo(unsigned Reg, unsigned BitWidth) {
247 if (!LiveOutRegInfo.inBounds(Reg))
248 return NULL;
249
250 LiveOutInfo *LOI = &LiveOutRegInfo[Reg];
251 if (!LOI->IsValid)
252 return NULL;
253
Cameron Zwarich33b55472011-02-25 01:10:55 +0000254 if (BitWidth > LOI->KnownZero.getBitWidth()) {
Cameron Zwarich8fbbdca2011-02-25 01:11:01 +0000255 LOI->NumSignBits = 1;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000256 LOI->KnownZero = LOI->KnownZero.zextOrTrunc(BitWidth);
257 LOI->KnownOne = LOI->KnownOne.zextOrTrunc(BitWidth);
258 }
259
260 return LOI;
261}
262
263/// ComputePHILiveOutRegInfo - Compute LiveOutInfo for a PHI's destination
264/// register based on the LiveOutInfo of its operands.
265void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000266 Type *Ty = PN->getType();
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000267 if (!Ty->isIntegerTy() || Ty->isVectorTy())
268 return;
269
270 SmallVector<EVT, 1> ValueVTs;
271 ComputeValueVTs(TLI, Ty, ValueVTs);
272 assert(ValueVTs.size() == 1 &&
273 "PHIs with non-vector integer types should have a single VT.");
274 EVT IntVT = ValueVTs[0];
275
276 if (TLI.getNumRegisters(PN->getContext(), IntVT) != 1)
277 return;
278 IntVT = TLI.getTypeToTransformTo(PN->getContext(), IntVT);
279 unsigned BitWidth = IntVT.getSizeInBits();
280
281 unsigned DestReg = ValueMap[PN];
282 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
283 return;
284 LiveOutRegInfo.grow(DestReg);
285 LiveOutInfo &DestLOI = LiveOutRegInfo[DestReg];
286
287 Value *V = PN->getIncomingValue(0);
288 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
289 DestLOI.NumSignBits = 1;
290 APInt Zero(BitWidth, 0);
291 DestLOI.KnownZero = Zero;
292 DestLOI.KnownOne = Zero;
293 return;
294 }
295
296 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
297 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
298 DestLOI.NumSignBits = Val.getNumSignBits();
299 DestLOI.KnownZero = ~Val;
300 DestLOI.KnownOne = Val;
301 } else {
302 assert(ValueMap.count(V) && "V should have been placed in ValueMap when its"
303 "CopyToReg node was created.");
304 unsigned SrcReg = ValueMap[V];
305 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
306 DestLOI.IsValid = false;
307 return;
308 }
309 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
310 if (!SrcLOI) {
311 DestLOI.IsValid = false;
312 return;
313 }
314 DestLOI = *SrcLOI;
315 }
316
317 assert(DestLOI.KnownZero.getBitWidth() == BitWidth &&
318 DestLOI.KnownOne.getBitWidth() == BitWidth &&
319 "Masks should have the same bit width as the type.");
320
321 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i) {
322 Value *V = PN->getIncomingValue(i);
323 if (isa<UndefValue>(V) || isa<ConstantExpr>(V)) {
324 DestLOI.NumSignBits = 1;
325 APInt Zero(BitWidth, 0);
326 DestLOI.KnownZero = Zero;
327 DestLOI.KnownOne = Zero;
Eric Christopher471e4222011-06-08 23:55:35 +0000328 return;
Cameron Zwarich8ca814c2011-02-24 10:00:25 +0000329 }
330
331 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
332 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
333 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, Val.getNumSignBits());
334 DestLOI.KnownZero &= ~Val;
335 DestLOI.KnownOne &= Val;
336 continue;
337 }
338
339 assert(ValueMap.count(V) && "V should have been placed in ValueMap when "
340 "its CopyToReg node was created.");
341 unsigned SrcReg = ValueMap[V];
342 if (!TargetRegisterInfo::isVirtualRegister(SrcReg)) {
343 DestLOI.IsValid = false;
344 return;
345 }
346 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
347 if (!SrcLOI) {
348 DestLOI.IsValid = false;
349 return;
350 }
351 DestLOI.NumSignBits = std::min(DestLOI.NumSignBits, SrcLOI->NumSignBits);
352 DestLOI.KnownZero &= SrcLOI->KnownZero;
353 DestLOI.KnownOne &= SrcLOI->KnownOne;
354 }
355}
356
Devang Patel9aee3352011-09-08 22:59:09 +0000357/// setArgumentFrameIndex - Record frame index for the byval
Devang Patel0b48ead2010-08-31 22:22:42 +0000358/// argument. This overrides previous frame index entry for this argument,
359/// if any.
Devang Patel9aee3352011-09-08 22:59:09 +0000360void FunctionLoweringInfo::setArgumentFrameIndex(const Argument *A,
Eric Christopher5b13ed12012-02-24 01:59:01 +0000361 int FI) {
Devang Patel0b48ead2010-08-31 22:22:42 +0000362 ByValArgFrameIndexMap[A] = FI;
363}
Eric Christopher471e4222011-06-08 23:55:35 +0000364
Devang Patel9aee3352011-09-08 22:59:09 +0000365/// getArgumentFrameIndex - Get frame index for the byval argument.
Devang Patel0b48ead2010-08-31 22:22:42 +0000366/// If the argument does not have any assigned frame index then 0 is
367/// returned.
Devang Patel9aee3352011-09-08 22:59:09 +0000368int FunctionLoweringInfo::getArgumentFrameIndex(const Argument *A) {
Eric Christopher471e4222011-06-08 23:55:35 +0000369 DenseMap<const Argument *, int>::iterator I =
Devang Patel0b48ead2010-08-31 22:22:42 +0000370 ByValArgFrameIndexMap.find(A);
371 if (I != ByValArgFrameIndexMap.end())
372 return I->second;
Eric Christopher0822e012012-02-23 03:39:43 +0000373 DEBUG(dbgs() << "Argument does not have assigned frame index!\n");
Devang Patel0b48ead2010-08-31 22:22:42 +0000374 return 0;
375}
376
Michael J. Spencerc9c137b2012-02-22 19:06:13 +0000377/// ComputeUsesVAFloatArgument - Determine if any floating-point values are
378/// being passed to this variadic function, and set the MachineModuleInfo's
379/// usesVAFloatArgument flag if so. This flag is used to emit an undefined
380/// reference to _fltused on Windows, which will link in MSVCRT's
381/// floating-point support.
382void llvm::ComputeUsesVAFloatArgument(const CallInst &I,
383 MachineModuleInfo *MMI)
384{
385 FunctionType *FT = cast<FunctionType>(
386 I.getCalledValue()->getType()->getContainedType(0));
387 if (FT->isVarArg() && !MMI->usesVAFloatArgument()) {
388 for (unsigned i = 0, e = I.getNumArgOperands(); i != e; ++i) {
389 Type* T = I.getArgOperand(i)->getType();
390 for (po_iterator<Type*> i = po_begin(T), e = po_end(T);
391 i != e; ++i) {
392 if (i->isFloatingPointTy()) {
393 MMI->setUsesVAFloatArgument(true);
394 return;
395 }
396 }
397 }
398 }
399}
400
Dan Gohman66336ed2009-11-23 17:42:46 +0000401/// AddCatchInfo - Extract the personality and type infos from an eh.selector
402/// call, and add them to the specified machine basic block.
Dan Gohman25208642010-04-14 19:53:31 +0000403void llvm::AddCatchInfo(const CallInst &I, MachineModuleInfo *MMI,
Dan Gohman66336ed2009-11-23 17:42:46 +0000404 MachineBasicBlock *MBB) {
405 // Inform the MachineModuleInfo of the personality for this landing pad.
Gabor Greif15184442010-06-25 08:24:59 +0000406 const ConstantExpr *CE = cast<ConstantExpr>(I.getArgOperand(1));
Dan Gohman66336ed2009-11-23 17:42:46 +0000407 assert(CE->getOpcode() == Instruction::BitCast &&
408 isa<Function>(CE->getOperand(0)) &&
409 "Personality should be a function");
410 MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0)));
411
412 // Gather all the type infos for this landing pad and pass them along to
413 // MachineModuleInfo.
Dan Gohman46510a72010-04-15 01:51:59 +0000414 std::vector<const GlobalVariable *> TyInfo;
Gabor Greife767e6b2010-06-30 13:45:50 +0000415 unsigned N = I.getNumArgOperands();
Dan Gohman66336ed2009-11-23 17:42:46 +0000416
Gabor Greife767e6b2010-06-30 13:45:50 +0000417 for (unsigned i = N - 1; i > 1; --i) {
418 if (const ConstantInt *CI = dyn_cast<ConstantInt>(I.getArgOperand(i))) {
Dan Gohman66336ed2009-11-23 17:42:46 +0000419 unsigned FilterLength = CI->getZExtValue();
420 unsigned FirstCatch = i + FilterLength + !FilterLength;
Gabor Greife767e6b2010-06-30 13:45:50 +0000421 assert(FirstCatch <= N && "Invalid filter length");
Dan Gohman66336ed2009-11-23 17:42:46 +0000422
423 if (FirstCatch < N) {
424 TyInfo.reserve(N - FirstCatch);
425 for (unsigned j = FirstCatch; j < N; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000426 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000427 MMI->addCatchTypeInfo(MBB, TyInfo);
428 TyInfo.clear();
429 }
430
431 if (!FilterLength) {
432 // Cleanup.
433 MMI->addCleanup(MBB);
434 } else {
435 // Filter.
436 TyInfo.reserve(FilterLength - 1);
437 for (unsigned j = i + 1; j < FirstCatch; ++j)
Gabor Greife767e6b2010-06-30 13:45:50 +0000438 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000439 MMI->addFilterTypeInfo(MBB, TyInfo);
440 TyInfo.clear();
441 }
442
443 N = i;
444 }
445 }
446
Gabor Greife767e6b2010-06-30 13:45:50 +0000447 if (N > 2) {
448 TyInfo.reserve(N - 2);
449 for (unsigned j = 2; j < N; ++j)
450 TyInfo.push_back(ExtractTypeInfo(I.getArgOperand(j)));
Dan Gohman66336ed2009-11-23 17:42:46 +0000451 MMI->addCatchTypeInfo(MBB, TyInfo);
452 }
453}
454
Bill Wendling2ac0e6b2011-08-17 21:56:44 +0000455/// AddLandingPadInfo - Extract the exception handling information from the
456/// landingpad instruction and add them to the specified machine module info.
457void llvm::AddLandingPadInfo(const LandingPadInst &I, MachineModuleInfo &MMI,
458 MachineBasicBlock *MBB) {
459 MMI.addPersonality(MBB,
460 cast<Function>(I.getPersonalityFn()->stripPointerCasts()));
461
462 if (I.isCleanup())
463 MMI.addCleanup(MBB);
464
465 // FIXME: New EH - Add the clauses in reverse order. This isn't 100% correct,
466 // but we need to do it this way because of how the DWARF EH emitter
467 // processes the clauses.
468 for (unsigned i = I.getNumClauses(); i != 0; --i) {
469 Value *Val = I.getClause(i - 1);
470 if (I.isCatch(i - 1)) {
471 MMI.addCatchTypeInfo(MBB,
472 dyn_cast<GlobalVariable>(Val->stripPointerCasts()));
473 } else {
474 // Add filters in a list.
475 Constant *CVal = cast<Constant>(Val);
476 SmallVector<const GlobalVariable*, 4> FilterList;
477 for (User::op_iterator
478 II = CVal->op_begin(), IE = CVal->op_end(); II != IE; ++II)
479 FilterList.push_back(cast<GlobalVariable>((*II)->stripPointerCasts()));
480
481 MMI.addFilterTypeInfo(MBB, FilterList);
482 }
483 }
484}