diff options
| author | Philip Reames <listmail@philipreames.com> | 2018-08-09 20:18:42 +0000 |
|---|---|---|
| committer | Philip Reames <listmail@philipreames.com> | 2018-08-09 20:18:42 +0000 |
| commit | ca256d93fb352746a9f1912e1838804a0e1efc4f (patch) | |
| tree | 8da7883319415a77cda4e04b97e468b85be3e87c /llvm/lib/Transforms | |
| parent | ed4f51755ec7d72a290e6055e5eddc50a93360e3 (diff) | |
| download | bcm5719-llvm-ca256d93fb352746a9f1912e1838804a0e1efc4f.tar.gz bcm5719-llvm-ca256d93fb352746a9f1912e1838804a0e1efc4f.zip | |
[LICM] hoist fences out of loops w/o memory operations
The motivating case is an otherwise dead loop with a fence in it. At the moment, this goes all the way through the optimizer and we end up emitting an entirely pointless loop on x86. This case may seem a bit contrived, but we've seen it in real code as the result of otherwise reasonable lowering strategies combined w/thread local memory optimizations (such as escape analysis).
To handle this simple case, we can teach LICM to hoist must execute fences when there is no other memory operation within the loop.
Differential Revision: https://reviews.llvm.org/D50489
llvm-svn: 339378
Diffstat (limited to 'llvm/lib/Transforms')
| -rw-r--r-- | llvm/lib/Transforms/Scalar/LICM.cpp | 15 |
1 files changed, 15 insertions, 0 deletions
diff --git a/llvm/lib/Transforms/Scalar/LICM.cpp b/llvm/lib/Transforms/Scalar/LICM.cpp index d4ef9ade6f3..dbb9bc6318d 100644 --- a/llvm/lib/Transforms/Scalar/LICM.cpp +++ b/llvm/lib/Transforms/Scalar/LICM.cpp @@ -582,6 +582,7 @@ namespace { bool isHoistableAndSinkableInst(Instruction &I) { // Only these instructions are hoistable/sinkable. return (isa<LoadInst>(I) || isa<CallInst>(I) || + isa<FenceInst>(I) || isa<BinaryOperator>(I) || isa<CastInst>(I) || isa<SelectInst>(I) || isa<GetElementPtrInst>(I) || isa<CmpInst>(I) || isa<InsertElementInst>(I) || @@ -684,6 +685,20 @@ bool llvm::canSinkOrHoistInst(Instruction &I, AAResults *AA, DominatorTree *DT, // sink the call. return false; + } else if (auto *FI = dyn_cast<FenceInst>(&I)) { + // Fences alias (most) everything to provide ordering. For the moment, + // just give up if there are any other memory operations in the loop. + auto Begin = CurAST->begin(); + assert(Begin != CurAST->end() && "must contain FI"); + if (std::next(Begin) != CurAST->end()) + // constant memory for instance, TODO: handle better + return false; + auto *UniqueI = Begin->getUniqueInstruction(); + if (!UniqueI) + // other memory op, give up + return false; + assert(UniqueI == FI && "AS must contain FI"); + return true; } assert(!I.mayReadOrWriteMemory() && "unhandled aliasing"); |

