1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
//===- UnrollLoopTest.cpp - Unit tests for UnrollLoop ---------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#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, false, &LI,
&SE, &DT, &AC, PreserveLCSSA);
EXPECT_FALSE(ret);
}
|
