Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 1 | //===--- CGStmt.cpp - Emit LLVM Code from Statements ----------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 0bc735f | 2007-12-29 19:59:25 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This contains code to emit Stmt nodes as LLVM code. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chandler Carruth | 55fc873 | 2012-12-04 09:13:33 +0000 | [diff] [blame] | 14 | #include "CodeGenFunction.h" |
Sanjiv Gupta | e8b9f5b | 2008-05-08 08:54:20 +0000 | [diff] [blame] | 15 | #include "CGDebugInfo.h" |
| 16 | #include "CodeGenModule.h" |
Peter Collingbourne | 4b93d66 | 2011-02-19 23:03:58 +0000 | [diff] [blame] | 17 | #include "TargetInfo.h" |
Daniel Dunbar | de7fb84 | 2008-08-11 05:00:27 +0000 | [diff] [blame] | 18 | #include "clang/AST/StmtVisitor.h" |
Tim Northover | 1bea653 | 2013-06-07 00:04:50 +0000 | [diff] [blame] | 19 | #include "clang/Sema/SemaDiagnostic.h" |
Chris Lattner | 7d22bf0 | 2009-03-05 08:04:57 +0000 | [diff] [blame] | 20 | #include "clang/Basic/PrettyStackTrace.h" |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 21 | #include "clang/Basic/TargetInfo.h" |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 22 | #include "llvm/ADT/StringExtras.h" |
Chandler Carruth | 3b844ba | 2013-01-02 11:45:17 +0000 | [diff] [blame] | 23 | #include "llvm/IR/DataLayout.h" |
| 24 | #include "llvm/IR/InlineAsm.h" |
| 25 | #include "llvm/IR/Intrinsics.h" |
Ben Langmuir | 524387a | 2013-05-09 19:17:11 +0000 | [diff] [blame] | 26 | #include "llvm/Support/CallSite.h" |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 27 | using namespace clang; |
| 28 | using namespace CodeGen; |
| 29 | |
| 30 | //===----------------------------------------------------------------------===// |
| 31 | // Statement Emission |
| 32 | //===----------------------------------------------------------------------===// |
| 33 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 34 | void CodeGenFunction::EmitStopPoint(const Stmt *S) { |
Anders Carlsson | e896d98 | 2009-02-13 08:11:52 +0000 | [diff] [blame] | 35 | if (CGDebugInfo *DI = getDebugInfo()) { |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 36 | SourceLocation Loc; |
Adrian Prantl | 2736f2e | 2013-06-18 00:27:36 +0000 | [diff] [blame] | 37 | Loc = S->getLocStart(); |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 38 | DI->EmitLocation(Builder, Loc); |
Adrian Prantl | fa6b079 | 2013-05-02 17:30:20 +0000 | [diff] [blame] | 39 | |
Adrian Prantl | 4008088 | 2013-05-07 22:26:03 +0000 | [diff] [blame] | 40 | LastStopPoint = Loc; |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 41 | } |
| 42 | } |
| 43 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 44 | void CodeGenFunction::EmitStmt(const Stmt *S) { |
| 45 | assert(S && "Null statement?"); |
Daniel Dunbar | a448fb2 | 2008-11-11 23:11:34 +0000 | [diff] [blame] | 46 | |
Eric Christopher | f9aac38 | 2011-09-26 15:03:19 +0000 | [diff] [blame] | 47 | // These statements have their own debug info handling. |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 48 | if (EmitSimpleStmt(S)) |
| 49 | return; |
| 50 | |
Daniel Dunbar | d286f05 | 2009-07-19 06:58:07 +0000 | [diff] [blame] | 51 | // Check if we are generating unreachable code. |
| 52 | if (!HaveInsertPoint()) { |
| 53 | // If so, and the statement doesn't contain a label, then we do not need to |
| 54 | // generate actual code. This is safe because (1) the current point is |
| 55 | // unreachable, so we don't need to execute the code, and (2) we've already |
| 56 | // handled the statements which update internal data structures (like the |
| 57 | // local variable map) which could be used by subsequent statements. |
| 58 | if (!ContainsLabel(S)) { |
| 59 | // Verify that any decl statements were handled as simple, they may be in |
| 60 | // scope of subsequent reachable statements. |
| 61 | assert(!isa<DeclStmt>(*S) && "Unexpected DeclStmt!"); |
| 62 | return; |
| 63 | } |
| 64 | |
| 65 | // Otherwise, make a new block to hold the code. |
| 66 | EnsureInsertPoint(); |
| 67 | } |
| 68 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 69 | // Generate a stoppoint if we are emitting debug info. |
| 70 | EmitStopPoint(S); |
Sanjiv Gupta | e8b9f5b | 2008-05-08 08:54:20 +0000 | [diff] [blame] | 71 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 72 | switch (S->getStmtClass()) { |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 73 | case Stmt::NoStmtClass: |
| 74 | case Stmt::CXXCatchStmtClass: |
John Wiegley | 28bbe4b | 2011-04-28 01:08:34 +0000 | [diff] [blame] | 75 | case Stmt::SEHExceptStmtClass: |
| 76 | case Stmt::SEHFinallyStmtClass: |
Douglas Gregor | ba0513d | 2011-10-25 01:33:02 +0000 | [diff] [blame] | 77 | case Stmt::MSDependentExistsStmtClass: |
Alexey Bataev | 4fa7eab | 2013-07-19 03:13:43 +0000 | [diff] [blame] | 78 | case Stmt::OMPParallelDirectiveClass: |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 79 | llvm_unreachable("invalid statement class to emit generically"); |
| 80 | case Stmt::NullStmtClass: |
| 81 | case Stmt::CompoundStmtClass: |
| 82 | case Stmt::DeclStmtClass: |
| 83 | case Stmt::LabelStmtClass: |
Richard Smith | 534986f | 2012-04-14 00:33:13 +0000 | [diff] [blame] | 84 | case Stmt::AttributedStmtClass: |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 85 | case Stmt::GotoStmtClass: |
| 86 | case Stmt::BreakStmtClass: |
| 87 | case Stmt::ContinueStmtClass: |
| 88 | case Stmt::DefaultStmtClass: |
| 89 | case Stmt::CaseStmtClass: |
| 90 | llvm_unreachable("should have emitted these statements as simple"); |
Daniel Dunbar | cd5e60e | 2009-07-19 08:23:12 +0000 | [diff] [blame] | 91 | |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 92 | #define STMT(Type, Base) |
| 93 | #define ABSTRACT_STMT(Op) |
| 94 | #define EXPR(Type, Base) \ |
| 95 | case Stmt::Type##Class: |
| 96 | #include "clang/AST/StmtNodes.inc" |
John McCall | cd5b22e | 2011-01-12 03:41:02 +0000 | [diff] [blame] | 97 | { |
| 98 | // Remember the block we came in on. |
| 99 | llvm::BasicBlock *incoming = Builder.GetInsertBlock(); |
| 100 | assert(incoming && "expression emission must have an insertion point"); |
| 101 | |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 102 | EmitIgnoredExpr(cast<Expr>(S)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 103 | |
John McCall | cd5b22e | 2011-01-12 03:41:02 +0000 | [diff] [blame] | 104 | llvm::BasicBlock *outgoing = Builder.GetInsertBlock(); |
| 105 | assert(outgoing && "expression emission cleared block!"); |
| 106 | |
| 107 | // The expression emitters assume (reasonably!) that the insertion |
| 108 | // point is always set. To maintain that, the call-emission code |
| 109 | // for noreturn functions has to enter a new block with no |
| 110 | // predecessors. We want to kill that block and mark the current |
| 111 | // insertion point unreachable in the common case of a call like |
| 112 | // "exit();". Since expression emission doesn't otherwise create |
| 113 | // blocks with no predecessors, we can just test for that. |
| 114 | // However, we must be careful not to do this to our incoming |
| 115 | // block, because *statement* emission does sometimes create |
| 116 | // reachable blocks which will have no predecessors until later in |
| 117 | // the function. This occurs with, e.g., labels that are not |
| 118 | // reachable by fallthrough. |
| 119 | if (incoming != outgoing && outgoing->use_empty()) { |
| 120 | outgoing->eraseFromParent(); |
| 121 | Builder.ClearInsertionPoint(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 122 | } |
| 123 | break; |
John McCall | cd5b22e | 2011-01-12 03:41:02 +0000 | [diff] [blame] | 124 | } |
John McCall | 2a41637 | 2010-12-05 02:00:02 +0000 | [diff] [blame] | 125 | |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 126 | case Stmt::IndirectGotoStmtClass: |
Daniel Dunbar | 0ffb125 | 2008-08-04 16:51:22 +0000 | [diff] [blame] | 127 | EmitIndirectGotoStmt(cast<IndirectGotoStmt>(*S)); break; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 128 | |
| 129 | case Stmt::IfStmtClass: EmitIfStmt(cast<IfStmt>(*S)); break; |
| 130 | case Stmt::WhileStmtClass: EmitWhileStmt(cast<WhileStmt>(*S)); break; |
| 131 | case Stmt::DoStmtClass: EmitDoStmt(cast<DoStmt>(*S)); break; |
| 132 | case Stmt::ForStmtClass: EmitForStmt(cast<ForStmt>(*S)); break; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 133 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 134 | case Stmt::ReturnStmtClass: EmitReturnStmt(cast<ReturnStmt>(*S)); break; |
Daniel Dunbar | a4275d1 | 2008-10-02 18:02:06 +0000 | [diff] [blame] | 135 | |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 136 | case Stmt::SwitchStmtClass: EmitSwitchStmt(cast<SwitchStmt>(*S)); break; |
Chad Rosier | d1a8d2e | 2012-08-28 21:11:24 +0000 | [diff] [blame] | 137 | case Stmt::GCCAsmStmtClass: // Intentional fall-through. |
| 138 | case Stmt::MSAsmStmtClass: EmitAsmStmt(cast<AsmStmt>(*S)); break; |
Alexey Bataev | 0c01835 | 2013-09-06 18:03:48 +0000 | [diff] [blame] | 139 | case Stmt::CapturedStmtClass: { |
| 140 | const CapturedStmt *CS = cast<CapturedStmt>(S); |
| 141 | EmitCapturedStmt(*CS, CS->getCapturedRegionKind()); |
| 142 | } |
Tareq A. Siraj | 051303c | 2013-04-16 18:53:08 +0000 | [diff] [blame] | 143 | break; |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 144 | case Stmt::ObjCAtTryStmtClass: |
Anders Carlsson | 64d5d6c | 2008-09-09 10:04:29 +0000 | [diff] [blame] | 145 | EmitObjCAtTryStmt(cast<ObjCAtTryStmt>(*S)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 146 | break; |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 147 | case Stmt::ObjCAtCatchStmtClass: |
David Blaikie | b219cfc | 2011-09-23 05:06:16 +0000 | [diff] [blame] | 148 | llvm_unreachable( |
| 149 | "@catch statements should be handled by EmitObjCAtTryStmt"); |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 150 | case Stmt::ObjCAtFinallyStmtClass: |
David Blaikie | b219cfc | 2011-09-23 05:06:16 +0000 | [diff] [blame] | 151 | llvm_unreachable( |
| 152 | "@finally statements should be handled by EmitObjCAtTryStmt"); |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 153 | case Stmt::ObjCAtThrowStmtClass: |
Anders Carlsson | 64d5d6c | 2008-09-09 10:04:29 +0000 | [diff] [blame] | 154 | EmitObjCAtThrowStmt(cast<ObjCAtThrowStmt>(*S)); |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 155 | break; |
| 156 | case Stmt::ObjCAtSynchronizedStmtClass: |
Chris Lattner | 10cac6f | 2008-11-15 21:26:17 +0000 | [diff] [blame] | 157 | EmitObjCAtSynchronizedStmt(cast<ObjCAtSynchronizedStmt>(*S)); |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 158 | break; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 159 | case Stmt::ObjCForCollectionStmtClass: |
Anders Carlsson | 3d8400d | 2008-08-30 19:51:14 +0000 | [diff] [blame] | 160 | EmitObjCForCollectionStmt(cast<ObjCForCollectionStmt>(*S)); |
Daniel Dunbar | 0a04d77 | 2008-08-23 10:51:21 +0000 | [diff] [blame] | 161 | break; |
John McCall | f85e193 | 2011-06-15 23:02:42 +0000 | [diff] [blame] | 162 | case Stmt::ObjCAutoreleasePoolStmtClass: |
| 163 | EmitObjCAutoreleasePoolStmt(cast<ObjCAutoreleasePoolStmt>(*S)); |
| 164 | break; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 165 | |
Anders Carlsson | 6815e94 | 2009-09-27 18:58:34 +0000 | [diff] [blame] | 166 | case Stmt::CXXTryStmtClass: |
| 167 | EmitCXXTryStmt(cast<CXXTryStmt>(*S)); |
| 168 | break; |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 169 | case Stmt::CXXForRangeStmtClass: |
| 170 | EmitCXXForRangeStmt(cast<CXXForRangeStmt>(*S)); |
Reid Kleckner | 98592d9 | 2013-09-16 21:46:30 +0000 | [diff] [blame^] | 171 | break; |
John Wiegley | 28bbe4b | 2011-04-28 01:08:34 +0000 | [diff] [blame] | 172 | case Stmt::SEHTryStmtClass: |
Reid Kleckner | 98592d9 | 2013-09-16 21:46:30 +0000 | [diff] [blame^] | 173 | EmitSEHTryStmt(cast<SEHTryStmt>(*S)); |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 174 | break; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 175 | } |
| 176 | } |
| 177 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 178 | bool CodeGenFunction::EmitSimpleStmt(const Stmt *S) { |
| 179 | switch (S->getStmtClass()) { |
| 180 | default: return false; |
| 181 | case Stmt::NullStmtClass: break; |
| 182 | case Stmt::CompoundStmtClass: EmitCompoundStmt(cast<CompoundStmt>(*S)); break; |
Daniel Dunbar | d286f05 | 2009-07-19 06:58:07 +0000 | [diff] [blame] | 183 | case Stmt::DeclStmtClass: EmitDeclStmt(cast<DeclStmt>(*S)); break; |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 184 | case Stmt::LabelStmtClass: EmitLabelStmt(cast<LabelStmt>(*S)); break; |
Richard Smith | 534986f | 2012-04-14 00:33:13 +0000 | [diff] [blame] | 185 | case Stmt::AttributedStmtClass: |
| 186 | EmitAttributedStmt(cast<AttributedStmt>(*S)); break; |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 187 | case Stmt::GotoStmtClass: EmitGotoStmt(cast<GotoStmt>(*S)); break; |
| 188 | case Stmt::BreakStmtClass: EmitBreakStmt(cast<BreakStmt>(*S)); break; |
| 189 | case Stmt::ContinueStmtClass: EmitContinueStmt(cast<ContinueStmt>(*S)); break; |
| 190 | case Stmt::DefaultStmtClass: EmitDefaultStmt(cast<DefaultStmt>(*S)); break; |
| 191 | case Stmt::CaseStmtClass: EmitCaseStmt(cast<CaseStmt>(*S)); break; |
| 192 | } |
| 193 | |
| 194 | return true; |
| 195 | } |
| 196 | |
Chris Lattner | 3379320 | 2007-08-31 22:09:40 +0000 | [diff] [blame] | 197 | /// EmitCompoundStmt - Emit a compound statement {..} node. If GetLast is true, |
| 198 | /// this captures the expression result of the last sub-statement and returns it |
| 199 | /// (for use by the statement expression extension). |
Eli Friedman | 2ac2fa7 | 2013-06-10 22:04:49 +0000 | [diff] [blame] | 200 | llvm::Value* CodeGenFunction::EmitCompoundStmt(const CompoundStmt &S, bool GetLast, |
| 201 | AggValueSlot AggSlot) { |
Chris Lattner | 7d22bf0 | 2009-03-05 08:04:57 +0000 | [diff] [blame] | 202 | PrettyStackTraceLoc CrashInfo(getContext().getSourceManager(),S.getLBracLoc(), |
| 203 | "LLVM IR generation of compound statement ('{}')"); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 204 | |
Eric Christopher | fdc5d56 | 2012-02-23 00:43:07 +0000 | [diff] [blame] | 205 | // Keep track of the current cleanup stack depth, including debug scopes. |
| 206 | LexicalScope Scope(*this, S.getSourceRange()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 207 | |
David Blaikie | a650485 | 2013-01-26 22:16:26 +0000 | [diff] [blame] | 208 | return EmitCompoundStmtWithoutScope(S, GetLast, AggSlot); |
| 209 | } |
| 210 | |
Eli Friedman | 2ac2fa7 | 2013-06-10 22:04:49 +0000 | [diff] [blame] | 211 | llvm::Value* |
| 212 | CodeGenFunction::EmitCompoundStmtWithoutScope(const CompoundStmt &S, |
| 213 | bool GetLast, |
| 214 | AggValueSlot AggSlot) { |
David Blaikie | a650485 | 2013-01-26 22:16:26 +0000 | [diff] [blame] | 215 | |
Chris Lattner | 3379320 | 2007-08-31 22:09:40 +0000 | [diff] [blame] | 216 | for (CompoundStmt::const_body_iterator I = S.body_begin(), |
| 217 | E = S.body_end()-GetLast; I != E; ++I) |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 218 | EmitStmt(*I); |
Sanjiv Gupta | e8b9f5b | 2008-05-08 08:54:20 +0000 | [diff] [blame] | 219 | |
Eli Friedman | 2ac2fa7 | 2013-06-10 22:04:49 +0000 | [diff] [blame] | 220 | llvm::Value *RetAlloca = 0; |
| 221 | if (GetLast) { |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 222 | // We have to special case labels here. They are statements, but when put |
Anders Carlsson | 17d28a3 | 2008-12-12 05:52:00 +0000 | [diff] [blame] | 223 | // at the end of a statement expression, they yield the value of their |
| 224 | // subexpression. Handle this by walking through all labels we encounter, |
| 225 | // emitting them before we evaluate the subexpr. |
| 226 | const Stmt *LastStmt = S.body_back(); |
| 227 | while (const LabelStmt *LS = dyn_cast<LabelStmt>(LastStmt)) { |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 228 | EmitLabel(LS->getDecl()); |
Anders Carlsson | 17d28a3 | 2008-12-12 05:52:00 +0000 | [diff] [blame] | 229 | LastStmt = LS->getSubStmt(); |
| 230 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 231 | |
Anders Carlsson | 17d28a3 | 2008-12-12 05:52:00 +0000 | [diff] [blame] | 232 | EnsureInsertPoint(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 233 | |
Eli Friedman | 2ac2fa7 | 2013-06-10 22:04:49 +0000 | [diff] [blame] | 234 | QualType ExprTy = cast<Expr>(LastStmt)->getType(); |
| 235 | if (hasAggregateEvaluationKind(ExprTy)) { |
| 236 | EmitAggExpr(cast<Expr>(LastStmt), AggSlot); |
| 237 | } else { |
| 238 | // We can't return an RValue here because there might be cleanups at |
| 239 | // the end of the StmtExpr. Because of that, we have to emit the result |
| 240 | // here into a temporary alloca. |
| 241 | RetAlloca = CreateMemTemp(ExprTy); |
| 242 | EmitAnyExprToMem(cast<Expr>(LastStmt), RetAlloca, Qualifiers(), |
| 243 | /*IsInit*/false); |
| 244 | } |
| 245 | |
Anders Carlsson | 17d28a3 | 2008-12-12 05:52:00 +0000 | [diff] [blame] | 246 | } |
| 247 | |
Eli Friedman | 2ac2fa7 | 2013-06-10 22:04:49 +0000 | [diff] [blame] | 248 | return RetAlloca; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 249 | } |
| 250 | |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 251 | void CodeGenFunction::SimplifyForwardingBlocks(llvm::BasicBlock *BB) { |
| 252 | llvm::BranchInst *BI = dyn_cast<llvm::BranchInst>(BB->getTerminator()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 253 | |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 254 | // If there is a cleanup stack, then we it isn't worth trying to |
| 255 | // simplify this block (we would need to remove it from the scope map |
| 256 | // and cleanup entry). |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 257 | if (!EHStack.empty()) |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 258 | return; |
| 259 | |
| 260 | // Can only simplify direct branches. |
| 261 | if (!BI || !BI->isUnconditional()) |
| 262 | return; |
| 263 | |
Eli Friedman | 3d7c780 | 2012-10-26 23:23:35 +0000 | [diff] [blame] | 264 | // Can only simplify empty blocks. |
| 265 | if (BI != BB->begin()) |
| 266 | return; |
| 267 | |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 268 | BB->replaceAllUsesWith(BI->getSuccessor(0)); |
| 269 | BI->eraseFromParent(); |
| 270 | BB->eraseFromParent(); |
| 271 | } |
| 272 | |
Daniel Dunbar | a0c21a8 | 2008-11-13 01:24:05 +0000 | [diff] [blame] | 273 | void CodeGenFunction::EmitBlock(llvm::BasicBlock *BB, bool IsFinished) { |
John McCall | 548ce5e | 2010-04-21 11:18:06 +0000 | [diff] [blame] | 274 | llvm::BasicBlock *CurBB = Builder.GetInsertBlock(); |
| 275 | |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 276 | // Fall out of the current block (if necessary). |
| 277 | EmitBranch(BB); |
Daniel Dunbar | a0c21a8 | 2008-11-13 01:24:05 +0000 | [diff] [blame] | 278 | |
| 279 | if (IsFinished && BB->use_empty()) { |
| 280 | delete BB; |
| 281 | return; |
| 282 | } |
| 283 | |
John McCall | 839cbaa | 2010-04-21 10:29:06 +0000 | [diff] [blame] | 284 | // Place the block after the current block, if possible, or else at |
| 285 | // the end of the function. |
John McCall | 548ce5e | 2010-04-21 11:18:06 +0000 | [diff] [blame] | 286 | if (CurBB && CurBB->getParent()) |
| 287 | CurFn->getBasicBlockList().insertAfter(CurBB, BB); |
John McCall | 839cbaa | 2010-04-21 10:29:06 +0000 | [diff] [blame] | 288 | else |
| 289 | CurFn->getBasicBlockList().push_back(BB); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 290 | Builder.SetInsertPoint(BB); |
| 291 | } |
| 292 | |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 293 | void CodeGenFunction::EmitBranch(llvm::BasicBlock *Target) { |
| 294 | // Emit a branch from the current block to the target one if this |
| 295 | // was a real block. If this was just a fall-through block after a |
| 296 | // terminator, don't emit it. |
| 297 | llvm::BasicBlock *CurBB = Builder.GetInsertBlock(); |
| 298 | |
| 299 | if (!CurBB || CurBB->getTerminator()) { |
| 300 | // If there is no insert point or the previous block is already |
| 301 | // terminated, don't touch it. |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 302 | } else { |
| 303 | // Otherwise, create a fall-through branch. |
| 304 | Builder.CreateBr(Target); |
| 305 | } |
Daniel Dunbar | 5e08ad3 | 2008-11-11 22:06:59 +0000 | [diff] [blame] | 306 | |
| 307 | Builder.ClearInsertionPoint(); |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 308 | } |
| 309 | |
John McCall | 777d6e5 | 2011-08-11 02:22:43 +0000 | [diff] [blame] | 310 | void CodeGenFunction::EmitBlockAfterUses(llvm::BasicBlock *block) { |
| 311 | bool inserted = false; |
| 312 | for (llvm::BasicBlock::use_iterator |
| 313 | i = block->use_begin(), e = block->use_end(); i != e; ++i) { |
| 314 | if (llvm::Instruction *insn = dyn_cast<llvm::Instruction>(*i)) { |
| 315 | CurFn->getBasicBlockList().insertAfter(insn->getParent(), block); |
| 316 | inserted = true; |
| 317 | break; |
| 318 | } |
| 319 | } |
| 320 | |
| 321 | if (!inserted) |
| 322 | CurFn->getBasicBlockList().push_back(block); |
| 323 | |
| 324 | Builder.SetInsertPoint(block); |
| 325 | } |
| 326 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 327 | CodeGenFunction::JumpDest |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 328 | CodeGenFunction::getJumpDestForLabel(const LabelDecl *D) { |
| 329 | JumpDest &Dest = LabelMap[D]; |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 330 | if (Dest.isValid()) return Dest; |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 331 | |
| 332 | // Create, but don't insert, the new block. |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 333 | Dest = JumpDest(createBasicBlock(D->getName()), |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 334 | EHScopeStack::stable_iterator::invalid(), |
| 335 | NextCleanupDestIndex++); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 336 | return Dest; |
| 337 | } |
| 338 | |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 339 | void CodeGenFunction::EmitLabel(const LabelDecl *D) { |
Nadav Rotem | 495cfa4 | 2013-03-23 06:43:35 +0000 | [diff] [blame] | 340 | // Add this label to the current lexical scope if we're within any |
| 341 | // normal cleanups. Jumps "in" to this label --- when permitted by |
| 342 | // the language --- may need to be routed around such cleanups. |
| 343 | if (EHStack.hasNormalCleanups() && CurLexicalScope) |
| 344 | CurLexicalScope->addLabel(D); |
| 345 | |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 346 | JumpDest &Dest = LabelMap[D]; |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 347 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 348 | // If we didn't need a forward reference to this label, just go |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 349 | // ahead and create a destination at the current scope. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 350 | if (!Dest.isValid()) { |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 351 | Dest = getJumpDestInCurrentScope(D->getName()); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 352 | |
| 353 | // Otherwise, we need to give this label a target depth and remove |
| 354 | // it from the branch-fixups list. |
| 355 | } else { |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 356 | assert(!Dest.getScopeDepth().isValid() && "already emitted label!"); |
Nadav Rotem | 495cfa4 | 2013-03-23 06:43:35 +0000 | [diff] [blame] | 357 | Dest.setScopeDepth(EHStack.stable_begin()); |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 358 | ResolveBranchFixups(Dest.getBlock()); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 359 | } |
| 360 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 361 | EmitBlock(Dest.getBlock()); |
Chris Lattner | 91d723d | 2008-07-26 20:23:23 +0000 | [diff] [blame] | 362 | } |
| 363 | |
Nadav Rotem | 495cfa4 | 2013-03-23 06:43:35 +0000 | [diff] [blame] | 364 | /// Change the cleanup scope of the labels in this lexical scope to |
| 365 | /// match the scope of the enclosing context. |
| 366 | void CodeGenFunction::LexicalScope::rescopeLabels() { |
| 367 | assert(!Labels.empty()); |
| 368 | EHScopeStack::stable_iterator innermostScope |
| 369 | = CGF.EHStack.getInnermostNormalCleanup(); |
| 370 | |
| 371 | // Change the scope depth of all the labels. |
| 372 | for (SmallVectorImpl<const LabelDecl*>::const_iterator |
| 373 | i = Labels.begin(), e = Labels.end(); i != e; ++i) { |
| 374 | assert(CGF.LabelMap.count(*i)); |
| 375 | JumpDest &dest = CGF.LabelMap.find(*i)->second; |
| 376 | assert(dest.getScopeDepth().isValid()); |
| 377 | assert(innermostScope.encloses(dest.getScopeDepth())); |
| 378 | dest.setScopeDepth(innermostScope); |
| 379 | } |
| 380 | |
| 381 | // Reparent the labels if the new scope also has cleanups. |
| 382 | if (innermostScope != EHScopeStack::stable_end() && ParentScope) { |
| 383 | ParentScope->Labels.append(Labels.begin(), Labels.end()); |
| 384 | } |
| 385 | } |
| 386 | |
Chris Lattner | 91d723d | 2008-07-26 20:23:23 +0000 | [diff] [blame] | 387 | |
| 388 | void CodeGenFunction::EmitLabelStmt(const LabelStmt &S) { |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 389 | EmitLabel(S.getDecl()); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 390 | EmitStmt(S.getSubStmt()); |
| 391 | } |
| 392 | |
Richard Smith | 534986f | 2012-04-14 00:33:13 +0000 | [diff] [blame] | 393 | void CodeGenFunction::EmitAttributedStmt(const AttributedStmt &S) { |
| 394 | EmitStmt(S.getSubStmt()); |
| 395 | } |
| 396 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 397 | void CodeGenFunction::EmitGotoStmt(const GotoStmt &S) { |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 398 | // If this code is reachable then emit a stop point (if generating |
| 399 | // debug info). We have to do this ourselves because we are on the |
| 400 | // "simple" statement path. |
| 401 | if (HaveInsertPoint()) |
| 402 | EmitStopPoint(&S); |
Mike Stump | 36a2ada | 2009-02-07 12:52:26 +0000 | [diff] [blame] | 403 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 404 | EmitBranchThroughCleanup(getJumpDestForLabel(S.getLabel())); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 405 | } |
| 406 | |
Chris Lattner | 3d00fdc | 2009-10-13 06:55:33 +0000 | [diff] [blame] | 407 | |
Daniel Dunbar | 0ffb125 | 2008-08-04 16:51:22 +0000 | [diff] [blame] | 408 | void CodeGenFunction::EmitIndirectGotoStmt(const IndirectGotoStmt &S) { |
Chris Lattner | ad8dcf4 | 2011-02-17 07:39:24 +0000 | [diff] [blame] | 409 | if (const LabelDecl *Target = S.getConstantTarget()) { |
John McCall | 95c225d | 2010-10-28 08:53:48 +0000 | [diff] [blame] | 410 | EmitBranchThroughCleanup(getJumpDestForLabel(Target)); |
| 411 | return; |
| 412 | } |
| 413 | |
Chris Lattner | 49c952f | 2009-11-06 18:10:47 +0000 | [diff] [blame] | 414 | // Ensure that we have an i8* for our PHI node. |
Chris Lattner | d9becd1 | 2009-10-28 23:59:40 +0000 | [diff] [blame] | 415 | llvm::Value *V = Builder.CreateBitCast(EmitScalarExpr(S.getTarget()), |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 416 | Int8PtrTy, "addr"); |
Chris Lattner | 3d00fdc | 2009-10-13 06:55:33 +0000 | [diff] [blame] | 417 | llvm::BasicBlock *CurBB = Builder.GetInsertBlock(); |
Daniel Dunbar | 0ffb125 | 2008-08-04 16:51:22 +0000 | [diff] [blame] | 418 | |
Chris Lattner | 3d00fdc | 2009-10-13 06:55:33 +0000 | [diff] [blame] | 419 | // Get the basic block for the indirect goto. |
| 420 | llvm::BasicBlock *IndGotoBB = GetIndirectGotoBlock(); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 421 | |
Chris Lattner | 3d00fdc | 2009-10-13 06:55:33 +0000 | [diff] [blame] | 422 | // The first instruction in the block has to be the PHI for the switch dest, |
| 423 | // add an entry for this branch. |
| 424 | cast<llvm::PHINode>(IndGotoBB->begin())->addIncoming(V, CurBB); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 425 | |
Chris Lattner | 3d00fdc | 2009-10-13 06:55:33 +0000 | [diff] [blame] | 426 | EmitBranch(IndGotoBB); |
Daniel Dunbar | 0ffb125 | 2008-08-04 16:51:22 +0000 | [diff] [blame] | 427 | } |
| 428 | |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 429 | void CodeGenFunction::EmitIfStmt(const IfStmt &S) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 430 | // C99 6.8.4.1: The first substatement is executed if the expression compares |
| 431 | // unequal to 0. The condition must be a scalar type. |
Eric Christopher | 7b309b0 | 2013-07-10 20:14:36 +0000 | [diff] [blame] | 432 | LexicalScope ConditionScope(*this, S.getSourceRange()); |
Adrian Prantl | 8d37858 | 2013-06-08 00:16:55 +0000 | [diff] [blame] | 433 | |
Douglas Gregor | 8cfe5a7 | 2009-11-23 23:44:04 +0000 | [diff] [blame] | 434 | if (S.getConditionVariable()) |
John McCall | b6bbcc9 | 2010-10-15 04:57:14 +0000 | [diff] [blame] | 435 | EmitAutoVarDecl(*S.getConditionVariable()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 436 | |
Chris Lattner | 9bc47e2 | 2008-11-12 07:46:33 +0000 | [diff] [blame] | 437 | // If the condition constant folds and can be elided, try to avoid emitting |
| 438 | // the condition and the dead arm of the if/else. |
Chris Lattner | c2c9001 | 2011-02-27 23:02:32 +0000 | [diff] [blame] | 439 | bool CondConstant; |
| 440 | if (ConstantFoldsToSimpleInteger(S.getCond(), CondConstant)) { |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 441 | // Figure out which block (then or else) is executed. |
Chris Lattner | c2c9001 | 2011-02-27 23:02:32 +0000 | [diff] [blame] | 442 | const Stmt *Executed = S.getThen(); |
| 443 | const Stmt *Skipped = S.getElse(); |
| 444 | if (!CondConstant) // Condition false? |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 445 | std::swap(Executed, Skipped); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 446 | |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 447 | // If the skipped block has no labels in it, just emit the executed block. |
| 448 | // This avoids emitting dead code and simplifies the CFG substantially. |
Chris Lattner | 9bc47e2 | 2008-11-12 07:46:33 +0000 | [diff] [blame] | 449 | if (!ContainsLabel(Skipped)) { |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 450 | if (Executed) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 451 | RunCleanupsScope ExecutedScope(*this); |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 452 | EmitStmt(Executed); |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 453 | } |
Chris Lattner | 62b72f6 | 2008-11-11 07:24:28 +0000 | [diff] [blame] | 454 | return; |
| 455 | } |
| 456 | } |
Chris Lattner | 9bc47e2 | 2008-11-12 07:46:33 +0000 | [diff] [blame] | 457 | |
| 458 | // Otherwise, the condition did not fold, or we couldn't elide it. Just emit |
| 459 | // the conditional branch. |
Daniel Dunbar | 781d7ca | 2008-11-13 00:47:57 +0000 | [diff] [blame] | 460 | llvm::BasicBlock *ThenBlock = createBasicBlock("if.then"); |
| 461 | llvm::BasicBlock *ContBlock = createBasicBlock("if.end"); |
| 462 | llvm::BasicBlock *ElseBlock = ContBlock; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 463 | if (S.getElse()) |
Daniel Dunbar | 781d7ca | 2008-11-13 00:47:57 +0000 | [diff] [blame] | 464 | ElseBlock = createBasicBlock("if.else"); |
| 465 | EmitBranchOnBoolExpr(S.getCond(), ThenBlock, ElseBlock); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 466 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 467 | // Emit the 'then' code. |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 468 | EmitBlock(ThenBlock); |
| 469 | { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 470 | RunCleanupsScope ThenScope(*this); |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 471 | EmitStmt(S.getThen()); |
| 472 | } |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 473 | EmitBranch(ContBlock); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 474 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 475 | // Emit the 'else' code if present. |
| 476 | if (const Stmt *Else = S.getElse()) { |
Devang Patel | acd7236 | 2011-03-30 00:08:31 +0000 | [diff] [blame] | 477 | // There is no need to emit line number for unconditional branch. |
| 478 | if (getDebugInfo()) |
| 479 | Builder.SetCurrentDebugLocation(llvm::DebugLoc()); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 480 | EmitBlock(ElseBlock); |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 481 | { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 482 | RunCleanupsScope ElseScope(*this); |
Douglas Gregor | 01234bb | 2009-11-24 16:43:22 +0000 | [diff] [blame] | 483 | EmitStmt(Else); |
| 484 | } |
Devang Patel | acd7236 | 2011-03-30 00:08:31 +0000 | [diff] [blame] | 485 | // There is no need to emit line number for unconditional branch. |
| 486 | if (getDebugInfo()) |
| 487 | Builder.SetCurrentDebugLocation(llvm::DebugLoc()); |
Daniel Dunbar | d57a871 | 2008-11-11 09:41:28 +0000 | [diff] [blame] | 488 | EmitBranch(ContBlock); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 489 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 490 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 491 | // Emit the continuation block for code after the if. |
Daniel Dunbar | c22d665 | 2008-11-13 01:54:24 +0000 | [diff] [blame] | 492 | EmitBlock(ContBlock, true); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 493 | } |
| 494 | |
| 495 | void CodeGenFunction::EmitWhileStmt(const WhileStmt &S) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 496 | // Emit the header for the loop, which will also become |
| 497 | // the continue target. |
| 498 | JumpDest LoopHeader = getJumpDestInCurrentScope("while.cond"); |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 499 | EmitBlock(LoopHeader.getBlock()); |
Mike Stump | 72cac2c | 2009-02-07 18:08:12 +0000 | [diff] [blame] | 500 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 501 | // Create an exit block for when the condition fails, which will |
| 502 | // also become the break target. |
| 503 | JumpDest LoopExit = getJumpDestInCurrentScope("while.end"); |
Mike Stump | 72cac2c | 2009-02-07 18:08:12 +0000 | [diff] [blame] | 504 | |
| 505 | // Store the blocks to use for break and continue. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 506 | BreakContinueStack.push_back(BreakContinue(LoopExit, LoopHeader)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 507 | |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 508 | // C++ [stmt.while]p2: |
| 509 | // When the condition of a while statement is a declaration, the |
| 510 | // scope of the variable that is declared extends from its point |
| 511 | // of declaration (3.3.2) to the end of the while statement. |
| 512 | // [...] |
| 513 | // The object created in a condition is destroyed and created |
| 514 | // with each iteration of the loop. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 515 | RunCleanupsScope ConditionScope(*this); |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 516 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 517 | if (S.getConditionVariable()) |
John McCall | b6bbcc9 | 2010-10-15 04:57:14 +0000 | [diff] [blame] | 518 | EmitAutoVarDecl(*S.getConditionVariable()); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 519 | |
Mike Stump | 16b1620 | 2009-02-07 17:18:33 +0000 | [diff] [blame] | 520 | // Evaluate the conditional in the while header. C99 6.8.5.1: The |
| 521 | // evaluation of the controlling expression takes place before each |
| 522 | // execution of the loop body. |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 523 | llvm::Value *BoolCondVal = EvaluateExprAsBool(S.getCond()); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 524 | |
Devang Patel | 2c30d8f | 2007-10-09 20:51:27 +0000 | [diff] [blame] | 525 | // while(1) is common, avoid extra exit blocks. Be sure |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 526 | // to correctly handle break/continue though. |
Devang Patel | 2c30d8f | 2007-10-09 20:51:27 +0000 | [diff] [blame] | 527 | bool EmitBoolCondBranch = true; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 528 | if (llvm::ConstantInt *C = dyn_cast<llvm::ConstantInt>(BoolCondVal)) |
Devang Patel | 2c30d8f | 2007-10-09 20:51:27 +0000 | [diff] [blame] | 529 | if (C->isOne()) |
| 530 | EmitBoolCondBranch = false; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 531 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 532 | // As long as the condition is true, go to the loop body. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 533 | llvm::BasicBlock *LoopBody = createBasicBlock("while.body"); |
| 534 | if (EmitBoolCondBranch) { |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 535 | llvm::BasicBlock *ExitBlock = LoopExit.getBlock(); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 536 | if (ConditionScope.requiresCleanups()) |
| 537 | ExitBlock = createBasicBlock("while.exit"); |
| 538 | |
| 539 | Builder.CreateCondBr(BoolCondVal, LoopBody, ExitBlock); |
| 540 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 541 | if (ExitBlock != LoopExit.getBlock()) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 542 | EmitBlock(ExitBlock); |
| 543 | EmitBranchThroughCleanup(LoopExit); |
| 544 | } |
| 545 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 546 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 547 | // Emit the loop body. We have to emit this in a cleanup scope |
| 548 | // because it might be a singleton DeclStmt. |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 549 | { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 550 | RunCleanupsScope BodyScope(*this); |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 551 | EmitBlock(LoopBody); |
| 552 | EmitStmt(S.getBody()); |
| 553 | } |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 554 | |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 555 | BreakContinueStack.pop_back(); |
| 556 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 557 | // Immediately force cleanup. |
| 558 | ConditionScope.ForceCleanup(); |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 559 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 560 | // Branch to the loop header again. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 561 | EmitBranch(LoopHeader.getBlock()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 562 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 563 | // Emit the exit block. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 564 | EmitBlock(LoopExit.getBlock(), true); |
Douglas Gregor | 5656e14 | 2009-11-24 21:15:44 +0000 | [diff] [blame] | 565 | |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 566 | // The LoopHeader typically is just a branch if we skipped emitting |
| 567 | // a branch, try to erase it. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 568 | if (!EmitBoolCondBranch) |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 569 | SimplifyForwardingBlocks(LoopHeader.getBlock()); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 570 | } |
| 571 | |
| 572 | void CodeGenFunction::EmitDoStmt(const DoStmt &S) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 573 | JumpDest LoopExit = getJumpDestInCurrentScope("do.end"); |
| 574 | JumpDest LoopCond = getJumpDestInCurrentScope("do.cond"); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 575 | |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 576 | // Store the blocks to use for break and continue. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 577 | BreakContinueStack.push_back(BreakContinue(LoopExit, LoopCond)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 578 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 579 | // Emit the body of the loop. |
| 580 | llvm::BasicBlock *LoopBody = createBasicBlock("do.body"); |
| 581 | EmitBlock(LoopBody); |
| 582 | { |
| 583 | RunCleanupsScope BodyScope(*this); |
| 584 | EmitStmt(S.getBody()); |
| 585 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 586 | |
Anders Carlsson | e4b6d34 | 2009-02-10 05:52:02 +0000 | [diff] [blame] | 587 | BreakContinueStack.pop_back(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 588 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 589 | EmitBlock(LoopCond.getBlock()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 590 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 591 | // C99 6.8.5.2: "The evaluation of the controlling expression takes place |
| 592 | // after each execution of the loop body." |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 593 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 594 | // Evaluate the conditional in the while header. |
| 595 | // C99 6.8.5p2/p4: The first substatement is executed if the expression |
| 596 | // compares unequal to 0. The condition must be a scalar type. |
| 597 | llvm::Value *BoolCondVal = EvaluateExprAsBool(S.getCond()); |
Devang Patel | 05f6e6b | 2007-10-09 20:33:39 +0000 | [diff] [blame] | 598 | |
| 599 | // "do {} while (0)" is common in macros, avoid extra blocks. Be sure |
| 600 | // to correctly handle break/continue though. |
| 601 | bool EmitBoolCondBranch = true; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 602 | if (llvm::ConstantInt *C = dyn_cast<llvm::ConstantInt>(BoolCondVal)) |
Devang Patel | 05f6e6b | 2007-10-09 20:33:39 +0000 | [diff] [blame] | 603 | if (C->isZero()) |
| 604 | EmitBoolCondBranch = false; |
| 605 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 606 | // As long as the condition is true, iterate the loop. |
Devang Patel | 05f6e6b | 2007-10-09 20:33:39 +0000 | [diff] [blame] | 607 | if (EmitBoolCondBranch) |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 608 | Builder.CreateCondBr(BoolCondVal, LoopBody, LoopExit.getBlock()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 609 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 610 | // Emit the exit block. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 611 | EmitBlock(LoopExit.getBlock()); |
Devang Patel | 05f6e6b | 2007-10-09 20:33:39 +0000 | [diff] [blame] | 612 | |
Daniel Dunbar | aa5bd87 | 2009-04-01 04:37:47 +0000 | [diff] [blame] | 613 | // The DoCond block typically is just a branch if we skipped |
| 614 | // emitting a branch, try to erase it. |
| 615 | if (!EmitBoolCondBranch) |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 616 | SimplifyForwardingBlocks(LoopCond.getBlock()); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 617 | } |
| 618 | |
| 619 | void CodeGenFunction::EmitForStmt(const ForStmt &S) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 620 | JumpDest LoopExit = getJumpDestInCurrentScope("for.end"); |
| 621 | |
| 622 | RunCleanupsScope ForScope(*this); |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 623 | |
Devang Patel | 0554e0e | 2010-08-25 00:28:56 +0000 | [diff] [blame] | 624 | CGDebugInfo *DI = getDebugInfo(); |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 625 | if (DI) |
| 626 | DI->EmitLexicalBlockStart(Builder, S.getSourceRange().getBegin()); |
Devang Patel | 0554e0e | 2010-08-25 00:28:56 +0000 | [diff] [blame] | 627 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 628 | // Evaluate the first part before the loop. |
| 629 | if (S.getInit()) |
| 630 | EmitStmt(S.getInit()); |
| 631 | |
| 632 | // Start the loop with a block that tests the condition. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 633 | // If there's an increment, the continue scope will be overwritten |
| 634 | // later. |
| 635 | JumpDest Continue = getJumpDestInCurrentScope("for.cond"); |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 636 | llvm::BasicBlock *CondBlock = Continue.getBlock(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 637 | EmitBlock(CondBlock); |
| 638 | |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 639 | // Create a cleanup scope for the condition variable cleanups. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 640 | RunCleanupsScope ConditionScope(*this); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 641 | |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 642 | llvm::Value *BoolCondVal = 0; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 643 | if (S.getCond()) { |
Douglas Gregor | 99e9b4d | 2009-11-25 00:27:52 +0000 | [diff] [blame] | 644 | // If the for statement has a condition scope, emit the local variable |
| 645 | // declaration. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 646 | llvm::BasicBlock *ExitBlock = LoopExit.getBlock(); |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 647 | if (S.getConditionVariable()) { |
John McCall | b6bbcc9 | 2010-10-15 04:57:14 +0000 | [diff] [blame] | 648 | EmitAutoVarDecl(*S.getConditionVariable()); |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 649 | } |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 650 | |
| 651 | // If there are any cleanups between here and the loop-exit scope, |
| 652 | // create a block to stage a loop exit along. |
| 653 | if (ForScope.requiresCleanups()) |
| 654 | ExitBlock = createBasicBlock("for.cond.cleanup"); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 655 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 656 | // As long as the condition is true, iterate the loop. |
Daniel Dunbar | 9615ecb | 2008-11-13 01:38:36 +0000 | [diff] [blame] | 657 | llvm::BasicBlock *ForBody = createBasicBlock("for.body"); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 658 | |
Chris Lattner | 31a0984 | 2008-11-12 08:04:58 +0000 | [diff] [blame] | 659 | // C99 6.8.5p2/p4: The first substatement is executed if the expression |
| 660 | // compares unequal to 0. The condition must be a scalar type. |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 661 | BoolCondVal = EvaluateExprAsBool(S.getCond()); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 662 | Builder.CreateCondBr(BoolCondVal, ForBody, ExitBlock); |
| 663 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 664 | if (ExitBlock != LoopExit.getBlock()) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 665 | EmitBlock(ExitBlock); |
| 666 | EmitBranchThroughCleanup(LoopExit); |
| 667 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 668 | |
| 669 | EmitBlock(ForBody); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 670 | } else { |
| 671 | // Treat it as a non-zero constant. Don't even create a new block for the |
| 672 | // body, just fall into it. |
| 673 | } |
| 674 | |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 675 | // If the for loop doesn't have an increment we can just use the |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 676 | // condition as the continue block. Otherwise we'll need to create |
| 677 | // a block for it (in the current scope, i.e. in the scope of the |
| 678 | // condition), and that we will become our continue block. |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 679 | if (S.getInc()) |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 680 | Continue = getJumpDestInCurrentScope("for.inc"); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 681 | |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 682 | // Store the blocks to use for break and continue. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 683 | BreakContinueStack.push_back(BreakContinue(LoopExit, Continue)); |
Mike Stump | 3e9da66 | 2009-02-07 23:02:10 +0000 | [diff] [blame] | 684 | |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 685 | { |
| 686 | // Create a separate cleanup scope for the body, in case it is not |
| 687 | // a compound statement. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 688 | RunCleanupsScope BodyScope(*this); |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 689 | EmitStmt(S.getBody()); |
| 690 | } |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 691 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 692 | // If there is an increment, emit it next. |
Daniel Dunbar | ad12b6d | 2008-09-28 00:19:22 +0000 | [diff] [blame] | 693 | if (S.getInc()) { |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 694 | EmitBlock(Continue.getBlock()); |
Chris Lattner | 883f6a7 | 2007-08-11 00:04:45 +0000 | [diff] [blame] | 695 | EmitStmt(S.getInc()); |
Daniel Dunbar | ad12b6d | 2008-09-28 00:19:22 +0000 | [diff] [blame] | 696 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 697 | |
Douglas Gregor | 45d3fe1 | 2010-05-21 18:36:48 +0000 | [diff] [blame] | 698 | BreakContinueStack.pop_back(); |
Douglas Gregor | d975206 | 2009-11-25 01:51:31 +0000 | [diff] [blame] | 699 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 700 | ConditionScope.ForceCleanup(); |
| 701 | EmitBranch(CondBlock); |
| 702 | |
| 703 | ForScope.ForceCleanup(); |
| 704 | |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 705 | if (DI) |
| 706 | DI->EmitLexicalBlockEnd(Builder, S.getSourceRange().getEnd()); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 707 | |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 708 | // Emit the fall-through block. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 709 | EmitBlock(LoopExit.getBlock(), true); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 710 | } |
| 711 | |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 712 | void CodeGenFunction::EmitCXXForRangeStmt(const CXXForRangeStmt &S) { |
| 713 | JumpDest LoopExit = getJumpDestInCurrentScope("for.end"); |
| 714 | |
| 715 | RunCleanupsScope ForScope(*this); |
| 716 | |
| 717 | CGDebugInfo *DI = getDebugInfo(); |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 718 | if (DI) |
| 719 | DI->EmitLexicalBlockStart(Builder, S.getSourceRange().getBegin()); |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 720 | |
| 721 | // Evaluate the first pieces before the loop. |
| 722 | EmitStmt(S.getRangeStmt()); |
| 723 | EmitStmt(S.getBeginEndStmt()); |
| 724 | |
| 725 | // Start the loop with a block that tests the condition. |
| 726 | // If there's an increment, the continue scope will be overwritten |
| 727 | // later. |
| 728 | llvm::BasicBlock *CondBlock = createBasicBlock("for.cond"); |
| 729 | EmitBlock(CondBlock); |
| 730 | |
| 731 | // If there are any cleanups between here and the loop-exit scope, |
| 732 | // create a block to stage a loop exit along. |
| 733 | llvm::BasicBlock *ExitBlock = LoopExit.getBlock(); |
| 734 | if (ForScope.requiresCleanups()) |
| 735 | ExitBlock = createBasicBlock("for.cond.cleanup"); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 736 | |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 737 | // The loop body, consisting of the specified body and the loop variable. |
| 738 | llvm::BasicBlock *ForBody = createBasicBlock("for.body"); |
| 739 | |
| 740 | // The body is executed if the expression, contextually converted |
| 741 | // to bool, is true. |
| 742 | llvm::Value *BoolCondVal = EvaluateExprAsBool(S.getCond()); |
| 743 | Builder.CreateCondBr(BoolCondVal, ForBody, ExitBlock); |
| 744 | |
| 745 | if (ExitBlock != LoopExit.getBlock()) { |
| 746 | EmitBlock(ExitBlock); |
| 747 | EmitBranchThroughCleanup(LoopExit); |
| 748 | } |
| 749 | |
| 750 | EmitBlock(ForBody); |
| 751 | |
| 752 | // Create a block for the increment. In case of a 'continue', we jump there. |
| 753 | JumpDest Continue = getJumpDestInCurrentScope("for.inc"); |
| 754 | |
| 755 | // Store the blocks to use for break and continue. |
| 756 | BreakContinueStack.push_back(BreakContinue(LoopExit, Continue)); |
| 757 | |
| 758 | { |
| 759 | // Create a separate cleanup scope for the loop variable and body. |
| 760 | RunCleanupsScope BodyScope(*this); |
| 761 | EmitStmt(S.getLoopVarStmt()); |
| 762 | EmitStmt(S.getBody()); |
| 763 | } |
| 764 | |
| 765 | // If there is an increment, emit it next. |
| 766 | EmitBlock(Continue.getBlock()); |
| 767 | EmitStmt(S.getInc()); |
| 768 | |
| 769 | BreakContinueStack.pop_back(); |
| 770 | |
| 771 | EmitBranch(CondBlock); |
| 772 | |
| 773 | ForScope.ForceCleanup(); |
| 774 | |
Eric Christopher | 73fb350 | 2011-10-13 21:45:18 +0000 | [diff] [blame] | 775 | if (DI) |
| 776 | DI->EmitLexicalBlockEnd(Builder, S.getSourceRange().getEnd()); |
Richard Smith | ad762fc | 2011-04-14 22:09:26 +0000 | [diff] [blame] | 777 | |
| 778 | // Emit the fall-through block. |
| 779 | EmitBlock(LoopExit.getBlock(), true); |
| 780 | } |
| 781 | |
Daniel Dunbar | 29e0bcc | 2008-09-24 04:00:38 +0000 | [diff] [blame] | 782 | void CodeGenFunction::EmitReturnOfRValue(RValue RV, QualType Ty) { |
| 783 | if (RV.isScalar()) { |
| 784 | Builder.CreateStore(RV.getScalarVal(), ReturnValue); |
| 785 | } else if (RV.isAggregate()) { |
Chad Rosier | 649b4a1 | 2012-03-29 17:37:10 +0000 | [diff] [blame] | 786 | EmitAggregateCopy(ReturnValue, RV.getAggregateAddr(), Ty); |
Daniel Dunbar | 29e0bcc | 2008-09-24 04:00:38 +0000 | [diff] [blame] | 787 | } else { |
John McCall | 9d232c8 | 2013-03-07 21:37:08 +0000 | [diff] [blame] | 788 | EmitStoreOfComplex(RV.getComplexVal(), |
| 789 | MakeNaturalAlignAddrLValue(ReturnValue, Ty), |
| 790 | /*init*/ true); |
Daniel Dunbar | 29e0bcc | 2008-09-24 04:00:38 +0000 | [diff] [blame] | 791 | } |
Anders Carlsson | 82d8ef0 | 2009-02-09 20:31:03 +0000 | [diff] [blame] | 792 | EmitBranchThroughCleanup(ReturnBlock); |
Daniel Dunbar | 29e0bcc | 2008-09-24 04:00:38 +0000 | [diff] [blame] | 793 | } |
| 794 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 795 | /// EmitReturnStmt - Note that due to GCC extensions, this can have an operand |
| 796 | /// if the function returns void, or may be missing one if the function returns |
| 797 | /// non-void. Fun stuff :). |
| 798 | void CodeGenFunction::EmitReturnStmt(const ReturnStmt &S) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 799 | // Emit the result value, even if unused, to evalute the side effects. |
| 800 | const Expr *RV = S.getRetValue(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 801 | |
John McCall | 9f357de | 2012-09-25 06:56:03 +0000 | [diff] [blame] | 802 | // Treat block literals in a return expression as if they appeared |
| 803 | // in their own scope. This permits a small, easily-implemented |
| 804 | // exception to our over-conservative rules about not jumping to |
| 805 | // statements following block literals with non-trivial cleanups. |
| 806 | RunCleanupsScope cleanupScope(*this); |
| 807 | if (const ExprWithCleanups *cleanups = |
| 808 | dyn_cast_or_null<ExprWithCleanups>(RV)) { |
| 809 | enterFullExpression(cleanups); |
| 810 | RV = cleanups->getSubExpr(); |
| 811 | } |
| 812 | |
Daniel Dunbar | 5ca2084 | 2008-09-09 21:00:17 +0000 | [diff] [blame] | 813 | // FIXME: Clean this up by using an LValue for ReturnTemp, |
| 814 | // EmitStoreThroughLValue, and EmitAnyExpr. |
Rafael Espindola | 6c82fc6 | 2013-03-26 18:41:47 +0000 | [diff] [blame] | 815 | if (S.getNRVOCandidate() && S.getNRVOCandidate()->isNRVOVariable()) { |
Douglas Gregor | d86c477 | 2010-05-15 06:46:45 +0000 | [diff] [blame] | 816 | // Apply the named return value optimization for this return statement, |
| 817 | // which means doing nothing: the appropriate result has already been |
| 818 | // constructed into the NRVO variable. |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 819 | |
Douglas Gregor | 3d91bbc | 2010-05-17 15:52:46 +0000 | [diff] [blame] | 820 | // If there is an NRVO flag for this variable, set it to 1 into indicate |
| 821 | // that the cleanup code should not destroy the variable. |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 822 | if (llvm::Value *NRVOFlag = NRVOFlags[S.getNRVOCandidate()]) |
| 823 | Builder.CreateStore(Builder.getTrue(), NRVOFlag); |
Douglas Gregor | d86c477 | 2010-05-15 06:46:45 +0000 | [diff] [blame] | 824 | } else if (!ReturnValue) { |
Daniel Dunbar | 5ca2084 | 2008-09-09 21:00:17 +0000 | [diff] [blame] | 825 | // Make sure not to return anything, but evaluate the expression |
| 826 | // for side effects. |
| 827 | if (RV) |
Eli Friedman | 144ac61 | 2008-05-22 01:22:33 +0000 | [diff] [blame] | 828 | EmitAnyExpr(RV); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 829 | } else if (RV == 0) { |
Daniel Dunbar | 5ca2084 | 2008-09-09 21:00:17 +0000 | [diff] [blame] | 830 | // Do nothing (return value is left uninitialized) |
Eli Friedman | d54b6ac | 2009-05-27 04:56:12 +0000 | [diff] [blame] | 831 | } else if (FnRetTy->isReferenceType()) { |
| 832 | // If this function returns a reference, take the address of the expression |
| 833 | // rather than the value. |
Richard Smith | d4ec562 | 2013-06-12 23:38:09 +0000 | [diff] [blame] | 834 | RValue Result = EmitReferenceBindingToExpr(RV); |
Douglas Gregor | 33fd1fc | 2010-03-24 23:14:04 +0000 | [diff] [blame] | 835 | Builder.CreateStore(Result.getScalarVal(), ReturnValue); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 836 | } else { |
John McCall | 9d232c8 | 2013-03-07 21:37:08 +0000 | [diff] [blame] | 837 | switch (getEvaluationKind(RV->getType())) { |
| 838 | case TEK_Scalar: |
| 839 | Builder.CreateStore(EmitScalarExpr(RV), ReturnValue); |
| 840 | break; |
| 841 | case TEK_Complex: |
| 842 | EmitComplexExprIntoLValue(RV, |
| 843 | MakeNaturalAlignAddrLValue(ReturnValue, RV->getType()), |
| 844 | /*isInit*/ true); |
| 845 | break; |
| 846 | case TEK_Aggregate: { |
| 847 | CharUnits Alignment = getContext().getTypeAlignInChars(RV->getType()); |
| 848 | EmitAggExpr(RV, AggValueSlot::forAddr(ReturnValue, Alignment, |
| 849 | Qualifiers(), |
| 850 | AggValueSlot::IsDestructed, |
| 851 | AggValueSlot::DoesNotNeedGCBarriers, |
| 852 | AggValueSlot::IsNotAliased)); |
| 853 | break; |
| 854 | } |
| 855 | } |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 856 | } |
Eli Friedman | 144ac61 | 2008-05-22 01:22:33 +0000 | [diff] [blame] | 857 | |
Adrian Prantl | ddb379e | 2013-05-07 22:41:09 +0000 | [diff] [blame] | 858 | ++NumReturnExprs; |
Adrian Prantl | fa6b079 | 2013-05-02 17:30:20 +0000 | [diff] [blame] | 859 | if (RV == 0 || RV->isEvaluatable(getContext())) |
Adrian Prantl | ddb379e | 2013-05-07 22:41:09 +0000 | [diff] [blame] | 860 | ++NumSimpleReturnExprs; |
Adrian Prantl | fa6b079 | 2013-05-02 17:30:20 +0000 | [diff] [blame] | 861 | |
John McCall | 9f357de | 2012-09-25 06:56:03 +0000 | [diff] [blame] | 862 | cleanupScope.ForceCleanup(); |
Anders Carlsson | 82d8ef0 | 2009-02-09 20:31:03 +0000 | [diff] [blame] | 863 | EmitBranchThroughCleanup(ReturnBlock); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 864 | } |
| 865 | |
| 866 | void CodeGenFunction::EmitDeclStmt(const DeclStmt &S) { |
Devang Patel | 9198126 | 2011-06-04 00:38:02 +0000 | [diff] [blame] | 867 | // As long as debug info is modeled with instructions, we have to ensure we |
| 868 | // have a place to insert here and write the stop point here. |
Eric Christopher | 2b124ea | 2012-04-10 05:04:07 +0000 | [diff] [blame] | 869 | if (HaveInsertPoint()) |
Devang Patel | 9198126 | 2011-06-04 00:38:02 +0000 | [diff] [blame] | 870 | EmitStopPoint(&S); |
| 871 | |
Ted Kremenek | e4ea1f4 | 2008-10-06 18:42:27 +0000 | [diff] [blame] | 872 | for (DeclStmt::const_decl_iterator I = S.decl_begin(), E = S.decl_end(); |
| 873 | I != E; ++I) |
| 874 | EmitDecl(**I); |
Chris Lattner | 6fa5f09 | 2007-07-12 15:43:07 +0000 | [diff] [blame] | 875 | } |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 876 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 877 | void CodeGenFunction::EmitBreakStmt(const BreakStmt &S) { |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 878 | assert(!BreakContinueStack.empty() && "break stmt not in a loop or switch!"); |
| 879 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 880 | // If this code is reachable then emit a stop point (if generating |
| 881 | // debug info). We have to do this ourselves because we are on the |
| 882 | // "simple" statement path. |
| 883 | if (HaveInsertPoint()) |
| 884 | EmitStopPoint(&S); |
Mike Stump | ec9771d | 2009-02-08 09:22:19 +0000 | [diff] [blame] | 885 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 886 | JumpDest Block = BreakContinueStack.back().BreakBlock; |
Anders Carlsson | 82d8ef0 | 2009-02-09 20:31:03 +0000 | [diff] [blame] | 887 | EmitBranchThroughCleanup(Block); |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 888 | } |
| 889 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 890 | void CodeGenFunction::EmitContinueStmt(const ContinueStmt &S) { |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 891 | assert(!BreakContinueStack.empty() && "continue stmt not in a loop!"); |
| 892 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 893 | // If this code is reachable then emit a stop point (if generating |
| 894 | // debug info). We have to do this ourselves because we are on the |
| 895 | // "simple" statement path. |
| 896 | if (HaveInsertPoint()) |
| 897 | EmitStopPoint(&S); |
Mike Stump | ec9771d | 2009-02-08 09:22:19 +0000 | [diff] [blame] | 898 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 899 | JumpDest Block = BreakContinueStack.back().ContinueBlock; |
Anders Carlsson | 82d8ef0 | 2009-02-09 20:31:03 +0000 | [diff] [blame] | 900 | EmitBranchThroughCleanup(Block); |
Chris Lattner | da13870 | 2007-07-16 21:28:45 +0000 | [diff] [blame] | 901 | } |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 902 | |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 903 | /// EmitCaseStmtRange - If case statement range is not too big then |
| 904 | /// add multiple cases to switch instruction, one for each value within |
| 905 | /// the range. If range is too big then emit "if" condition check. |
| 906 | void CodeGenFunction::EmitCaseStmtRange(const CaseStmt &S) { |
Daniel Dunbar | 4efde8d | 2008-07-24 01:18:41 +0000 | [diff] [blame] | 907 | assert(S.getRHS() && "Expected RHS value in CaseStmt"); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 908 | |
Richard Smith | a6b8b2c | 2011-10-10 18:28:20 +0000 | [diff] [blame] | 909 | llvm::APSInt LHS = S.getLHS()->EvaluateKnownConstInt(getContext()); |
| 910 | llvm::APSInt RHS = S.getRHS()->EvaluateKnownConstInt(getContext()); |
Daniel Dunbar | 4efde8d | 2008-07-24 01:18:41 +0000 | [diff] [blame] | 911 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 912 | // Emit the code for this case. We do this first to make sure it is |
| 913 | // properly chained from our predecessor before generating the |
| 914 | // switch machinery to enter this block. |
Daniel Dunbar | f84dcda | 2008-11-11 04:12:31 +0000 | [diff] [blame] | 915 | EmitBlock(createBasicBlock("sw.bb")); |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 916 | llvm::BasicBlock *CaseDest = Builder.GetInsertBlock(); |
| 917 | EmitStmt(S.getSubStmt()); |
| 918 | |
Daniel Dunbar | 4efde8d | 2008-07-24 01:18:41 +0000 | [diff] [blame] | 919 | // If range is empty, do nothing. |
| 920 | if (LHS.isSigned() ? RHS.slt(LHS) : RHS.ult(LHS)) |
| 921 | return; |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 922 | |
| 923 | llvm::APInt Range = RHS - LHS; |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 924 | // FIXME: parameters such as this should not be hardcoded. |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 925 | if (Range.ult(llvm::APInt(Range.getBitWidth(), 64))) { |
| 926 | // Range is small enough to add multiple switch instruction cases. |
Daniel Dunbar | 4efde8d | 2008-07-24 01:18:41 +0000 | [diff] [blame] | 927 | for (unsigned i = 0, e = Range.getZExtValue() + 1; i != e; ++i) { |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 928 | SwitchInsn->addCase(Builder.getInt(LHS), CaseDest); |
Devang Patel | 2d79d0f | 2007-10-05 20:54:07 +0000 | [diff] [blame] | 929 | LHS++; |
| 930 | } |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 931 | return; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 932 | } |
| 933 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 934 | // The range is too big. Emit "if" condition into a new block, |
| 935 | // making sure to save and restore the current insertion point. |
| 936 | llvm::BasicBlock *RestoreBB = Builder.GetInsertBlock(); |
Devang Patel | 2d79d0f | 2007-10-05 20:54:07 +0000 | [diff] [blame] | 937 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 938 | // Push this test onto the chain of range checks (which terminates |
| 939 | // in the default basic block). The switch's default will be changed |
| 940 | // to the top of this chain after switch emission is complete. |
| 941 | llvm::BasicBlock *FalseDest = CaseRangeBlock; |
Daniel Dunbar | 55e8742 | 2008-11-11 02:29:29 +0000 | [diff] [blame] | 942 | CaseRangeBlock = createBasicBlock("sw.caserange"); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 943 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 944 | CurFn->getBasicBlockList().push_back(CaseRangeBlock); |
| 945 | Builder.SetInsertPoint(CaseRangeBlock); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 946 | |
| 947 | // Emit range check. |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 948 | llvm::Value *Diff = |
Benjamin Kramer | 578faa8 | 2011-09-27 21:06:10 +0000 | [diff] [blame] | 949 | Builder.CreateSub(SwitchInsn->getCondition(), Builder.getInt(LHS)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 950 | llvm::Value *Cond = |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 951 | Builder.CreateICmpULE(Diff, Builder.getInt(Range), "inbounds"); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 952 | Builder.CreateCondBr(Cond, CaseDest, FalseDest); |
| 953 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 954 | // Restore the appropriate insertion point. |
Daniel Dunbar | a448fb2 | 2008-11-11 23:11:34 +0000 | [diff] [blame] | 955 | if (RestoreBB) |
| 956 | Builder.SetInsertPoint(RestoreBB); |
| 957 | else |
| 958 | Builder.ClearInsertionPoint(); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 959 | } |
| 960 | |
| 961 | void CodeGenFunction::EmitCaseStmt(const CaseStmt &S) { |
Fariborz Jahanian | d66715d | 2012-01-16 17:35:57 +0000 | [diff] [blame] | 962 | // If there is no enclosing switch instance that we're aware of, then this |
| 963 | // case statement and its block can be elided. This situation only happens |
| 964 | // when we've constant-folded the switch, are emitting the constant case, |
| 965 | // and part of the constant case includes another case statement. For |
| 966 | // instance: switch (4) { case 4: do { case 5: } while (1); } |
Fariborz Jahanian | 303b4f9 | 2012-01-17 23:55:19 +0000 | [diff] [blame] | 967 | if (!SwitchInsn) { |
| 968 | EmitStmt(S.getSubStmt()); |
Fariborz Jahanian | d66715d | 2012-01-16 17:35:57 +0000 | [diff] [blame] | 969 | return; |
Fariborz Jahanian | 303b4f9 | 2012-01-17 23:55:19 +0000 | [diff] [blame] | 970 | } |
Fariborz Jahanian | d66715d | 2012-01-16 17:35:57 +0000 | [diff] [blame] | 971 | |
Chris Lattner | b11f919 | 2011-04-17 00:54:30 +0000 | [diff] [blame] | 972 | // Handle case ranges. |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 973 | if (S.getRHS()) { |
| 974 | EmitCaseStmtRange(S); |
| 975 | return; |
| 976 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 977 | |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 978 | llvm::ConstantInt *CaseVal = |
Richard Smith | a6b8b2c | 2011-10-10 18:28:20 +0000 | [diff] [blame] | 979 | Builder.getInt(S.getLHS()->EvaluateKnownConstInt(getContext())); |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 980 | |
Chris Lattner | 4210486 | 2011-04-17 23:21:26 +0000 | [diff] [blame] | 981 | // If the body of the case is just a 'break', and if there was no fallthrough, |
| 982 | // try to not emit an empty block. |
Chad Rosier | 1708360 | 2012-08-24 18:31:16 +0000 | [diff] [blame] | 983 | if ((CGM.getCodeGenOpts().OptimizationLevel > 0) && |
| 984 | isa<BreakStmt>(S.getSubStmt())) { |
Chris Lattner | b11f919 | 2011-04-17 00:54:30 +0000 | [diff] [blame] | 985 | JumpDest Block = BreakContinueStack.back().BreakBlock; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 986 | |
Chris Lattner | b11f919 | 2011-04-17 00:54:30 +0000 | [diff] [blame] | 987 | // Only do this optimization if there are no cleanups that need emitting. |
| 988 | if (isObviouslyBranchWithoutCleanups(Block)) { |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 989 | SwitchInsn->addCase(CaseVal, Block.getBlock()); |
Chris Lattner | 4210486 | 2011-04-17 23:21:26 +0000 | [diff] [blame] | 990 | |
| 991 | // If there was a fallthrough into this case, make sure to redirect it to |
| 992 | // the end of the switch as well. |
| 993 | if (Builder.GetInsertBlock()) { |
| 994 | Builder.CreateBr(Block.getBlock()); |
| 995 | Builder.ClearInsertionPoint(); |
| 996 | } |
Chris Lattner | b11f919 | 2011-04-17 00:54:30 +0000 | [diff] [blame] | 997 | return; |
| 998 | } |
| 999 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1000 | |
Daniel Dunbar | f84dcda | 2008-11-11 04:12:31 +0000 | [diff] [blame] | 1001 | EmitBlock(createBasicBlock("sw.bb")); |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 1002 | llvm::BasicBlock *CaseDest = Builder.GetInsertBlock(); |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 1003 | SwitchInsn->addCase(CaseVal, CaseDest); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1004 | |
Chris Lattner | 5512f28 | 2009-03-04 04:46:18 +0000 | [diff] [blame] | 1005 | // Recursively emitting the statement is acceptable, but is not wonderful for |
| 1006 | // code where we have many case statements nested together, i.e.: |
| 1007 | // case 1: |
| 1008 | // case 2: |
| 1009 | // case 3: etc. |
| 1010 | // Handling this recursively will create a new block for each case statement |
| 1011 | // that falls through to the next case which is IR intensive. It also causes |
| 1012 | // deep recursion which can run into stack depth limitations. Handle |
| 1013 | // sequential non-range case statements specially. |
| 1014 | const CaseStmt *CurCase = &S; |
| 1015 | const CaseStmt *NextCase = dyn_cast<CaseStmt>(S.getSubStmt()); |
| 1016 | |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 1017 | // Otherwise, iteratively add consecutive cases to this switch stmt. |
Chris Lattner | 5512f28 | 2009-03-04 04:46:18 +0000 | [diff] [blame] | 1018 | while (NextCase && NextCase->getRHS() == 0) { |
| 1019 | CurCase = NextCase; |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 1020 | llvm::ConstantInt *CaseVal = |
Richard Smith | a6b8b2c | 2011-10-10 18:28:20 +0000 | [diff] [blame] | 1021 | Builder.getInt(CurCase->getLHS()->EvaluateKnownConstInt(getContext())); |
Chris Lattner | 97d5437 | 2011-04-19 20:53:45 +0000 | [diff] [blame] | 1022 | SwitchInsn->addCase(CaseVal, CaseDest); |
Chris Lattner | 5512f28 | 2009-03-04 04:46:18 +0000 | [diff] [blame] | 1023 | NextCase = dyn_cast<CaseStmt>(CurCase->getSubStmt()); |
| 1024 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1025 | |
Chris Lattner | 5512f28 | 2009-03-04 04:46:18 +0000 | [diff] [blame] | 1026 | // Normal default recursion for non-cases. |
| 1027 | EmitStmt(CurCase->getSubStmt()); |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1028 | } |
| 1029 | |
| 1030 | void CodeGenFunction::EmitDefaultStmt(const DefaultStmt &S) { |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1031 | llvm::BasicBlock *DefaultBlock = SwitchInsn->getDefaultDest(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1032 | assert(DefaultBlock->empty() && |
Daniel Dunbar | 55e8742 | 2008-11-11 02:29:29 +0000 | [diff] [blame] | 1033 | "EmitDefaultStmt: Default block already defined?"); |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1034 | EmitBlock(DefaultBlock); |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1035 | EmitStmt(S.getSubStmt()); |
| 1036 | } |
| 1037 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1038 | /// CollectStatementsForCase - Given the body of a 'switch' statement and a |
| 1039 | /// constant value that is being switched on, see if we can dead code eliminate |
| 1040 | /// the body of the switch to a simple series of statements to emit. Basically, |
| 1041 | /// on a switch (5) we want to find these statements: |
| 1042 | /// case 5: |
| 1043 | /// printf(...); <-- |
| 1044 | /// ++i; <-- |
| 1045 | /// break; |
| 1046 | /// |
| 1047 | /// and add them to the ResultStmts vector. If it is unsafe to do this |
| 1048 | /// transformation (for example, one of the elided statements contains a label |
| 1049 | /// that might be jumped to), return CSFC_Failure. If we handled it and 'S' |
| 1050 | /// should include statements after it (e.g. the printf() line is a substmt of |
| 1051 | /// the case) then return CSFC_FallThrough. If we handled it and found a break |
| 1052 | /// statement, then return CSFC_Success. |
| 1053 | /// |
| 1054 | /// If Case is non-null, then we are looking for the specified case, checking |
| 1055 | /// that nothing we jump over contains labels. If Case is null, then we found |
| 1056 | /// the case and are looking for the break. |
| 1057 | /// |
| 1058 | /// If the recursive walk actually finds our Case, then we set FoundCase to |
| 1059 | /// true. |
| 1060 | /// |
| 1061 | enum CSFC_Result { CSFC_Failure, CSFC_FallThrough, CSFC_Success }; |
| 1062 | static CSFC_Result CollectStatementsForCase(const Stmt *S, |
| 1063 | const SwitchCase *Case, |
| 1064 | bool &FoundCase, |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1065 | SmallVectorImpl<const Stmt*> &ResultStmts) { |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1066 | // If this is a null statement, just succeed. |
| 1067 | if (S == 0) |
| 1068 | return Case ? CSFC_Success : CSFC_FallThrough; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1069 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1070 | // If this is the switchcase (case 4: or default) that we're looking for, then |
| 1071 | // we're in business. Just add the substatement. |
| 1072 | if (const SwitchCase *SC = dyn_cast<SwitchCase>(S)) { |
| 1073 | if (S == Case) { |
| 1074 | FoundCase = true; |
| 1075 | return CollectStatementsForCase(SC->getSubStmt(), 0, FoundCase, |
| 1076 | ResultStmts); |
| 1077 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1078 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1079 | // Otherwise, this is some other case or default statement, just ignore it. |
| 1080 | return CollectStatementsForCase(SC->getSubStmt(), Case, FoundCase, |
| 1081 | ResultStmts); |
| 1082 | } |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1083 | |
| 1084 | // If we are in the live part of the code and we found our break statement, |
| 1085 | // return a success! |
| 1086 | if (Case == 0 && isa<BreakStmt>(S)) |
| 1087 | return CSFC_Success; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1088 | |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1089 | // If this is a switch statement, then it might contain the SwitchCase, the |
| 1090 | // break, or neither. |
| 1091 | if (const CompoundStmt *CS = dyn_cast<CompoundStmt>(S)) { |
| 1092 | // Handle this as two cases: we might be looking for the SwitchCase (if so |
| 1093 | // the skipped statements must be skippable) or we might already have it. |
| 1094 | CompoundStmt::const_body_iterator I = CS->body_begin(), E = CS->body_end(); |
| 1095 | if (Case) { |
Chris Lattner | 3f06e27 | 2011-02-28 07:22:44 +0000 | [diff] [blame] | 1096 | // Keep track of whether we see a skipped declaration. The code could be |
| 1097 | // using the declaration even if it is skipped, so we can't optimize out |
| 1098 | // the decl if the kept statements might refer to it. |
| 1099 | bool HadSkippedDecl = false; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1100 | |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1101 | // If we're looking for the case, just see if we can skip each of the |
| 1102 | // substatements. |
| 1103 | for (; Case && I != E; ++I) { |
Eli Friedman | 4d50934 | 2011-05-21 19:15:39 +0000 | [diff] [blame] | 1104 | HadSkippedDecl |= isa<DeclStmt>(*I); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1105 | |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1106 | switch (CollectStatementsForCase(*I, Case, FoundCase, ResultStmts)) { |
| 1107 | case CSFC_Failure: return CSFC_Failure; |
| 1108 | case CSFC_Success: |
| 1109 | // A successful result means that either 1) that the statement doesn't |
| 1110 | // have the case and is skippable, or 2) does contain the case value |
Chris Lattner | 9467110 | 2011-02-28 07:16:14 +0000 | [diff] [blame] | 1111 | // and also contains the break to exit the switch. In the later case, |
| 1112 | // we just verify the rest of the statements are elidable. |
| 1113 | if (FoundCase) { |
Chris Lattner | 3f06e27 | 2011-02-28 07:22:44 +0000 | [diff] [blame] | 1114 | // If we found the case and skipped declarations, we can't do the |
| 1115 | // optimization. |
| 1116 | if (HadSkippedDecl) |
| 1117 | return CSFC_Failure; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1118 | |
Chris Lattner | 9467110 | 2011-02-28 07:16:14 +0000 | [diff] [blame] | 1119 | for (++I; I != E; ++I) |
| 1120 | if (CodeGenFunction::ContainsLabel(*I, true)) |
| 1121 | return CSFC_Failure; |
| 1122 | return CSFC_Success; |
| 1123 | } |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1124 | break; |
| 1125 | case CSFC_FallThrough: |
| 1126 | // If we have a fallthrough condition, then we must have found the |
| 1127 | // case started to include statements. Consider the rest of the |
| 1128 | // statements in the compound statement as candidates for inclusion. |
| 1129 | assert(FoundCase && "Didn't find case but returned fallthrough?"); |
| 1130 | // We recursively found Case, so we're not looking for it anymore. |
| 1131 | Case = 0; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1132 | |
Chris Lattner | 3f06e27 | 2011-02-28 07:22:44 +0000 | [diff] [blame] | 1133 | // If we found the case and skipped declarations, we can't do the |
| 1134 | // optimization. |
| 1135 | if (HadSkippedDecl) |
| 1136 | return CSFC_Failure; |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1137 | break; |
| 1138 | } |
| 1139 | } |
| 1140 | } |
| 1141 | |
| 1142 | // If we have statements in our range, then we know that the statements are |
| 1143 | // live and need to be added to the set of statements we're tracking. |
| 1144 | for (; I != E; ++I) { |
| 1145 | switch (CollectStatementsForCase(*I, 0, FoundCase, ResultStmts)) { |
| 1146 | case CSFC_Failure: return CSFC_Failure; |
| 1147 | case CSFC_FallThrough: |
| 1148 | // A fallthrough result means that the statement was simple and just |
| 1149 | // included in ResultStmt, keep adding them afterwards. |
| 1150 | break; |
| 1151 | case CSFC_Success: |
| 1152 | // A successful result means that we found the break statement and |
| 1153 | // stopped statement inclusion. We just ensure that any leftover stmts |
| 1154 | // are skippable and return success ourselves. |
| 1155 | for (++I; I != E; ++I) |
| 1156 | if (CodeGenFunction::ContainsLabel(*I, true)) |
| 1157 | return CSFC_Failure; |
| 1158 | return CSFC_Success; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1159 | } |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1160 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1161 | |
Chris Lattner | 3858938 | 2011-02-28 01:02:29 +0000 | [diff] [blame] | 1162 | return Case ? CSFC_Success : CSFC_FallThrough; |
| 1163 | } |
| 1164 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1165 | // Okay, this is some other statement that we don't handle explicitly, like a |
| 1166 | // for statement or increment etc. If we are skipping over this statement, |
| 1167 | // just verify it doesn't have labels, which would make it invalid to elide. |
| 1168 | if (Case) { |
Chris Lattner | 3f06e27 | 2011-02-28 07:22:44 +0000 | [diff] [blame] | 1169 | if (CodeGenFunction::ContainsLabel(S, true)) |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1170 | return CSFC_Failure; |
| 1171 | return CSFC_Success; |
| 1172 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1173 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1174 | // Otherwise, we want to include this statement. Everything is cool with that |
| 1175 | // so long as it doesn't contain a break out of the switch we're in. |
| 1176 | if (CodeGenFunction::containsBreak(S)) return CSFC_Failure; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1177 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1178 | // Otherwise, everything is great. Include the statement and tell the caller |
| 1179 | // that we fall through and include the next statement as well. |
| 1180 | ResultStmts.push_back(S); |
| 1181 | return CSFC_FallThrough; |
| 1182 | } |
| 1183 | |
| 1184 | /// FindCaseStatementsForValue - Find the case statement being jumped to and |
| 1185 | /// then invoke CollectStatementsForCase to find the list of statements to emit |
| 1186 | /// for a switch on constant. See the comment above CollectStatementsForCase |
| 1187 | /// for more details. |
| 1188 | static bool FindCaseStatementsForValue(const SwitchStmt &S, |
Richard Trieu | e1ecdc1 | 2012-07-23 20:21:35 +0000 | [diff] [blame] | 1189 | const llvm::APSInt &ConstantCondValue, |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1190 | SmallVectorImpl<const Stmt*> &ResultStmts, |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1191 | ASTContext &C) { |
| 1192 | // First step, find the switch case that is being branched to. We can do this |
| 1193 | // efficiently by scanning the SwitchCase list. |
| 1194 | const SwitchCase *Case = S.getSwitchCaseList(); |
| 1195 | const DefaultStmt *DefaultCase = 0; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1196 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1197 | for (; Case; Case = Case->getNextSwitchCase()) { |
| 1198 | // It's either a default or case. Just remember the default statement in |
| 1199 | // case we're not jumping to any numbered cases. |
| 1200 | if (const DefaultStmt *DS = dyn_cast<DefaultStmt>(Case)) { |
| 1201 | DefaultCase = DS; |
| 1202 | continue; |
| 1203 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1204 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1205 | // Check to see if this case is the one we're looking for. |
| 1206 | const CaseStmt *CS = cast<CaseStmt>(Case); |
| 1207 | // Don't handle case ranges yet. |
| 1208 | if (CS->getRHS()) return false; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1209 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1210 | // If we found our case, remember it as 'case'. |
Richard Smith | a6b8b2c | 2011-10-10 18:28:20 +0000 | [diff] [blame] | 1211 | if (CS->getLHS()->EvaluateKnownConstInt(C) == ConstantCondValue) |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1212 | break; |
| 1213 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1214 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1215 | // If we didn't find a matching case, we use a default if it exists, or we |
| 1216 | // elide the whole switch body! |
| 1217 | if (Case == 0) { |
| 1218 | // It is safe to elide the body of the switch if it doesn't contain labels |
| 1219 | // etc. If it is safe, return successfully with an empty ResultStmts list. |
| 1220 | if (DefaultCase == 0) |
| 1221 | return !CodeGenFunction::ContainsLabel(&S); |
| 1222 | Case = DefaultCase; |
| 1223 | } |
| 1224 | |
| 1225 | // Ok, we know which case is being jumped to, try to collect all the |
| 1226 | // statements that follow it. This can fail for a variety of reasons. Also, |
| 1227 | // check to see that the recursive walk actually found our case statement. |
| 1228 | // Insane cases like this can fail to find it in the recursive walk since we |
| 1229 | // don't handle every stmt kind: |
| 1230 | // switch (4) { |
| 1231 | // while (1) { |
| 1232 | // case 4: ... |
| 1233 | bool FoundCase = false; |
| 1234 | return CollectStatementsForCase(S.getBody(), Case, FoundCase, |
| 1235 | ResultStmts) != CSFC_Failure && |
| 1236 | FoundCase; |
| 1237 | } |
| 1238 | |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1239 | void CodeGenFunction::EmitSwitchStmt(const SwitchStmt &S) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1240 | JumpDest SwitchExit = getJumpDestInCurrentScope("sw.epilog"); |
| 1241 | |
| 1242 | RunCleanupsScope ConditionScope(*this); |
Douglas Gregor | d3d5301 | 2009-11-24 17:07:59 +0000 | [diff] [blame] | 1243 | |
| 1244 | if (S.getConditionVariable()) |
John McCall | b6bbcc9 | 2010-10-15 04:57:14 +0000 | [diff] [blame] | 1245 | EmitAutoVarDecl(*S.getConditionVariable()); |
Douglas Gregor | d3d5301 | 2009-11-24 17:07:59 +0000 | [diff] [blame] | 1246 | |
Fariborz Jahanian | 985df1c | 2012-01-17 23:39:50 +0000 | [diff] [blame] | 1247 | // Handle nested switch statements. |
| 1248 | llvm::SwitchInst *SavedSwitchInsn = SwitchInsn; |
| 1249 | llvm::BasicBlock *SavedCRBlock = CaseRangeBlock; |
| 1250 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1251 | // See if we can constant fold the condition of the switch and therefore only |
| 1252 | // emit the live case statement (if any) of the switch. |
Richard Trieu | e1ecdc1 | 2012-07-23 20:21:35 +0000 | [diff] [blame] | 1253 | llvm::APSInt ConstantCondValue; |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1254 | if (ConstantFoldsToSimpleInteger(S.getCond(), ConstantCondValue)) { |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1255 | SmallVector<const Stmt*, 4> CaseStmts; |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1256 | if (FindCaseStatementsForValue(S, ConstantCondValue, CaseStmts, |
| 1257 | getContext())) { |
| 1258 | RunCleanupsScope ExecutedScope(*this); |
| 1259 | |
Fariborz Jahanian | 985df1c | 2012-01-17 23:39:50 +0000 | [diff] [blame] | 1260 | // At this point, we are no longer "within" a switch instance, so |
| 1261 | // we can temporarily enforce this to ensure that any embedded case |
| 1262 | // statements are not emitted. |
| 1263 | SwitchInsn = 0; |
| 1264 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1265 | // Okay, we can dead code eliminate everything except this case. Emit the |
| 1266 | // specified series of statements and we're good. |
| 1267 | for (unsigned i = 0, e = CaseStmts.size(); i != e; ++i) |
| 1268 | EmitStmt(CaseStmts[i]); |
Fariborz Jahanian | 985df1c | 2012-01-17 23:39:50 +0000 | [diff] [blame] | 1269 | |
Eric Christopher | fc65ec8 | 2012-04-10 05:04:04 +0000 | [diff] [blame] | 1270 | // Now we want to restore the saved switch instance so that nested |
| 1271 | // switches continue to function properly |
Fariborz Jahanian | 985df1c | 2012-01-17 23:39:50 +0000 | [diff] [blame] | 1272 | SwitchInsn = SavedSwitchInsn; |
| 1273 | |
Chris Lattner | fda0f1f | 2011-02-28 00:22:07 +0000 | [diff] [blame] | 1274 | return; |
| 1275 | } |
| 1276 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1277 | |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1278 | llvm::Value *CondV = EmitScalarExpr(S.getCond()); |
| 1279 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1280 | // Create basic block to hold stuff that comes after switch |
| 1281 | // statement. We also need to create a default block now so that |
| 1282 | // explicit case ranges tests can have a place to jump to on |
| 1283 | // failure. |
Daniel Dunbar | 55e8742 | 2008-11-11 02:29:29 +0000 | [diff] [blame] | 1284 | llvm::BasicBlock *DefaultBlock = createBasicBlock("sw.default"); |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1285 | SwitchInsn = Builder.CreateSwitch(CondV, DefaultBlock); |
| 1286 | CaseRangeBlock = DefaultBlock; |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1287 | |
Daniel Dunbar | 0912425 | 2008-11-12 08:21:33 +0000 | [diff] [blame] | 1288 | // Clear the insertion point to indicate we are in unreachable code. |
| 1289 | Builder.ClearInsertionPoint(); |
Eli Friedman | d28a80d | 2008-05-12 16:08:04 +0000 | [diff] [blame] | 1290 | |
Devang Patel | e9b8c0a | 2007-10-30 20:59:40 +0000 | [diff] [blame] | 1291 | // All break statements jump to NextBlock. If BreakContinueStack is non empty |
| 1292 | // then reuse last ContinueBlock. |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1293 | JumpDest OuterContinue; |
Anders Carlsson | e4b6d34 | 2009-02-10 05:52:02 +0000 | [diff] [blame] | 1294 | if (!BreakContinueStack.empty()) |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1295 | OuterContinue = BreakContinueStack.back().ContinueBlock; |
Anders Carlsson | e4b6d34 | 2009-02-10 05:52:02 +0000 | [diff] [blame] | 1296 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1297 | BreakContinueStack.push_back(BreakContinue(SwitchExit, OuterContinue)); |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1298 | |
| 1299 | // Emit switch body. |
| 1300 | EmitStmt(S.getBody()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1301 | |
Anders Carlsson | e4b6d34 | 2009-02-10 05:52:02 +0000 | [diff] [blame] | 1302 | BreakContinueStack.pop_back(); |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1303 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1304 | // Update the default block in case explicit case range tests have |
| 1305 | // been chained on top. |
Stepan Dyatkovskiy | ab14ae2 | 2012-02-01 07:50:21 +0000 | [diff] [blame] | 1306 | SwitchInsn->setDefaultDest(CaseRangeBlock); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1307 | |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1308 | // If a default was never emitted: |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1309 | if (!DefaultBlock->getParent()) { |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1310 | // If we have cleanups, emit the default block so that there's a |
| 1311 | // place to jump through the cleanups from. |
| 1312 | if (ConditionScope.requiresCleanups()) { |
| 1313 | EmitBlock(DefaultBlock); |
| 1314 | |
| 1315 | // Otherwise, just forward the default block to the switch end. |
| 1316 | } else { |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 1317 | DefaultBlock->replaceAllUsesWith(SwitchExit.getBlock()); |
John McCall | f1549f6 | 2010-07-06 01:34:17 +0000 | [diff] [blame] | 1318 | delete DefaultBlock; |
| 1319 | } |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1320 | } |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1321 | |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 1322 | ConditionScope.ForceCleanup(); |
| 1323 | |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1324 | // Emit continuation. |
John McCall | ff8e115 | 2010-07-23 21:56:41 +0000 | [diff] [blame] | 1325 | EmitBlock(SwitchExit.getBlock(), true); |
Daniel Dunbar | 16f2357 | 2008-07-25 01:11:38 +0000 | [diff] [blame] | 1326 | |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1327 | SwitchInsn = SavedSwitchInsn; |
Devang Patel | c049e4f | 2007-10-08 20:57:48 +0000 | [diff] [blame] | 1328 | CaseRangeBlock = SavedCRBlock; |
Devang Patel | 51b09f2 | 2007-10-04 23:45:31 +0000 | [diff] [blame] | 1329 | } |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1330 | |
Chris Lattner | 2819fa8 | 2009-04-26 17:57:12 +0000 | [diff] [blame] | 1331 | static std::string |
Daniel Dunbar | 444be73 | 2009-11-13 05:51:54 +0000 | [diff] [blame] | 1332 | SimplifyConstraint(const char *Constraint, const TargetInfo &Target, |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1333 | SmallVectorImpl<TargetInfo::ConstraintInfo> *OutCons=0) { |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1334 | std::string Result; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1335 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1336 | while (*Constraint) { |
| 1337 | switch (*Constraint) { |
| 1338 | default: |
Stuart Hastings | 002333f | 2011-06-07 23:45:05 +0000 | [diff] [blame] | 1339 | Result += Target.convertConstraint(Constraint); |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1340 | break; |
| 1341 | // Ignore these |
| 1342 | case '*': |
| 1343 | case '?': |
| 1344 | case '!': |
John Thompson | ef44e11 | 2010-08-10 19:20:14 +0000 | [diff] [blame] | 1345 | case '=': // Will see this and the following in mult-alt constraints. |
| 1346 | case '+': |
| 1347 | break; |
Ulrich Weigand | e6b3dba | 2012-10-29 12:20:54 +0000 | [diff] [blame] | 1348 | case '#': // Ignore the rest of the constraint alternative. |
| 1349 | while (Constraint[1] && Constraint[1] != ',') |
Eric Christopher | 7b309b0 | 2013-07-10 20:14:36 +0000 | [diff] [blame] | 1350 | Constraint++; |
Ulrich Weigand | e6b3dba | 2012-10-29 12:20:54 +0000 | [diff] [blame] | 1351 | break; |
John Thompson | 2f474ea | 2010-09-18 01:15:13 +0000 | [diff] [blame] | 1352 | case ',': |
| 1353 | Result += "|"; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1354 | break; |
| 1355 | case 'g': |
| 1356 | Result += "imr"; |
| 1357 | break; |
Anders Carlsson | 300fb5d | 2009-01-18 02:06:20 +0000 | [diff] [blame] | 1358 | case '[': { |
Chris Lattner | 2819fa8 | 2009-04-26 17:57:12 +0000 | [diff] [blame] | 1359 | assert(OutCons && |
Anders Carlsson | 300fb5d | 2009-01-18 02:06:20 +0000 | [diff] [blame] | 1360 | "Must pass output names to constraints with a symbolic name"); |
| 1361 | unsigned Index; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1362 | bool result = Target.resolveSymbolicName(Constraint, |
Chris Lattner | 2819fa8 | 2009-04-26 17:57:12 +0000 | [diff] [blame] | 1363 | &(*OutCons)[0], |
| 1364 | OutCons->size(), Index); |
Chris Lattner | cbf40f9 | 2011-01-05 18:41:53 +0000 | [diff] [blame] | 1365 | assert(result && "Could not resolve symbolic name"); (void)result; |
Anders Carlsson | 300fb5d | 2009-01-18 02:06:20 +0000 | [diff] [blame] | 1366 | Result += llvm::utostr(Index); |
| 1367 | break; |
| 1368 | } |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1369 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1370 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1371 | Constraint++; |
| 1372 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1373 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1374 | return Result; |
| 1375 | } |
| 1376 | |
Rafael Espindola | 03117d1 | 2011-01-01 21:12:33 +0000 | [diff] [blame] | 1377 | /// AddVariableConstraints - Look at AsmExpr and if it is a variable declared |
| 1378 | /// as using a particular register add that as a constraint that will be used |
| 1379 | /// in this asm stmt. |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1380 | static std::string |
Rafael Espindola | 03117d1 | 2011-01-01 21:12:33 +0000 | [diff] [blame] | 1381 | AddVariableConstraints(const std::string &Constraint, const Expr &AsmExpr, |
| 1382 | const TargetInfo &Target, CodeGenModule &CGM, |
Chad Rosier | a23b91d | 2012-08-28 18:54:39 +0000 | [diff] [blame] | 1383 | const AsmStmt &Stmt) { |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1384 | const DeclRefExpr *AsmDeclRef = dyn_cast<DeclRefExpr>(&AsmExpr); |
| 1385 | if (!AsmDeclRef) |
| 1386 | return Constraint; |
| 1387 | const ValueDecl &Value = *AsmDeclRef->getDecl(); |
| 1388 | const VarDecl *Variable = dyn_cast<VarDecl>(&Value); |
| 1389 | if (!Variable) |
| 1390 | return Constraint; |
Eli Friedman | a43ef3e | 2012-03-15 23:12:51 +0000 | [diff] [blame] | 1391 | if (Variable->getStorageClass() != SC_Register) |
| 1392 | return Constraint; |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1393 | AsmLabelAttr *Attr = Variable->getAttr<AsmLabelAttr>(); |
| 1394 | if (!Attr) |
| 1395 | return Constraint; |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1396 | StringRef Register = Attr->getLabel(); |
Rafael Espindola | baf8695 | 2011-01-01 21:47:03 +0000 | [diff] [blame] | 1397 | assert(Target.isValidGCCRegisterName(Register)); |
Eric Christopher | e3e07a5 | 2011-06-17 01:53:34 +0000 | [diff] [blame] | 1398 | // We're using validateOutputConstraint here because we only care if |
| 1399 | // this is a register constraint. |
| 1400 | TargetInfo::ConstraintInfo Info(Constraint, ""); |
| 1401 | if (Target.validateOutputConstraint(Info) && |
| 1402 | !Info.allowsRegister()) { |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1403 | CGM.ErrorUnsupported(&Stmt, "__asm__"); |
| 1404 | return Constraint; |
| 1405 | } |
Eric Christopher | 43fec87 | 2011-06-21 00:07:10 +0000 | [diff] [blame] | 1406 | // Canonicalize the register here before returning it. |
| 1407 | Register = Target.getNormalizedGCCRegisterName(Register); |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1408 | return "{" + Register.str() + "}"; |
| 1409 | } |
| 1410 | |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1411 | llvm::Value* |
Chad Rosier | 42b6055 | 2012-08-23 20:00:18 +0000 | [diff] [blame] | 1412 | CodeGenFunction::EmitAsmInputLValue(const TargetInfo::ConstraintInfo &Info, |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1413 | LValue InputValue, QualType InputType, |
| 1414 | std::string &ConstraintStr) { |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1415 | llvm::Value *Arg; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1416 | if (Info.allowsRegister() || !Info.allowsMemory()) { |
John McCall | 9d232c8 | 2013-03-07 21:37:08 +0000 | [diff] [blame] | 1417 | if (CodeGenFunction::hasScalarEvaluationKind(InputType)) { |
John McCall | 545d996 | 2011-06-25 02:11:03 +0000 | [diff] [blame] | 1418 | Arg = EmitLoadOfLValue(InputValue).getScalarVal(); |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1419 | } else { |
Chris Lattner | 2acc6e3 | 2011-07-18 04:24:23 +0000 | [diff] [blame] | 1420 | llvm::Type *Ty = ConvertType(InputType); |
Micah Villmow | 25a6a84 | 2012-10-08 16:25:52 +0000 | [diff] [blame] | 1421 | uint64_t Size = CGM.getDataLayout().getTypeSizeInBits(Ty); |
Anders Carlsson | ebaae2a | 2009-01-12 02:22:13 +0000 | [diff] [blame] | 1422 | if (Size <= 64 && llvm::isPowerOf2_64(Size)) { |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 1423 | Ty = llvm::IntegerType::get(getLLVMContext(), Size); |
Anders Carlsson | ebaae2a | 2009-01-12 02:22:13 +0000 | [diff] [blame] | 1424 | Ty = llvm::PointerType::getUnqual(Ty); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1425 | |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1426 | Arg = Builder.CreateLoad(Builder.CreateBitCast(InputValue.getAddress(), |
| 1427 | Ty)); |
Anders Carlsson | ebaae2a | 2009-01-12 02:22:13 +0000 | [diff] [blame] | 1428 | } else { |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1429 | Arg = InputValue.getAddress(); |
Anders Carlsson | ebaae2a | 2009-01-12 02:22:13 +0000 | [diff] [blame] | 1430 | ConstraintStr += '*'; |
| 1431 | } |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1432 | } |
| 1433 | } else { |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1434 | Arg = InputValue.getAddress(); |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1435 | ConstraintStr += '*'; |
| 1436 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1437 | |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1438 | return Arg; |
| 1439 | } |
| 1440 | |
Chad Rosier | 42b6055 | 2012-08-23 20:00:18 +0000 | [diff] [blame] | 1441 | llvm::Value* CodeGenFunction::EmitAsmInput( |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1442 | const TargetInfo::ConstraintInfo &Info, |
| 1443 | const Expr *InputExpr, |
| 1444 | std::string &ConstraintStr) { |
| 1445 | if (Info.allowsRegister() || !Info.allowsMemory()) |
John McCall | 9d232c8 | 2013-03-07 21:37:08 +0000 | [diff] [blame] | 1446 | if (CodeGenFunction::hasScalarEvaluationKind(InputExpr->getType())) |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1447 | return EmitScalarExpr(InputExpr); |
| 1448 | |
| 1449 | InputExpr = InputExpr->IgnoreParenNoopCasts(getContext()); |
| 1450 | LValue Dest = EmitLValue(InputExpr); |
Chad Rosier | 42b6055 | 2012-08-23 20:00:18 +0000 | [diff] [blame] | 1451 | return EmitAsmInputLValue(Info, Dest, InputExpr->getType(), ConstraintStr); |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1452 | } |
| 1453 | |
Chris Lattner | 47fc7e9 | 2010-11-17 05:58:54 +0000 | [diff] [blame] | 1454 | /// getAsmSrcLocInfo - Return the !srcloc metadata node to attach to an inline |
Chris Lattner | 5d93653 | 2010-11-17 08:25:26 +0000 | [diff] [blame] | 1455 | /// asm call instruction. The !srcloc MDNode contains a list of constant |
| 1456 | /// integers which are the source locations of the start of each line in the |
| 1457 | /// asm. |
Chris Lattner | 47fc7e9 | 2010-11-17 05:58:54 +0000 | [diff] [blame] | 1458 | static llvm::MDNode *getAsmSrcLocInfo(const StringLiteral *Str, |
| 1459 | CodeGenFunction &CGF) { |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1460 | SmallVector<llvm::Value *, 8> Locs; |
Chris Lattner | 5d93653 | 2010-11-17 08:25:26 +0000 | [diff] [blame] | 1461 | // Add the location of the first line to the MDNode. |
| 1462 | Locs.push_back(llvm::ConstantInt::get(CGF.Int32Ty, |
| 1463 | Str->getLocStart().getRawEncoding())); |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1464 | StringRef StrVal = Str->getString(); |
Chris Lattner | 5d93653 | 2010-11-17 08:25:26 +0000 | [diff] [blame] | 1465 | if (!StrVal.empty()) { |
| 1466 | const SourceManager &SM = CGF.CGM.getContext().getSourceManager(); |
David Blaikie | 4e4d084 | 2012-03-11 07:00:24 +0000 | [diff] [blame] | 1467 | const LangOptions &LangOpts = CGF.CGM.getLangOpts(); |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1468 | |
Chris Lattner | 5d93653 | 2010-11-17 08:25:26 +0000 | [diff] [blame] | 1469 | // Add the location of the start of each subsequent line of the asm to the |
| 1470 | // MDNode. |
| 1471 | for (unsigned i = 0, e = StrVal.size()-1; i != e; ++i) { |
| 1472 | if (StrVal[i] != '\n') continue; |
| 1473 | SourceLocation LineLoc = Str->getLocationOfByte(i+1, SM, LangOpts, |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1474 | CGF.getTarget()); |
Chris Lattner | 5d93653 | 2010-11-17 08:25:26 +0000 | [diff] [blame] | 1475 | Locs.push_back(llvm::ConstantInt::get(CGF.Int32Ty, |
| 1476 | LineLoc.getRawEncoding())); |
| 1477 | } |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1478 | } |
| 1479 | |
Jay Foad | 6f14165 | 2011-04-21 19:59:12 +0000 | [diff] [blame] | 1480 | return llvm::MDNode::get(CGF.getLLVMContext(), Locs); |
Chris Lattner | 47fc7e9 | 2010-11-17 05:58:54 +0000 | [diff] [blame] | 1481 | } |
| 1482 | |
Chad Rosier | a23b91d | 2012-08-28 18:54:39 +0000 | [diff] [blame] | 1483 | void CodeGenFunction::EmitAsmStmt(const AsmStmt &S) { |
Chad Rosier | be3ace8 | 2012-08-24 17:05:45 +0000 | [diff] [blame] | 1484 | // Assemble the final asm string. |
Chad Rosier | da083b2 | 2012-08-27 20:23:31 +0000 | [diff] [blame] | 1485 | std::string AsmString = S.generateAsmString(getContext()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1486 | |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1487 | // Get all the output and input constraints together. |
Chris Lattner | 5f9e272 | 2011-07-23 10:55:15 +0000 | [diff] [blame] | 1488 | SmallVector<TargetInfo::ConstraintInfo, 4> OutputConstraintInfos; |
| 1489 | SmallVector<TargetInfo::ConstraintInfo, 4> InputConstraintInfos; |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1490 | |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1491 | for (unsigned i = 0, e = S.getNumOutputs(); i != e; i++) { |
John McCall | aeeacf7 | 2013-05-03 00:10:13 +0000 | [diff] [blame] | 1492 | StringRef Name; |
| 1493 | if (const GCCAsmStmt *GAS = dyn_cast<GCCAsmStmt>(&S)) |
| 1494 | Name = GAS->getOutputName(i); |
| 1495 | TargetInfo::ConstraintInfo Info(S.getOutputConstraint(i), Name); |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1496 | bool IsValid = getTarget().validateOutputConstraint(Info); (void)IsValid; |
Chris Lattner | b992259 | 2010-03-03 21:52:23 +0000 | [diff] [blame] | 1497 | assert(IsValid && "Failed to parse output constraint"); |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1498 | OutputConstraintInfos.push_back(Info); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1499 | } |
| 1500 | |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1501 | for (unsigned i = 0, e = S.getNumInputs(); i != e; i++) { |
John McCall | aeeacf7 | 2013-05-03 00:10:13 +0000 | [diff] [blame] | 1502 | StringRef Name; |
| 1503 | if (const GCCAsmStmt *GAS = dyn_cast<GCCAsmStmt>(&S)) |
| 1504 | Name = GAS->getInputName(i); |
| 1505 | TargetInfo::ConstraintInfo Info(S.getInputConstraint(i), Name); |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1506 | bool IsValid = |
| 1507 | getTarget().validateInputConstraint(OutputConstraintInfos.data(), |
| 1508 | S.getNumOutputs(), Info); |
Chris Lattner | b992259 | 2010-03-03 21:52:23 +0000 | [diff] [blame] | 1509 | assert(IsValid && "Failed to parse input constraint"); (void)IsValid; |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1510 | InputConstraintInfos.push_back(Info); |
| 1511 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1512 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1513 | std::string Constraints; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1514 | |
Chris Lattner | ede9d90 | 2009-05-03 07:53:25 +0000 | [diff] [blame] | 1515 | std::vector<LValue> ResultRegDests; |
| 1516 | std::vector<QualType> ResultRegQualTys; |
Jay Foad | ef6de3d | 2011-07-11 09:56:20 +0000 | [diff] [blame] | 1517 | std::vector<llvm::Type *> ResultRegTypes; |
| 1518 | std::vector<llvm::Type *> ResultTruncRegTypes; |
Chad Rosier | d1c0c94 | 2012-05-01 19:53:37 +0000 | [diff] [blame] | 1519 | std::vector<llvm::Type *> ArgTypes; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1520 | std::vector<llvm::Value*> Args; |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1521 | |
| 1522 | // Keep track of inout constraints. |
| 1523 | std::string InOutConstraints; |
| 1524 | std::vector<llvm::Value*> InOutArgs; |
Chris Lattner | 9cbe4f0 | 2011-07-09 17:41:47 +0000 | [diff] [blame] | 1525 | std::vector<llvm::Type*> InOutArgTypes; |
Anders Carlsson | 03eb543 | 2009-01-27 20:38:24 +0000 | [diff] [blame] | 1526 | |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1527 | for (unsigned i = 0, e = S.getNumOutputs(); i != e; i++) { |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1528 | TargetInfo::ConstraintInfo &Info = OutputConstraintInfos[i]; |
Anders Carlsson | 03eb543 | 2009-01-27 20:38:24 +0000 | [diff] [blame] | 1529 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1530 | // Simplify the output constraint. |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1531 | std::string OutputConstraint(S.getOutputConstraint(i)); |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1532 | OutputConstraint = SimplifyConstraint(OutputConstraint.c_str() + 1, |
| 1533 | getTarget()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1534 | |
Chris Lattner | 810f6d5 | 2009-03-13 17:38:01 +0000 | [diff] [blame] | 1535 | const Expr *OutExpr = S.getOutputExpr(i); |
| 1536 | OutExpr = OutExpr->IgnoreParenNoopCasts(getContext()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1537 | |
Eric Christopher | a18f539 | 2011-06-03 14:52:25 +0000 | [diff] [blame] | 1538 | OutputConstraint = AddVariableConstraints(OutputConstraint, *OutExpr, |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1539 | getTarget(), CGM, S); |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1540 | |
Chris Lattner | 810f6d5 | 2009-03-13 17:38:01 +0000 | [diff] [blame] | 1541 | LValue Dest = EmitLValue(OutExpr); |
Chris Lattner | ede9d90 | 2009-05-03 07:53:25 +0000 | [diff] [blame] | 1542 | if (!Constraints.empty()) |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1543 | Constraints += ','; |
| 1544 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1545 | // If this is a register output, then make the inline asm return it |
| 1546 | // by-value. If this is a memory result, return the value by-reference. |
John McCall | 9d232c8 | 2013-03-07 21:37:08 +0000 | [diff] [blame] | 1547 | if (!Info.allowsMemory() && hasScalarEvaluationKind(OutExpr->getType())) { |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1548 | Constraints += "=" + OutputConstraint; |
Chris Lattner | ede9d90 | 2009-05-03 07:53:25 +0000 | [diff] [blame] | 1549 | ResultRegQualTys.push_back(OutExpr->getType()); |
| 1550 | ResultRegDests.push_back(Dest); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1551 | ResultRegTypes.push_back(ConvertTypeForMem(OutExpr->getType())); |
| 1552 | ResultTruncRegTypes.push_back(ResultRegTypes.back()); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1553 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1554 | // If this output is tied to an input, and if the input is larger, then |
| 1555 | // we need to set the actual result type of the inline asm node to be the |
| 1556 | // same as the input type. |
| 1557 | if (Info.hasMatchingInput()) { |
Chris Lattner | ebfc985 | 2009-05-03 08:38:58 +0000 | [diff] [blame] | 1558 | unsigned InputNo; |
| 1559 | for (InputNo = 0; InputNo != S.getNumInputs(); ++InputNo) { |
| 1560 | TargetInfo::ConstraintInfo &Input = InputConstraintInfos[InputNo]; |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1561 | if (Input.hasTiedOperand() && Input.getTiedOperand() == i) |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1562 | break; |
Chris Lattner | ebfc985 | 2009-05-03 08:38:58 +0000 | [diff] [blame] | 1563 | } |
| 1564 | assert(InputNo != S.getNumInputs() && "Didn't find matching input!"); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1565 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1566 | QualType InputTy = S.getInputExpr(InputNo)->getType(); |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1567 | QualType OutputType = OutExpr->getType(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1568 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1569 | uint64_t InputSize = getContext().getTypeSize(InputTy); |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1570 | if (getContext().getTypeSize(OutputType) < InputSize) { |
| 1571 | // Form the asm to return the value as a larger integer or fp type. |
| 1572 | ResultRegTypes.back() = ConvertType(InputTy); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1573 | } |
| 1574 | } |
Tim Northover | 1bea653 | 2013-06-07 00:04:50 +0000 | [diff] [blame] | 1575 | if (llvm::Type* AdjTy = |
Peter Collingbourne | 4b93d66 | 2011-02-19 23:03:58 +0000 | [diff] [blame] | 1576 | getTargetHooks().adjustInlineAsmType(*this, OutputConstraint, |
| 1577 | ResultRegTypes.back())) |
Dale Johannesen | f6e2c20 | 2010-10-29 23:12:32 +0000 | [diff] [blame] | 1578 | ResultRegTypes.back() = AdjTy; |
Tim Northover | 1bea653 | 2013-06-07 00:04:50 +0000 | [diff] [blame] | 1579 | else { |
| 1580 | CGM.getDiags().Report(S.getAsmLoc(), |
| 1581 | diag::err_asm_invalid_type_in_input) |
| 1582 | << OutExpr->getType() << OutputConstraint; |
| 1583 | } |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1584 | } else { |
| 1585 | ArgTypes.push_back(Dest.getAddress()->getType()); |
Anders Carlsson | cad3ab6 | 2008-02-05 16:57:38 +0000 | [diff] [blame] | 1586 | Args.push_back(Dest.getAddress()); |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1587 | Constraints += "=*"; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1588 | Constraints += OutputConstraint; |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1589 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1590 | |
Chris Lattner | 44def07 | 2009-04-26 07:16:29 +0000 | [diff] [blame] | 1591 | if (Info.isReadWrite()) { |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1592 | InOutConstraints += ','; |
Anders Carlsson | 6347172 | 2009-01-11 19:32:54 +0000 | [diff] [blame] | 1593 | |
Anders Carlsson | fca9361 | 2009-08-04 18:18:36 +0000 | [diff] [blame] | 1594 | const Expr *InputExpr = S.getOutputExpr(i); |
Chad Rosier | 42b6055 | 2012-08-23 20:00:18 +0000 | [diff] [blame] | 1595 | llvm::Value *Arg = EmitAsmInputLValue(Info, Dest, InputExpr->getType(), |
Eli Friedman | 6d7cfd7 | 2010-07-16 00:55:21 +0000 | [diff] [blame] | 1596 | InOutConstraints); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1597 | |
Bill Wendling | acb5310 | 2012-03-22 23:25:07 +0000 | [diff] [blame] | 1598 | if (llvm::Type* AdjTy = |
Tim Northover | 1bea653 | 2013-06-07 00:04:50 +0000 | [diff] [blame] | 1599 | getTargetHooks().adjustInlineAsmType(*this, OutputConstraint, |
| 1600 | Arg->getType())) |
Bill Wendling | acb5310 | 2012-03-22 23:25:07 +0000 | [diff] [blame] | 1601 | Arg = Builder.CreateBitCast(Arg, AdjTy); |
| 1602 | |
Chris Lattner | 44def07 | 2009-04-26 07:16:29 +0000 | [diff] [blame] | 1603 | if (Info.allowsRegister()) |
Anders Carlsson | 9f2505b | 2009-01-11 21:23:27 +0000 | [diff] [blame] | 1604 | InOutConstraints += llvm::utostr(i); |
| 1605 | else |
| 1606 | InOutConstraints += OutputConstraint; |
Anders Carlsson | 2763b3a | 2009-01-11 19:46:50 +0000 | [diff] [blame] | 1607 | |
Anders Carlsson | fca9361 | 2009-08-04 18:18:36 +0000 | [diff] [blame] | 1608 | InOutArgTypes.push_back(Arg->getType()); |
| 1609 | InOutArgs.push_back(Arg); |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1610 | } |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1611 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1612 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1613 | unsigned NumConstraints = S.getNumOutputs() + S.getNumInputs(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1614 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1615 | for (unsigned i = 0, e = S.getNumInputs(); i != e; i++) { |
| 1616 | const Expr *InputExpr = S.getInputExpr(i); |
| 1617 | |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1618 | TargetInfo::ConstraintInfo &Info = InputConstraintInfos[i]; |
| 1619 | |
Chris Lattner | ede9d90 | 2009-05-03 07:53:25 +0000 | [diff] [blame] | 1620 | if (!Constraints.empty()) |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1621 | Constraints += ','; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1622 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1623 | // Simplify the input constraint. |
Chris Lattner | 481fef9 | 2009-05-03 07:05:00 +0000 | [diff] [blame] | 1624 | std::string InputConstraint(S.getInputConstraint(i)); |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1625 | InputConstraint = SimplifyConstraint(InputConstraint.c_str(), getTarget(), |
Chris Lattner | 2819fa8 | 2009-04-26 17:57:12 +0000 | [diff] [blame] | 1626 | &OutputConstraintInfos); |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1627 | |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1628 | InputConstraint = |
Rafael Espindola | 03117d1 | 2011-01-01 21:12:33 +0000 | [diff] [blame] | 1629 | AddVariableConstraints(InputConstraint, |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1630 | *InputExpr->IgnoreParenNoopCasts(getContext()), |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1631 | getTarget(), CGM, S); |
Rafael Espindola | 0ec89f9 | 2010-12-30 22:59:32 +0000 | [diff] [blame] | 1632 | |
Chad Rosier | 42b6055 | 2012-08-23 20:00:18 +0000 | [diff] [blame] | 1633 | llvm::Value *Arg = EmitAsmInput(Info, InputExpr, Constraints); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1634 | |
Chris Lattner | 4df4ee0 | 2009-05-03 07:27:51 +0000 | [diff] [blame] | 1635 | // If this input argument is tied to a larger output result, extend the |
| 1636 | // input to be the same size as the output. The LLVM backend wants to see |
| 1637 | // the input and output of a matching constraint be the same size. Note |
| 1638 | // that GCC does not define what the top bits are here. We use zext because |
| 1639 | // that is usually cheaper, but LLVM IR should really get an anyext someday. |
| 1640 | if (Info.hasTiedOperand()) { |
| 1641 | unsigned Output = Info.getTiedOperand(); |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1642 | QualType OutputType = S.getOutputExpr(Output)->getType(); |
Chris Lattner | 4df4ee0 | 2009-05-03 07:27:51 +0000 | [diff] [blame] | 1643 | QualType InputTy = InputExpr->getType(); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1644 | |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1645 | if (getContext().getTypeSize(OutputType) > |
Chris Lattner | 4df4ee0 | 2009-05-03 07:27:51 +0000 | [diff] [blame] | 1646 | getContext().getTypeSize(InputTy)) { |
| 1647 | // Use ptrtoint as appropriate so that we can do our extension. |
| 1648 | if (isa<llvm::PointerType>(Arg->getType())) |
Chris Lattner | 77b89b8 | 2010-06-27 07:15:29 +0000 | [diff] [blame] | 1649 | Arg = Builder.CreatePtrToInt(Arg, IntPtrTy); |
Chris Lattner | 2acc6e3 | 2011-07-18 04:24:23 +0000 | [diff] [blame] | 1650 | llvm::Type *OutputTy = ConvertType(OutputType); |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1651 | if (isa<llvm::IntegerType>(OutputTy)) |
| 1652 | Arg = Builder.CreateZExt(Arg, OutputTy); |
Peter Collingbourne | 93f1322 | 2011-07-29 00:24:50 +0000 | [diff] [blame] | 1653 | else if (isa<llvm::PointerType>(OutputTy)) |
| 1654 | Arg = Builder.CreateZExt(Arg, IntPtrTy); |
| 1655 | else { |
| 1656 | assert(OutputTy->isFloatingPointTy() && "Unexpected output type"); |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1657 | Arg = Builder.CreateFPExt(Arg, OutputTy); |
Peter Collingbourne | 93f1322 | 2011-07-29 00:24:50 +0000 | [diff] [blame] | 1658 | } |
Chris Lattner | 4df4ee0 | 2009-05-03 07:27:51 +0000 | [diff] [blame] | 1659 | } |
| 1660 | } |
Bill Wendling | acb5310 | 2012-03-22 23:25:07 +0000 | [diff] [blame] | 1661 | if (llvm::Type* AdjTy = |
Peter Collingbourne | 4b93d66 | 2011-02-19 23:03:58 +0000 | [diff] [blame] | 1662 | getTargetHooks().adjustInlineAsmType(*this, InputConstraint, |
| 1663 | Arg->getType())) |
Dale Johannesen | f6e2c20 | 2010-10-29 23:12:32 +0000 | [diff] [blame] | 1664 | Arg = Builder.CreateBitCast(Arg, AdjTy); |
Tim Northover | 1bea653 | 2013-06-07 00:04:50 +0000 | [diff] [blame] | 1665 | else |
| 1666 | CGM.getDiags().Report(S.getAsmLoc(), diag::err_asm_invalid_type_in_input) |
| 1667 | << InputExpr->getType() << InputConstraint; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1668 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1669 | ArgTypes.push_back(Arg->getType()); |
| 1670 | Args.push_back(Arg); |
| 1671 | Constraints += InputConstraint; |
| 1672 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1673 | |
Anders Carlsson | f39a421 | 2008-02-05 20:01:53 +0000 | [diff] [blame] | 1674 | // Append the "input" part of inout constraints last. |
| 1675 | for (unsigned i = 0, e = InOutArgs.size(); i != e; i++) { |
| 1676 | ArgTypes.push_back(InOutArgTypes[i]); |
| 1677 | Args.push_back(InOutArgs[i]); |
| 1678 | } |
| 1679 | Constraints += InOutConstraints; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1680 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1681 | // Clobbers |
| 1682 | for (unsigned i = 0, e = S.getNumClobbers(); i != e; i++) { |
Chad Rosier | 33f0558 | 2012-08-27 23:47:56 +0000 | [diff] [blame] | 1683 | StringRef Clobber = S.getClobber(i); |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1684 | |
Eric Christopher | de31fd7 | 2011-06-28 18:20:53 +0000 | [diff] [blame] | 1685 | if (Clobber != "memory" && Clobber != "cc") |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1686 | Clobber = getTarget().getNormalizedGCCRegisterName(Clobber); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1687 | |
Anders Carlsson | ea04175 | 2008-02-06 00:11:32 +0000 | [diff] [blame] | 1688 | if (i != 0 || NumConstraints != 0) |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1689 | Constraints += ','; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1690 | |
Anders Carlsson | ea04175 | 2008-02-06 00:11:32 +0000 | [diff] [blame] | 1691 | Constraints += "~{"; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1692 | Constraints += Clobber; |
Anders Carlsson | ea04175 | 2008-02-06 00:11:32 +0000 | [diff] [blame] | 1693 | Constraints += '}'; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1694 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1695 | |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1696 | // Add machine specific clobbers |
John McCall | 64aa4b3 | 2013-04-16 22:48:15 +0000 | [diff] [blame] | 1697 | std::string MachineClobbers = getTarget().getClobbers(); |
Eli Friedman | ccf614c | 2008-12-21 01:15:32 +0000 | [diff] [blame] | 1698 | if (!MachineClobbers.empty()) { |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1699 | if (!Constraints.empty()) |
| 1700 | Constraints += ','; |
Eli Friedman | ccf614c | 2008-12-21 01:15:32 +0000 | [diff] [blame] | 1701 | Constraints += MachineClobbers; |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1702 | } |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1703 | |
Chris Lattner | 2acc6e3 | 2011-07-18 04:24:23 +0000 | [diff] [blame] | 1704 | llvm::Type *ResultType; |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1705 | if (ResultRegTypes.empty()) |
Chris Lattner | 8b41868 | 2012-02-07 00:39:47 +0000 | [diff] [blame] | 1706 | ResultType = VoidTy; |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1707 | else if (ResultRegTypes.size() == 1) |
| 1708 | ResultType = ResultRegTypes[0]; |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1709 | else |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 1710 | ResultType = llvm::StructType::get(getLLVMContext(), ResultRegTypes); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1711 | |
Chris Lattner | 2acc6e3 | 2011-07-18 04:24:23 +0000 | [diff] [blame] | 1712 | llvm::FunctionType *FTy = |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1713 | llvm::FunctionType::get(ResultType, ArgTypes, false); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1714 | |
Chad Rosier | 2ab7d43 | 2012-09-04 19:50:17 +0000 | [diff] [blame] | 1715 | bool HasSideEffect = S.isVolatile() || S.getNumOutputs() == 0; |
Chad Rosier | fcf75a3 | 2012-09-05 19:01:07 +0000 | [diff] [blame] | 1716 | llvm::InlineAsm::AsmDialect AsmDialect = isa<MSAsmStmt>(&S) ? |
| 1717 | llvm::InlineAsm::AD_Intel : llvm::InlineAsm::AD_ATT; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1718 | llvm::InlineAsm *IA = |
Chad Rosier | 790cbd8 | 2012-09-04 23:08:24 +0000 | [diff] [blame] | 1719 | llvm::InlineAsm::get(FTy, AsmString, Constraints, HasSideEffect, |
Chad Rosier | fcf75a3 | 2012-09-05 19:01:07 +0000 | [diff] [blame] | 1720 | /* IsAlignStack */ false, AsmDialect); |
Jay Foad | 4c7d9f1 | 2011-07-15 08:37:34 +0000 | [diff] [blame] | 1721 | llvm::CallInst *Result = Builder.CreateCall(IA, Args); |
Bill Wendling | 785b778 | 2012-12-07 23:17:26 +0000 | [diff] [blame] | 1722 | Result->addAttribute(llvm::AttributeSet::FunctionIndex, |
Peter Collingbourne | 15e05e9 | 2013-03-02 01:20:22 +0000 | [diff] [blame] | 1723 | llvm::Attribute::NoUnwind); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1724 | |
Chris Lattner | fc1a9c3 | 2010-04-07 05:46:54 +0000 | [diff] [blame] | 1725 | // Slap the source location of the inline asm into a !srcloc metadata on the |
Chad Rosier | a23b91d | 2012-08-28 18:54:39 +0000 | [diff] [blame] | 1726 | // call. FIXME: Handle metadata for MS-style inline asms. |
| 1727 | if (const GCCAsmStmt *gccAsmStmt = dyn_cast<GCCAsmStmt>(&S)) |
| 1728 | Result->setMetadata("srcloc", getAsmSrcLocInfo(gccAsmStmt->getAsmString(), |
| 1729 | *this)); |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1730 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1731 | // Extract all of the register value results from the asm. |
| 1732 | std::vector<llvm::Value*> RegResults; |
| 1733 | if (ResultRegTypes.size() == 1) { |
| 1734 | RegResults.push_back(Result); |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1735 | } else { |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1736 | for (unsigned i = 0, e = ResultRegTypes.size(); i != e; ++i) { |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1737 | llvm::Value *Tmp = Builder.CreateExtractValue(Result, i, "asmresult"); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1738 | RegResults.push_back(Tmp); |
Anders Carlsson | bad3a94 | 2009-05-01 00:16:04 +0000 | [diff] [blame] | 1739 | } |
| 1740 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1741 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1742 | for (unsigned i = 0, e = RegResults.size(); i != e; ++i) { |
| 1743 | llvm::Value *Tmp = RegResults[i]; |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1744 | |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1745 | // If the result type of the LLVM IR asm doesn't match the result type of |
| 1746 | // the expression, do the conversion. |
| 1747 | if (ResultRegTypes[i] != ResultTruncRegTypes[i]) { |
Chris Lattner | 2acc6e3 | 2011-07-18 04:24:23 +0000 | [diff] [blame] | 1748 | llvm::Type *TruncTy = ResultTruncRegTypes[i]; |
Chad Rosier | 6f61ba2 | 2012-06-20 17:43:05 +0000 | [diff] [blame] | 1749 | |
Chris Lattner | aab64d0 | 2010-04-23 17:27:29 +0000 | [diff] [blame] | 1750 | // Truncate the integer result to the right size, note that TruncTy can be |
| 1751 | // a pointer. |
| 1752 | if (TruncTy->isFloatingPointTy()) |
| 1753 | Tmp = Builder.CreateFPTrunc(Tmp, TruncTy); |
Dan Gohman | 2dca88f | 2010-04-24 04:55:02 +0000 | [diff] [blame] | 1754 | else if (TruncTy->isPointerTy() && Tmp->getType()->isIntegerTy()) { |
Micah Villmow | 25a6a84 | 2012-10-08 16:25:52 +0000 | [diff] [blame] | 1755 | uint64_t ResSize = CGM.getDataLayout().getTypeSizeInBits(TruncTy); |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 1756 | Tmp = Builder.CreateTrunc(Tmp, |
| 1757 | llvm::IntegerType::get(getLLVMContext(), (unsigned)ResSize)); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1758 | Tmp = Builder.CreateIntToPtr(Tmp, TruncTy); |
Dan Gohman | 2dca88f | 2010-04-24 04:55:02 +0000 | [diff] [blame] | 1759 | } else if (Tmp->getType()->isPointerTy() && TruncTy->isIntegerTy()) { |
Micah Villmow | 25a6a84 | 2012-10-08 16:25:52 +0000 | [diff] [blame] | 1760 | uint64_t TmpSize =CGM.getDataLayout().getTypeSizeInBits(Tmp->getType()); |
John McCall | d16c2cf | 2011-02-08 08:22:06 +0000 | [diff] [blame] | 1761 | Tmp = Builder.CreatePtrToInt(Tmp, |
| 1762 | llvm::IntegerType::get(getLLVMContext(), (unsigned)TmpSize)); |
Dan Gohman | 2dca88f | 2010-04-24 04:55:02 +0000 | [diff] [blame] | 1763 | Tmp = Builder.CreateTrunc(Tmp, TruncTy); |
| 1764 | } else if (TruncTy->isIntegerTy()) { |
| 1765 | Tmp = Builder.CreateTrunc(Tmp, TruncTy); |
Dale Johannesen | f6e2c20 | 2010-10-29 23:12:32 +0000 | [diff] [blame] | 1766 | } else if (TruncTy->isVectorTy()) { |
| 1767 | Tmp = Builder.CreateBitCast(Tmp, TruncTy); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1768 | } |
| 1769 | } |
Mike Stump | 1eb4433 | 2009-09-09 15:08:12 +0000 | [diff] [blame] | 1770 | |
John McCall | 545d996 | 2011-06-25 02:11:03 +0000 | [diff] [blame] | 1771 | EmitStoreThroughLValue(RValue::get(Tmp), ResultRegDests[i]); |
Chris Lattner | a077b5c | 2009-05-03 08:21:20 +0000 | [diff] [blame] | 1772 | } |
Anders Carlsson | fb1aeb8 | 2008-02-05 16:35:33 +0000 | [diff] [blame] | 1773 | } |
Tareq A. Siraj | 051303c | 2013-04-16 18:53:08 +0000 | [diff] [blame] | 1774 | |
Ben Langmuir | 524387a | 2013-05-09 19:17:11 +0000 | [diff] [blame] | 1775 | static LValue InitCapturedStruct(CodeGenFunction &CGF, const CapturedStmt &S) { |
| 1776 | const RecordDecl *RD = S.getCapturedRecordDecl(); |
| 1777 | QualType RecordTy = CGF.getContext().getRecordType(RD); |
| 1778 | |
| 1779 | // Initialize the captured struct. |
| 1780 | LValue SlotLV = CGF.MakeNaturalAlignAddrLValue( |
| 1781 | CGF.CreateMemTemp(RecordTy, "agg.captured"), RecordTy); |
| 1782 | |
| 1783 | RecordDecl::field_iterator CurField = RD->field_begin(); |
| 1784 | for (CapturedStmt::capture_init_iterator I = S.capture_init_begin(), |
| 1785 | E = S.capture_init_end(); |
| 1786 | I != E; ++I, ++CurField) { |
| 1787 | LValue LV = CGF.EmitLValueForFieldInitialization(SlotLV, *CurField); |
| 1788 | CGF.EmitInitializerForField(*CurField, LV, *I, ArrayRef<VarDecl *>()); |
| 1789 | } |
| 1790 | |
| 1791 | return SlotLV; |
| 1792 | } |
| 1793 | |
| 1794 | /// Generate an outlined function for the body of a CapturedStmt, store any |
| 1795 | /// captured variables into the captured struct, and call the outlined function. |
| 1796 | llvm::Function * |
| 1797 | CodeGenFunction::EmitCapturedStmt(const CapturedStmt &S, CapturedRegionKind K) { |
| 1798 | const CapturedDecl *CD = S.getCapturedDecl(); |
| 1799 | const RecordDecl *RD = S.getCapturedRecordDecl(); |
| 1800 | assert(CD->hasBody() && "missing CapturedDecl body"); |
| 1801 | |
| 1802 | LValue CapStruct = InitCapturedStruct(*this, S); |
| 1803 | |
| 1804 | // Emit the CapturedDecl |
| 1805 | CodeGenFunction CGF(CGM, true); |
| 1806 | CGF.CapturedStmtInfo = new CGCapturedStmtInfo(S, K); |
| 1807 | llvm::Function *F = CGF.GenerateCapturedStmtFunction(CD, RD); |
| 1808 | delete CGF.CapturedStmtInfo; |
| 1809 | |
| 1810 | // Emit call to the helper function. |
| 1811 | EmitCallOrInvoke(F, CapStruct.getAddress()); |
| 1812 | |
| 1813 | return F; |
| 1814 | } |
| 1815 | |
| 1816 | /// Creates the outlined function for a CapturedStmt. |
| 1817 | llvm::Function * |
| 1818 | CodeGenFunction::GenerateCapturedStmtFunction(const CapturedDecl *CD, |
| 1819 | const RecordDecl *RD) { |
| 1820 | assert(CapturedStmtInfo && |
| 1821 | "CapturedStmtInfo should be set when generating the captured function"); |
| 1822 | |
Ben Langmuir | 524387a | 2013-05-09 19:17:11 +0000 | [diff] [blame] | 1823 | // Build the argument list. |
| 1824 | ASTContext &Ctx = CGM.getContext(); |
| 1825 | FunctionArgList Args; |
| 1826 | Args.append(CD->param_begin(), CD->param_end()); |
| 1827 | |
| 1828 | // Create the function declaration. |
| 1829 | FunctionType::ExtInfo ExtInfo; |
| 1830 | const CGFunctionInfo &FuncInfo = |
| 1831 | CGM.getTypes().arrangeFunctionDeclaration(Ctx.VoidTy, Args, ExtInfo, |
| 1832 | /*IsVariadic=*/false); |
| 1833 | llvm::FunctionType *FuncLLVMTy = CGM.getTypes().GetFunctionType(FuncInfo); |
| 1834 | |
| 1835 | llvm::Function *F = |
| 1836 | llvm::Function::Create(FuncLLVMTy, llvm::GlobalValue::InternalLinkage, |
| 1837 | CapturedStmtInfo->getHelperName(), &CGM.getModule()); |
| 1838 | CGM.SetInternalFunctionAttributes(CD, F, FuncInfo); |
| 1839 | |
| 1840 | // Generate the function. |
| 1841 | StartFunction(CD, Ctx.VoidTy, F, FuncInfo, Args, CD->getBody()->getLocStart()); |
| 1842 | |
| 1843 | // Set the context parameter in CapturedStmtInfo. |
| 1844 | llvm::Value *DeclPtr = LocalDeclMap[CD->getContextParam()]; |
| 1845 | assert(DeclPtr && "missing context parameter for CapturedStmt"); |
| 1846 | CapturedStmtInfo->setContextValue(Builder.CreateLoad(DeclPtr)); |
| 1847 | |
| 1848 | // If 'this' is captured, load it into CXXThisValue. |
| 1849 | if (CapturedStmtInfo->isCXXThisExprCaptured()) { |
| 1850 | FieldDecl *FD = CapturedStmtInfo->getThisFieldDecl(); |
| 1851 | LValue LV = MakeNaturalAlignAddrLValue(CapturedStmtInfo->getContextValue(), |
| 1852 | Ctx.getTagDeclType(RD)); |
| 1853 | LValue ThisLValue = EmitLValueForField(LV, FD); |
| 1854 | |
| 1855 | CXXThisValue = EmitLoadOfLValue(ThisLValue).getScalarVal(); |
| 1856 | } |
| 1857 | |
| 1858 | CapturedStmtInfo->EmitBody(*this, CD->getBody()); |
| 1859 | FinishFunction(CD->getBodyRBrace()); |
| 1860 | |
| 1861 | return F; |
Tareq A. Siraj | 051303c | 2013-04-16 18:53:08 +0000 | [diff] [blame] | 1862 | } |