1*2f6987baSFedor Sergeev //===- LoopRotationUtilsTest.cpp - Unit tests for LoopRotation utility ----===// 2*2f6987baSFedor Sergeev // 3*2f6987baSFedor Sergeev // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*2f6987baSFedor Sergeev // See https://llvm.org/LICENSE.txt for license information. 5*2f6987baSFedor Sergeev // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*2f6987baSFedor Sergeev // 7*2f6987baSFedor Sergeev //===----------------------------------------------------------------------===// 8*2f6987baSFedor Sergeev 9*2f6987baSFedor Sergeev #include "llvm/Transforms/Utils/LoopRotationUtils.h" 10*2f6987baSFedor Sergeev #include "llvm/Analysis/AssumptionCache.h" 11*2f6987baSFedor Sergeev #include "llvm/Analysis/InstructionSimplify.h" 12*2f6987baSFedor Sergeev #include "llvm/Analysis/LoopInfo.h" 13*2f6987baSFedor Sergeev #include "llvm/Analysis/ScalarEvolution.h" 14*2f6987baSFedor Sergeev #include "llvm/Analysis/TargetLibraryInfo.h" 15*2f6987baSFedor Sergeev #include "llvm/Analysis/TargetTransformInfo.h" 16*2f6987baSFedor Sergeev #include "llvm/AsmParser/Parser.h" 17*2f6987baSFedor Sergeev #include "llvm/IR/Dominators.h" 18*2f6987baSFedor Sergeev #include "llvm/IR/LLVMContext.h" 19*2f6987baSFedor Sergeev #include "llvm/Support/SourceMgr.h" 20*2f6987baSFedor Sergeev #include "gtest/gtest.h" 21*2f6987baSFedor Sergeev 22*2f6987baSFedor Sergeev using namespace llvm; 23*2f6987baSFedor Sergeev 24*2f6987baSFedor Sergeev static std::unique_ptr<Module> parseIR(LLVMContext &C, const char *IR) { 25*2f6987baSFedor Sergeev SMDiagnostic Err; 26*2f6987baSFedor Sergeev std::unique_ptr<Module> Mod = parseAssemblyString(IR, Err, C); 27*2f6987baSFedor Sergeev if (!Mod) 28*2f6987baSFedor Sergeev Err.print("LoopRotationUtilsTest", errs()); 29*2f6987baSFedor Sergeev return Mod; 30*2f6987baSFedor Sergeev } 31*2f6987baSFedor Sergeev 32*2f6987baSFedor Sergeev /// This test contains multi-deopt-exits pattern that might allow loop rotation 33*2f6987baSFedor Sergeev /// to trigger multiple times if multiple rotations are enabled. 34*2f6987baSFedor Sergeev /// At least one rotation should be performed, no matter what loop rotation settings are. 35*2f6987baSFedor Sergeev TEST(LoopRotate, MultiDeoptExit) { 36*2f6987baSFedor Sergeev LLVMContext C; 37*2f6987baSFedor Sergeev 38*2f6987baSFedor Sergeev std::unique_ptr<Module> M = parseIR( 39*2f6987baSFedor Sergeev C, 40*2f6987baSFedor Sergeev R"( 41*2f6987baSFedor Sergeev declare i32 @llvm.experimental.deoptimize.i32(...) 42*2f6987baSFedor Sergeev 43*2f6987baSFedor Sergeev define i32 @test(i32 * nonnull %a, i64 %x) { 44*2f6987baSFedor Sergeev entry: 45*2f6987baSFedor Sergeev br label %for.cond1 46*2f6987baSFedor Sergeev 47*2f6987baSFedor Sergeev for.cond1: 48*2f6987baSFedor Sergeev %idx = phi i64 [ 0, %entry ], [ %idx.next, %for.tail ] 49*2f6987baSFedor Sergeev %sum = phi i32 [ 0, %entry ], [ %sum.next, %for.tail ] 50*2f6987baSFedor Sergeev %a.idx = getelementptr inbounds i32, i32 *%a, i64 %idx 51*2f6987baSFedor Sergeev %val.a.idx = load i32, i32* %a.idx, align 4 52*2f6987baSFedor Sergeev %zero.check = icmp eq i32 %val.a.idx, 0 53*2f6987baSFedor Sergeev br i1 %zero.check, label %deopt.exit, label %for.cond2 54*2f6987baSFedor Sergeev 55*2f6987baSFedor Sergeev for.cond2: 56*2f6987baSFedor Sergeev %for.check = icmp ult i64 %idx, %x 57*2f6987baSFedor Sergeev br i1 %for.check, label %for.body, label %return 58*2f6987baSFedor Sergeev 59*2f6987baSFedor Sergeev for.body: 60*2f6987baSFedor Sergeev br label %for.tail 61*2f6987baSFedor Sergeev 62*2f6987baSFedor Sergeev for.tail: 63*2f6987baSFedor Sergeev %sum.next = add i32 %sum, %val.a.idx 64*2f6987baSFedor Sergeev %idx.next = add nuw nsw i64 %idx, 1 65*2f6987baSFedor Sergeev br label %for.cond1 66*2f6987baSFedor Sergeev 67*2f6987baSFedor Sergeev return: 68*2f6987baSFedor Sergeev ret i32 %sum 69*2f6987baSFedor Sergeev 70*2f6987baSFedor Sergeev deopt.exit: 71*2f6987baSFedor Sergeev %deopt.val = call i32(...) @llvm.experimental.deoptimize.i32() [ "deopt"(i32 %val.a.idx) ] 72*2f6987baSFedor Sergeev ret i32 %deopt.val 73*2f6987baSFedor Sergeev })" 74*2f6987baSFedor Sergeev ); 75*2f6987baSFedor Sergeev 76*2f6987baSFedor Sergeev auto *F = M->getFunction("test"); 77*2f6987baSFedor Sergeev DominatorTree DT(*F); 78*2f6987baSFedor Sergeev LoopInfo LI(DT); 79*2f6987baSFedor Sergeev AssumptionCache AC(*F); 80*2f6987baSFedor Sergeev TargetTransformInfo TTI(M->getDataLayout()); 81*2f6987baSFedor Sergeev TargetLibraryInfoImpl TLII; 82*2f6987baSFedor Sergeev TargetLibraryInfo TLI(TLII); 83*2f6987baSFedor Sergeev ScalarEvolution SE(*F, TLI, AC, DT, LI); 84*2f6987baSFedor Sergeev SimplifyQuery SQ(M->getDataLayout()); 85*2f6987baSFedor Sergeev 86*2f6987baSFedor Sergeev Loop *L = *LI.begin(); 87*2f6987baSFedor Sergeev 88*2f6987baSFedor Sergeev bool ret = LoopRotation(L, &LI, &TTI, 89*2f6987baSFedor Sergeev &AC, &DT, 90*2f6987baSFedor Sergeev &SE, nullptr, 91*2f6987baSFedor Sergeev SQ, true, -1, false); 92*2f6987baSFedor Sergeev EXPECT_TRUE(ret); 93*2f6987baSFedor Sergeev } 94*2f6987baSFedor Sergeev 95*2f6987baSFedor Sergeev /// Checking a special case of multi-deopt exit loop that can not perform 96*2f6987baSFedor Sergeev /// required amount of rotations due to the desired header containing 97*2f6987baSFedor Sergeev /// non-duplicatable code. 98*2f6987baSFedor Sergeev /// Similar to MultiDeoptExit test this one should do at least one rotation and 99*2f6987baSFedor Sergeev /// pass no matter what loop rotation settings are. 100*2f6987baSFedor Sergeev TEST(LoopRotate, MultiDeoptExit_Nondup) { 101*2f6987baSFedor Sergeev LLVMContext C; 102*2f6987baSFedor Sergeev 103*2f6987baSFedor Sergeev std::unique_ptr<Module> M = parseIR( 104*2f6987baSFedor Sergeev C, 105*2f6987baSFedor Sergeev R"( 106*2f6987baSFedor Sergeev ; Rotation should be done once, attempted twice. 107*2f6987baSFedor Sergeev ; Second time fails due to non-duplicatable header. 108*2f6987baSFedor Sergeev 109*2f6987baSFedor Sergeev declare i32 @llvm.experimental.deoptimize.i32(...) 110*2f6987baSFedor Sergeev 111*2f6987baSFedor Sergeev declare void @nondup() 112*2f6987baSFedor Sergeev 113*2f6987baSFedor Sergeev define i32 @test_nondup(i32 * nonnull %a, i64 %x) { 114*2f6987baSFedor Sergeev entry: 115*2f6987baSFedor Sergeev br label %for.cond1 116*2f6987baSFedor Sergeev 117*2f6987baSFedor Sergeev for.cond1: 118*2f6987baSFedor Sergeev %idx = phi i64 [ 0, %entry ], [ %idx.next, %for.tail ] 119*2f6987baSFedor Sergeev %sum = phi i32 [ 0, %entry ], [ %sum.next, %for.tail ] 120*2f6987baSFedor Sergeev %a.idx = getelementptr inbounds i32, i32 *%a, i64 %idx 121*2f6987baSFedor Sergeev %val.a.idx = load i32, i32* %a.idx, align 4 122*2f6987baSFedor Sergeev %zero.check = icmp eq i32 %val.a.idx, 0 123*2f6987baSFedor Sergeev br i1 %zero.check, label %deopt.exit, label %for.cond2 124*2f6987baSFedor Sergeev 125*2f6987baSFedor Sergeev for.cond2: 126*2f6987baSFedor Sergeev call void @nondup() noduplicate 127*2f6987baSFedor Sergeev %for.check = icmp ult i64 %idx, %x 128*2f6987baSFedor Sergeev br i1 %for.check, label %for.body, label %return 129*2f6987baSFedor Sergeev 130*2f6987baSFedor Sergeev for.body: 131*2f6987baSFedor Sergeev br label %for.tail 132*2f6987baSFedor Sergeev 133*2f6987baSFedor Sergeev for.tail: 134*2f6987baSFedor Sergeev %sum.next = add i32 %sum, %val.a.idx 135*2f6987baSFedor Sergeev %idx.next = add nuw nsw i64 %idx, 1 136*2f6987baSFedor Sergeev br label %for.cond1 137*2f6987baSFedor Sergeev 138*2f6987baSFedor Sergeev return: 139*2f6987baSFedor Sergeev ret i32 %sum 140*2f6987baSFedor Sergeev 141*2f6987baSFedor Sergeev deopt.exit: 142*2f6987baSFedor Sergeev %deopt.val = call i32(...) @llvm.experimental.deoptimize.i32() [ "deopt"(i32 %val.a.idx) ] 143*2f6987baSFedor Sergeev ret i32 %deopt.val 144*2f6987baSFedor Sergeev })" 145*2f6987baSFedor Sergeev ); 146*2f6987baSFedor Sergeev 147*2f6987baSFedor Sergeev auto *F = M->getFunction("test_nondup"); 148*2f6987baSFedor Sergeev DominatorTree DT(*F); 149*2f6987baSFedor Sergeev LoopInfo LI(DT); 150*2f6987baSFedor Sergeev AssumptionCache AC(*F); 151*2f6987baSFedor Sergeev TargetTransformInfo TTI(M->getDataLayout()); 152*2f6987baSFedor Sergeev TargetLibraryInfoImpl TLII; 153*2f6987baSFedor Sergeev TargetLibraryInfo TLI(TLII); 154*2f6987baSFedor Sergeev ScalarEvolution SE(*F, TLI, AC, DT, LI); 155*2f6987baSFedor Sergeev SimplifyQuery SQ(M->getDataLayout()); 156*2f6987baSFedor Sergeev 157*2f6987baSFedor Sergeev Loop *L = *LI.begin(); 158*2f6987baSFedor Sergeev 159*2f6987baSFedor Sergeev bool ret = LoopRotation(L, &LI, &TTI, 160*2f6987baSFedor Sergeev &AC, &DT, 161*2f6987baSFedor Sergeev &SE, nullptr, 162*2f6987baSFedor Sergeev SQ, true, -1, false); 163*2f6987baSFedor Sergeev /// LoopRotation should properly report "true" as we still perform the first rotation 164*2f6987baSFedor Sergeev /// so we do change the IR. 165*2f6987baSFedor Sergeev EXPECT_TRUE(ret); 166*2f6987baSFedor Sergeev } 167