summaryrefslogtreecommitdiff
path: root/unittests/Transforms/Utils/UnrollLoopTest.cpp
diff options
context:
space:
mode:
authorDimitry Andric <dim@FreeBSD.org>2019-01-19 10:01:25 +0000
committerDimitry Andric <dim@FreeBSD.org>2019-01-19 10:01:25 +0000
commitd8e91e46262bc44006913e6796843909f1ac7bcd (patch)
tree7d0c143d9b38190e0fa0180805389da22cd834c5 /unittests/Transforms/Utils/UnrollLoopTest.cpp
parentb7eb8e35e481a74962664b63dfb09483b200209a (diff)
Notes
Diffstat (limited to 'unittests/Transforms/Utils/UnrollLoopTest.cpp')
-rw-r--r--unittests/Transforms/Utils/UnrollLoopTest.cpp76
1 files changed, 76 insertions, 0 deletions
diff --git a/unittests/Transforms/Utils/UnrollLoopTest.cpp b/unittests/Transforms/Utils/UnrollLoopTest.cpp
new file mode 100644
index 000000000000..5f7c2d62380d
--- /dev/null
+++ b/unittests/Transforms/Utils/UnrollLoopTest.cpp
@@ -0,0 +1,76 @@
+//===- UnrollLoopTest.cpp - Unit tests for UnrollLoop ---------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+#include "llvm/Transforms/Utils/UnrollLoop.h"
+#include "llvm/Analysis/AssumptionCache.h"
+#include "llvm/Analysis/LoopInfo.h"
+#include "llvm/Analysis/ScalarEvolution.h"
+#include "llvm/Analysis/TargetLibraryInfo.h"
+#include "llvm/AsmParser/Parser.h"
+#include "llvm/IR/BasicBlock.h"
+#include "llvm/IR/Dominators.h"
+#include "llvm/IR/LLVMContext.h"
+#include "llvm/Support/SourceMgr.h"
+#include "gtest/gtest.h"
+
+using namespace llvm;
+
+static std::unique_ptr<Module> parseIR(LLVMContext &C, const char *IR) {
+ SMDiagnostic Err;
+ std::unique_ptr<Module> Mod = parseAssemblyString(IR, Err, C);
+ if (!Mod)
+ Err.print("UnrollLoopTests", errs());
+ return Mod;
+}
+
+TEST(LoopUnrollRuntime, Latch) {
+ LLVMContext C;
+
+ std::unique_ptr<Module> M = parseIR(
+ C,
+ R"(define i32 @test(i32* %a, i32* %b, i32* %c, i64 %n) {
+entry:
+ br label %while.cond
+
+while.cond: ; preds = %while.body, %entry
+ %i.0 = phi i64 [ 0, %entry ], [ %inc, %while.body ]
+ %cmp = icmp slt i64 %i.0, %n
+ br i1 %cmp, label %while.body, label %while.end
+
+while.body: ; preds = %while.cond
+ %arrayidx = getelementptr inbounds i32, i32* %b, i64 %i.0
+ %0 = load i32, i32* %arrayidx
+ %arrayidx1 = getelementptr inbounds i32, i32* %c, i64 %i.0
+ %1 = load i32, i32* %arrayidx1
+ %mul = mul nsw i32 %0, %1
+ %arrayidx2 = getelementptr inbounds i32, i32* %a, i64 %i.0
+ store i32 %mul, i32* %arrayidx2
+ %inc = add nsw i64 %i.0, 1
+ br label %while.cond
+
+while.end: ; preds = %while.cond
+ ret i32 0
+})"
+ );
+
+ auto *F = M->getFunction("test");
+ DominatorTree DT(*F);
+ LoopInfo LI(DT);
+ AssumptionCache AC(*F);
+ TargetLibraryInfoImpl TLII;
+ TargetLibraryInfo TLI(TLII);
+ ScalarEvolution SE(*F, TLI, AC, DT, LI);
+
+ Loop *L = *LI.begin();
+
+ bool PreserveLCSSA = L->isRecursivelyLCSSAForm(DT,LI);
+
+ bool ret = UnrollRuntimeLoopRemainder(L, 4, true, false, false, &LI, &SE, &DT, &AC, PreserveLCSSA);
+ EXPECT_FALSE(ret);
+}