blob: 73b71b2f6260baaa166d317c745d2921a57c7678 [file] [log] [blame]
Reid Spencer5f016e22007-07-11 17:01:13 +00001//===--- CodeGenFunction.cpp - Emit LLVM Code from ASTs for a Function ----===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner0bc735f2007-12-29 19:59:25 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Reid Spencer5f016e22007-07-11 17:01:13 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This coordinates the per-function state used while generating code.
11//
12//===----------------------------------------------------------------------===//
13
14#include "CodeGenFunction.h"
15#include "CodeGenModule.h"
Eli Friedman3f2af102008-05-22 01:40:10 +000016#include "CGDebugInfo.h"
Reid Spencer5f016e22007-07-11 17:01:13 +000017#include "clang/Basic/TargetInfo.h"
Chris Lattner31a09842008-11-12 08:04:58 +000018#include "clang/AST/APValue.h"
Daniel Dunbarde7fb842008-08-11 05:00:27 +000019#include "clang/AST/ASTContext.h"
Daniel Dunbarc4a1dea2008-08-11 05:35:13 +000020#include "clang/AST/Decl.h"
Devang Pateld9363c32007-09-28 21:49:18 +000021#include "llvm/Support/CFG.h"
Reid Spencer5f016e22007-07-11 17:01:13 +000022using namespace clang;
23using namespace CodeGen;
24
25CodeGenFunction::CodeGenFunction(CodeGenModule &cgm)
Devang Patelc049e4f2007-10-08 20:57:48 +000026 : CGM(cgm), Target(CGM.getContext().Target), SwitchInsn(NULL),
Chris Lattner41110242008-06-17 18:05:57 +000027 CaseRangeBlock(NULL) {
28 LLVMIntTy = ConvertType(getContext().IntTy);
29 LLVMPointerWidth = Target.getPointerWidth(0);
30}
Reid Spencer5f016e22007-07-11 17:01:13 +000031
32ASTContext &CodeGenFunction::getContext() const {
33 return CGM.getContext();
34}
35
36
37llvm::BasicBlock *CodeGenFunction::getBasicBlockForLabel(const LabelStmt *S) {
38 llvm::BasicBlock *&BB = LabelMap[S];
39 if (BB) return BB;
40
41 // Create, but don't insert, the new block.
Daniel Dunbar55e87422008-11-11 02:29:29 +000042 return BB = createBasicBlock(S->getName());
Reid Spencer5f016e22007-07-11 17:01:13 +000043}
44
Lauro Ramos Venancio81373352008-02-26 21:41:45 +000045llvm::Constant *
Steve Naroff248a7532008-04-15 22:42:06 +000046CodeGenFunction::GetAddrOfStaticLocalVar(const VarDecl *BVD) {
Lauro Ramos Venancio81373352008-02-26 21:41:45 +000047 return cast<llvm::Constant>(LocalDeclMap[BVD]);
48}
Reid Spencer5f016e22007-07-11 17:01:13 +000049
Anders Carlssondde0a942008-09-11 09:15:33 +000050llvm::Value *CodeGenFunction::GetAddrOfLocalVar(const VarDecl *VD)
51{
52 return LocalDeclMap[VD];
53}
54
Reid Spencer5f016e22007-07-11 17:01:13 +000055const llvm::Type *CodeGenFunction::ConvertType(QualType T) {
56 return CGM.getTypes().ConvertType(T);
57}
58
Chris Lattner41110242008-06-17 18:05:57 +000059bool CodeGenFunction::isObjCPointerType(QualType T) {
60 // All Objective-C types are pointers.
61 return T->isObjCInterfaceType() ||
62 T->isObjCQualifiedInterfaceType() || T->isObjCQualifiedIdType();
63}
64
Reid Spencer5f016e22007-07-11 17:01:13 +000065bool CodeGenFunction::hasAggregateLLVMType(QualType T) {
Chris Lattner41110242008-06-17 18:05:57 +000066 return !isObjCPointerType(T) &&!T->isRealType() && !T->isPointerLikeType() &&
67 !T->isVoidType() && !T->isVectorType() && !T->isFunctionType();
Reid Spencer5f016e22007-07-11 17:01:13 +000068}
69
Daniel Dunbaraf05bb92008-08-26 08:29:31 +000070void CodeGenFunction::FinishFunction(SourceLocation EndLoc) {
Daniel Dunbar0ffb1252008-08-04 16:51:22 +000071 // Finish emission of indirect switches.
72 EmitIndirectSwitches();
73
Chris Lattnerda138702007-07-16 21:28:45 +000074 assert(BreakContinueStack.empty() &&
75 "mismatched push/pop in break/continue stack!");
Daniel Dunbar5ca20842008-09-09 21:00:17 +000076
Daniel Dunbarb01d1912008-09-27 07:15:59 +000077 // Emit function epilog (to return). This has the nice side effect
78 // of also automatically handling code that falls off the end.
79 EmitBlock(ReturnBlock);
Daniel Dunbarf5bd45c2008-11-11 20:59:54 +000080
81 // Emit debug descriptor for function end.
82 if (CGDebugInfo *DI = CGM.getDebugInfo()) {
83 DI->setLocation(EndLoc);
84 DI->EmitRegionEnd(CurFn, Builder);
85 }
86
Daniel Dunbar17b708d2008-09-09 23:27:19 +000087 EmitFunctionEpilog(FnRetTy, ReturnValue);
Daniel Dunbar5ca20842008-09-09 21:00:17 +000088
Chris Lattner5a2fa142007-12-02 06:32:24 +000089 // Remove the AllocaInsertPt instruction, which is just a convenience for us.
90 AllocaInsertPt->eraseFromParent();
91 AllocaInsertPt = 0;
Reid Spencer5f016e22007-07-11 17:01:13 +000092}
93
Daniel Dunbar7c086512008-09-09 23:14:03 +000094void CodeGenFunction::StartFunction(const Decl *D, QualType RetTy,
95 llvm::Function *Fn,
Daniel Dunbar2284ac92008-10-18 18:22:23 +000096 const FunctionArgList &Args,
97 SourceLocation StartLoc) {
Daniel Dunbar7c086512008-09-09 23:14:03 +000098 CurFuncDecl = D;
99 FnRetTy = RetTy;
Daniel Dunbarbd012ff2008-07-29 23:18:29 +0000100 CurFn = Fn;
Chris Lattner41110242008-06-17 18:05:57 +0000101 assert(CurFn->isDeclaration() && "Function already has body?");
102
Daniel Dunbar55e87422008-11-11 02:29:29 +0000103 llvm::BasicBlock *EntryBB = createBasicBlock("entry", CurFn);
Daniel Dunbar5ca20842008-09-09 21:00:17 +0000104
Chris Lattner41110242008-06-17 18:05:57 +0000105 // Create a marker to make it easy to insert allocas into the entryblock
106 // later. Don't create this with the builder, because we don't want it
107 // folded.
108 llvm::Value *Undef = llvm::UndefValue::get(llvm::Type::Int32Ty);
109 AllocaInsertPt = new llvm::BitCastInst(Undef, llvm::Type::Int32Ty, "allocapt",
110 EntryBB);
Daniel Dunbar5ca20842008-09-09 21:00:17 +0000111
Daniel Dunbar55e87422008-11-11 02:29:29 +0000112 ReturnBlock = createBasicBlock("return");
Daniel Dunbar5ca20842008-09-09 21:00:17 +0000113 ReturnValue = 0;
Daniel Dunbar7c086512008-09-09 23:14:03 +0000114 if (!RetTy->isVoidType())
115 ReturnValue = CreateTempAlloca(ConvertType(RetTy), "retval");
Daniel Dunbar5ca20842008-09-09 21:00:17 +0000116
Chris Lattner41110242008-06-17 18:05:57 +0000117 Builder.SetInsertPoint(EntryBB);
118
Sanjiv Guptaaf994172008-07-04 11:04:26 +0000119 // Emit subprogram debug descriptor.
Daniel Dunbar7c086512008-09-09 23:14:03 +0000120 // FIXME: The cast here is a huge hack.
Daniel Dunbar2284ac92008-10-18 18:22:23 +0000121 if (CGDebugInfo *DI = CGM.getDebugInfo()) {
122 DI->setLocation(StartLoc);
123 if (const FunctionDecl *FD = dyn_cast<FunctionDecl>(D)) {
Chris Lattner8ec03f52008-11-24 03:54:41 +0000124 DI->EmitFunctionStart(FD->getIdentifier()->getName(),
125 RetTy, CurFn, Builder);
Daniel Dunbar2284ac92008-10-18 18:22:23 +0000126 } else {
127 // Just use LLVM function name.
128 DI->EmitFunctionStart(Fn->getName().c_str(),
129 RetTy, CurFn, Builder);
Sanjiv Guptaaf994172008-07-04 11:04:26 +0000130 }
Sanjiv Guptaaf994172008-07-04 11:04:26 +0000131 }
132
Daniel Dunbar17b708d2008-09-09 23:27:19 +0000133 EmitFunctionProlog(CurFn, FnRetTy, Args);
Anders Carlsson751358f2008-12-20 21:28:43 +0000134
135 // If any of the arguments have a variably modified type, make sure to
136 // emit the type size.
137 for (FunctionArgList::const_iterator i = Args.begin(), e = Args.end();
138 i != e; ++i) {
139 QualType Ty = i->second;
140
141 if (Ty->isVariablyModifiedType())
142 EmitVLASize(Ty);
143 }
Daniel Dunbar7c086512008-09-09 23:14:03 +0000144}
Eli Friedmaneb4b7052008-08-25 21:31:01 +0000145
Daniel Dunbar7c086512008-09-09 23:14:03 +0000146void CodeGenFunction::GenerateCode(const FunctionDecl *FD,
147 llvm::Function *Fn) {
148 FunctionArgList Args;
Eli Friedmaneb4b7052008-08-25 21:31:01 +0000149 if (FD->getNumParams()) {
150 const FunctionTypeProto* FProto = FD->getType()->getAsFunctionTypeProto();
151 assert(FProto && "Function def must have prototype!");
Daniel Dunbar7c086512008-09-09 23:14:03 +0000152
153 for (unsigned i = 0, e = FD->getNumParams(); i != e; ++i)
154 Args.push_back(std::make_pair(FD->getParamDecl(i),
155 FProto->getArgType(i)));
Chris Lattner41110242008-06-17 18:05:57 +0000156 }
Daniel Dunbaraf05bb92008-08-26 08:29:31 +0000157
Daniel Dunbar2284ac92008-10-18 18:22:23 +0000158 StartFunction(FD, FD->getResultType(), Fn, Args,
159 cast<CompoundStmt>(FD->getBody())->getLBracLoc());
Daniel Dunbar7c086512008-09-09 23:14:03 +0000160
Daniel Dunbaraf05bb92008-08-26 08:29:31 +0000161 EmitStmt(FD->getBody());
162
163 const CompoundStmt *S = dyn_cast<CompoundStmt>(FD->getBody());
164 if (S) {
165 FinishFunction(S->getRBracLoc());
166 } else {
167 FinishFunction();
168 }
Chris Lattner41110242008-06-17 18:05:57 +0000169}
170
Chris Lattner0946ccd2008-11-11 07:41:27 +0000171/// ContainsLabel - Return true if the statement contains a label in it. If
172/// this statement is not executed normally, it not containing a label means
173/// that we can just remove the code.
174bool CodeGenFunction::ContainsLabel(const Stmt *S, bool IgnoreCaseStmts) {
175 // Null statement, not a label!
176 if (S == 0) return false;
177
178 // If this is a label, we have to emit the code, consider something like:
179 // if (0) { ... foo: bar(); } goto foo;
180 if (isa<LabelStmt>(S))
181 return true;
182
183 // If this is a case/default statement, and we haven't seen a switch, we have
184 // to emit the code.
185 if (isa<SwitchCase>(S) && !IgnoreCaseStmts)
186 return true;
187
188 // If this is a switch statement, we want to ignore cases below it.
189 if (isa<SwitchStmt>(S))
190 IgnoreCaseStmts = true;
191
192 // Scan subexpressions for verboten labels.
193 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
194 I != E; ++I)
195 if (ContainsLabel(*I, IgnoreCaseStmts))
196 return true;
197
198 return false;
199}
200
Chris Lattner31a09842008-11-12 08:04:58 +0000201
202/// ConstantFoldsToSimpleInteger - If the sepcified expression does not fold to
203/// a constant, or if it does but contains a label, return 0. If it constant
204/// folds to 'true' and does not contain a label, return 1, if it constant folds
205/// to 'false' and does not contain a label, return -1.
206int CodeGenFunction::ConstantFoldsToSimpleInteger(const Expr *Cond) {
Daniel Dunbar36bc14c2008-11-12 22:37:10 +0000207 // FIXME: Rename and handle conversion of other evaluatable things
208 // to bool.
Anders Carlsson64712f12008-12-01 02:46:24 +0000209 Expr::EvalResult Result;
210 if (!Cond->Evaluate(Result, getContext()) || !Result.Val.isInt() ||
211 Result.HasSideEffects)
Anders Carlssonef5a66d2008-11-22 22:32:07 +0000212 return 0; // Not foldable, not integer or not fully evaluatable.
Chris Lattner31a09842008-11-12 08:04:58 +0000213
214 if (CodeGenFunction::ContainsLabel(Cond))
215 return 0; // Contains a label.
216
Anders Carlsson64712f12008-12-01 02:46:24 +0000217 return Result.Val.getInt().getBoolValue() ? 1 : -1;
Chris Lattner31a09842008-11-12 08:04:58 +0000218}
219
220
221/// EmitBranchOnBoolExpr - Emit a branch on a boolean condition (e.g. for an if
222/// statement) to the specified blocks. Based on the condition, this might try
223/// to simplify the codegen of the conditional based on the branch.
224///
225void CodeGenFunction::EmitBranchOnBoolExpr(const Expr *Cond,
226 llvm::BasicBlock *TrueBlock,
227 llvm::BasicBlock *FalseBlock) {
228 if (const ParenExpr *PE = dyn_cast<ParenExpr>(Cond))
229 return EmitBranchOnBoolExpr(PE->getSubExpr(), TrueBlock, FalseBlock);
230
231 if (const BinaryOperator *CondBOp = dyn_cast<BinaryOperator>(Cond)) {
232 // Handle X && Y in a condition.
233 if (CondBOp->getOpcode() == BinaryOperator::LAnd) {
234 // If we have "1 && X", simplify the code. "0 && X" would have constant
235 // folded if the case was simple enough.
236 if (ConstantFoldsToSimpleInteger(CondBOp->getLHS()) == 1) {
237 // br(1 && X) -> br(X).
238 return EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock);
239 }
240
241 // If we have "X && 1", simplify the code to use an uncond branch.
242 // "X && 0" would have been constant folded to 0.
243 if (ConstantFoldsToSimpleInteger(CondBOp->getRHS()) == 1) {
244 // br(X && 1) -> br(X).
245 return EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, FalseBlock);
246 }
247
248 // Emit the LHS as a conditional. If the LHS conditional is false, we
249 // want to jump to the FalseBlock.
Daniel Dunbar9615ecb2008-11-13 01:38:36 +0000250 llvm::BasicBlock *LHSTrue = createBasicBlock("land.lhs.true");
Chris Lattner31a09842008-11-12 08:04:58 +0000251 EmitBranchOnBoolExpr(CondBOp->getLHS(), LHSTrue, FalseBlock);
252 EmitBlock(LHSTrue);
253
254 EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock);
255 return;
256 } else if (CondBOp->getOpcode() == BinaryOperator::LOr) {
257 // If we have "0 || X", simplify the code. "1 || X" would have constant
258 // folded if the case was simple enough.
259 if (ConstantFoldsToSimpleInteger(CondBOp->getLHS()) == -1) {
260 // br(0 || X) -> br(X).
261 return EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock);
262 }
263
264 // If we have "X || 0", simplify the code to use an uncond branch.
265 // "X || 1" would have been constant folded to 1.
266 if (ConstantFoldsToSimpleInteger(CondBOp->getRHS()) == -1) {
267 // br(X || 0) -> br(X).
268 return EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, FalseBlock);
269 }
270
271 // Emit the LHS as a conditional. If the LHS conditional is true, we
272 // want to jump to the TrueBlock.
Daniel Dunbar9615ecb2008-11-13 01:38:36 +0000273 llvm::BasicBlock *LHSFalse = createBasicBlock("lor.lhs.false");
Chris Lattner31a09842008-11-12 08:04:58 +0000274 EmitBranchOnBoolExpr(CondBOp->getLHS(), TrueBlock, LHSFalse);
275 EmitBlock(LHSFalse);
276
277 EmitBranchOnBoolExpr(CondBOp->getRHS(), TrueBlock, FalseBlock);
278 return;
279 }
Chris Lattner552f4c42008-11-12 08:13:36 +0000280 }
281
282 if (const UnaryOperator *CondUOp = dyn_cast<UnaryOperator>(Cond)) {
283 // br(!x, t, f) -> br(x, f, t)
284 if (CondUOp->getOpcode() == UnaryOperator::LNot)
285 return EmitBranchOnBoolExpr(CondUOp->getSubExpr(), FalseBlock, TrueBlock);
Chris Lattner31a09842008-11-12 08:04:58 +0000286 }
287
Daniel Dunbar09b14892008-11-12 10:30:32 +0000288 if (const ConditionalOperator *CondOp = dyn_cast<ConditionalOperator>(Cond)) {
289 // Handle ?: operator.
290
291 // Just ignore GNU ?: extension.
292 if (CondOp->getLHS()) {
293 // br(c ? x : y, t, f) -> br(c, br(x, t, f), br(y, t, f))
294 llvm::BasicBlock *LHSBlock = createBasicBlock("cond.true");
295 llvm::BasicBlock *RHSBlock = createBasicBlock("cond.false");
296 EmitBranchOnBoolExpr(CondOp->getCond(), LHSBlock, RHSBlock);
297 EmitBlock(LHSBlock);
298 EmitBranchOnBoolExpr(CondOp->getLHS(), TrueBlock, FalseBlock);
299 EmitBlock(RHSBlock);
300 EmitBranchOnBoolExpr(CondOp->getRHS(), TrueBlock, FalseBlock);
301 return;
302 }
303 }
304
Chris Lattner31a09842008-11-12 08:04:58 +0000305 // Emit the code with the fully general case.
306 llvm::Value *CondV = EvaluateExprAsBool(Cond);
307 Builder.CreateCondBr(CondV, TrueBlock, FalseBlock);
308}
309
Devang Patel88a981b2007-11-01 19:11:01 +0000310/// getCGRecordLayout - Return record layout info.
311const CGRecordLayout *CodeGenFunction::getCGRecordLayout(CodeGenTypes &CGT,
Chris Lattneraf319132008-02-05 06:55:31 +0000312 QualType Ty) {
313 const RecordType *RTy = Ty->getAsRecordType();
314 assert (RTy && "Unexpected type. RecordType expected here.");
Devang Patelb84a06e2007-10-23 02:10:49 +0000315
Chris Lattneraf319132008-02-05 06:55:31 +0000316 return CGT.getCGRecordLayout(RTy->getDecl());
Devang Patelb84a06e2007-10-23 02:10:49 +0000317}
Chris Lattnerdc5e8262007-12-02 01:43:38 +0000318
Daniel Dunbar488e9932008-08-16 00:56:44 +0000319/// ErrorUnsupported - Print out an error that codegen doesn't support the
Chris Lattnerdc5e8262007-12-02 01:43:38 +0000320/// specified stmt yet.
Daniel Dunbar90df4b62008-09-04 03:43:08 +0000321void CodeGenFunction::ErrorUnsupported(const Stmt *S, const char *Type,
322 bool OmitOnError) {
323 CGM.ErrorUnsupported(S, Type, OmitOnError);
Chris Lattnerdc5e8262007-12-02 01:43:38 +0000324}
325
Daniel Dunbar0ffb1252008-08-04 16:51:22 +0000326unsigned CodeGenFunction::GetIDForAddrOfLabel(const LabelStmt *L) {
327 // Use LabelIDs.size() as the new ID if one hasn't been assigned.
328 return LabelIDs.insert(std::make_pair(L, LabelIDs.size())).first->second;
329}
330
Anders Carlsson3d8400d2008-08-30 19:51:14 +0000331void CodeGenFunction::EmitMemSetToZero(llvm::Value *DestPtr, QualType Ty)
332{
333 const llvm::Type *BP = llvm::PointerType::getUnqual(llvm::Type::Int8Ty);
334 if (DestPtr->getType() != BP)
335 DestPtr = Builder.CreateBitCast(DestPtr, BP, "tmp");
336
337 // Get size and alignment info for this aggregate.
338 std::pair<uint64_t, unsigned> TypeInfo = getContext().getTypeInfo(Ty);
339
340 // FIXME: Handle variable sized types.
341 const llvm::Type *IntPtr = llvm::IntegerType::get(LLVMPointerWidth);
342
343 Builder.CreateCall4(CGM.getMemSetFn(), DestPtr,
344 llvm::ConstantInt::getNullValue(llvm::Type::Int8Ty),
345 // TypeInfo.first describes size in bits.
346 llvm::ConstantInt::get(IntPtr, TypeInfo.first/8),
347 llvm::ConstantInt::get(llvm::Type::Int32Ty,
348 TypeInfo.second/8));
349}
350
Daniel Dunbar0ffb1252008-08-04 16:51:22 +0000351void CodeGenFunction::EmitIndirectSwitches() {
352 llvm::BasicBlock *Default;
353
Daniel Dunbar76526a52008-08-04 17:24:44 +0000354 if (IndirectSwitches.empty())
355 return;
356
Daniel Dunbar0ffb1252008-08-04 16:51:22 +0000357 if (!LabelIDs.empty()) {
358 Default = getBasicBlockForLabel(LabelIDs.begin()->first);
359 } else {
360 // No possible targets for indirect goto, just emit an infinite
361 // loop.
Daniel Dunbar55e87422008-11-11 02:29:29 +0000362 Default = createBasicBlock("indirectgoto.loop", CurFn);
Daniel Dunbar0ffb1252008-08-04 16:51:22 +0000363 llvm::BranchInst::Create(Default, Default);
364 }
365
366 for (std::vector<llvm::SwitchInst*>::iterator i = IndirectSwitches.begin(),
367 e = IndirectSwitches.end(); i != e; ++i) {
368 llvm::SwitchInst *I = *i;
369
370 I->setSuccessor(0, Default);
371 for (std::map<const LabelStmt*,unsigned>::iterator LI = LabelIDs.begin(),
372 LE = LabelIDs.end(); LI != LE; ++LI) {
373 I->addCase(llvm::ConstantInt::get(llvm::Type::Int32Ty,
374 LI->second),
375 getBasicBlockForLabel(LI->first));
376 }
377 }
378}
Anders Carlssonddf7cac2008-11-04 05:30:00 +0000379
380llvm::Value *CodeGenFunction::EmitVAArg(llvm::Value *VAListAddr, QualType Ty)
381{
382 // FIXME: This entire method is hardcoded for 32-bit X86.
383
384 const char *TargetPrefix = getContext().Target.getTargetPrefix();
385
386 if (strcmp(TargetPrefix, "x86") != 0 ||
387 getContext().Target.getPointerWidth(0) != 32)
388 return 0;
389
390 const llvm::Type *BP = llvm::PointerType::getUnqual(llvm::Type::Int8Ty);
391 const llvm::Type *BPP = llvm::PointerType::getUnqual(BP);
392
393 llvm::Value *VAListAddrAsBPP = Builder.CreateBitCast(VAListAddr, BPP,
394 "ap");
395 llvm::Value *Addr = Builder.CreateLoad(VAListAddrAsBPP, "ap.cur");
396 llvm::Value *AddrTyped =
397 Builder.CreateBitCast(Addr,
398 llvm::PointerType::getUnqual(ConvertType(Ty)));
399
400 uint64_t SizeInBytes = getContext().getTypeSize(Ty) / 8;
401 const unsigned ArgumentSizeInBytes = 4;
402 if (SizeInBytes < ArgumentSizeInBytes)
403 SizeInBytes = ArgumentSizeInBytes;
404
405 llvm::Value *NextAddr =
406 Builder.CreateGEP(Addr,
407 llvm::ConstantInt::get(llvm::Type::Int32Ty, SizeInBytes),
408 "ap.next");
409 Builder.CreateStore(NextAddr, VAListAddrAsBPP);
410
411 return AddrTyped;
412}
413
Anders Carlssonf666b772008-12-20 20:27:15 +0000414
Anders Carlssondcc90d82008-12-12 07:19:02 +0000415llvm::Value *CodeGenFunction::GetVLASize(const VariableArrayType *VAT)
416{
417 llvm::Value *&SizeEntry = VLASizeMap[VAT];
Anders Carlssondcc90d82008-12-12 07:19:02 +0000418
Anders Carlssonf666b772008-12-20 20:27:15 +0000419 assert(SizeEntry && "Did not emit size for type");
420 return SizeEntry;
421}
Anders Carlssondcc90d82008-12-12 07:19:02 +0000422
Anders Carlsson60d35412008-12-20 20:46:34 +0000423llvm::Value *CodeGenFunction::EmitVLASize(QualType Ty)
Anders Carlssonf666b772008-12-20 20:27:15 +0000424{
Anders Carlsson60d35412008-12-20 20:46:34 +0000425 assert(Ty->isVariablyModifiedType() &&
426 "Must pass variably modified type to EmitVLASizes!");
Anders Carlssonf666b772008-12-20 20:27:15 +0000427
Anders Carlsson60d35412008-12-20 20:46:34 +0000428 if (const VariableArrayType *VAT = getContext().getAsVariableArrayType(Ty)) {
429 llvm::Value *&SizeEntry = VLASizeMap[VAT];
430
431 assert(!SizeEntry && "Must not emit the same VLA size more than once!");
432
433 // Get the element size;
434 llvm::Value *ElemSize;
435
436 QualType ElemTy = VAT->getElementType();
437
438 if (ElemTy->isVariableArrayType())
439 ElemSize = EmitVLASize(ElemTy);
440 else {
441 // FIXME: We use Int32Ty here because the alloca instruction takes a
442 // 32-bit integer. What should we do about overflow?
443 ElemSize = llvm::ConstantInt::get(llvm::Type::Int32Ty,
444 getContext().getTypeSize(ElemTy) / 8);
445 }
446
447 llvm::Value *NumElements = EmitScalarExpr(VAT->getSizeExpr());
448
449 SizeEntry = Builder.CreateMul(ElemSize, NumElements);
450
451 return SizeEntry;
452 } else if (const PointerType *PT = Ty->getAsPointerType())
453 EmitVLASize(PT->getPointeeType());
Anders Carlssonf666b772008-12-20 20:27:15 +0000454 else {
Anders Carlsson60d35412008-12-20 20:46:34 +0000455 assert(0 && "unknown VM type!");
Anders Carlssondcc90d82008-12-12 07:19:02 +0000456 }
Anders Carlsson60d35412008-12-20 20:46:34 +0000457
458 return 0;
Anders Carlssondcc90d82008-12-12 07:19:02 +0000459}