| //===- llvm/unittest/Transforms/Vectorize/VPlanHCFGTest.cpp ---------------===// |
| // |
| // 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 "../lib/Transforms/Vectorize/VPlan.h" |
| #include "../lib/Transforms/Vectorize/VPlanTransforms.h" |
| #include "VPlanTestBase.h" |
| #include "gtest/gtest.h" |
| #include <string> |
| |
| namespace llvm { |
| namespace { |
| |
| class VPlanHCFGTest : public VPlanTestBase {}; |
| |
| TEST_F(VPlanHCFGTest, testBuildHCFGInnerLoop) { |
| const char *ModuleString = |
| "define void @f(i32* %A, i64 %N) {\n" |
| "entry:\n" |
| " br label %for.body\n" |
| "for.body:\n" |
| " %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]\n" |
| " %arr.idx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv\n" |
| " %l1 = load i32, i32* %arr.idx, align 4\n" |
| " %res = add i32 %l1, 10\n" |
| " store i32 %res, i32* %arr.idx, align 4\n" |
| " %indvars.iv.next = add i64 %indvars.iv, 1\n" |
| " %exitcond = icmp ne i64 %indvars.iv.next, %N\n" |
| " br i1 %exitcond, label %for.body, label %for.end\n" |
| "for.end:\n" |
| " ret void\n" |
| "}\n"; |
| |
| Module &M = parseModule(ModuleString); |
| |
| Function *F = M.getFunction("f"); |
| BasicBlock *LoopHeader = F->getEntryBlock().getSingleSuccessor(); |
| auto Plan = buildHCFG(LoopHeader); |
| |
| VPBasicBlock *Entry = Plan->getEntry()->getEntryBasicBlock(); |
| EXPECT_NE(nullptr, Entry->getSingleSuccessor()); |
| EXPECT_EQ(0u, Entry->getNumPredecessors()); |
| EXPECT_EQ(1u, Entry->getNumSuccessors()); |
| EXPECT_EQ(nullptr, Entry->getCondBit()); |
| |
| VPBasicBlock *VecBB = Entry->getSingleSuccessor()->getEntryBasicBlock(); |
| EXPECT_EQ(7u, VecBB->size()); |
| EXPECT_EQ(2u, VecBB->getNumPredecessors()); |
| EXPECT_EQ(2u, VecBB->getNumSuccessors()); |
| EXPECT_EQ(&*Plan, VecBB->getPlan()); |
| |
| auto Iter = VecBB->begin(); |
| VPInstruction *Phi = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::PHI, Phi->getOpcode()); |
| |
| VPInstruction *Idx = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::GetElementPtr, Idx->getOpcode()); |
| EXPECT_EQ(2u, Idx->getNumOperands()); |
| EXPECT_EQ(Phi, Idx->getOperand(1)); |
| |
| VPInstruction *Load = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::Load, Load->getOpcode()); |
| EXPECT_EQ(1u, Load->getNumOperands()); |
| EXPECT_EQ(Idx, Load->getOperand(0)); |
| |
| VPInstruction *Add = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::Add, Add->getOpcode()); |
| EXPECT_EQ(2u, Add->getNumOperands()); |
| EXPECT_EQ(Load, Add->getOperand(0)); |
| |
| VPInstruction *Store = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::Store, Store->getOpcode()); |
| EXPECT_EQ(2u, Store->getNumOperands()); |
| EXPECT_EQ(Add, Store->getOperand(0)); |
| EXPECT_EQ(Idx, Store->getOperand(1)); |
| |
| VPInstruction *IndvarAdd = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::Add, IndvarAdd->getOpcode()); |
| EXPECT_EQ(2u, IndvarAdd->getNumOperands()); |
| EXPECT_EQ(Phi, IndvarAdd->getOperand(0)); |
| |
| VPInstruction *ICmp = dyn_cast<VPInstruction>(&*Iter++); |
| EXPECT_EQ(Instruction::ICmp, ICmp->getOpcode()); |
| EXPECT_EQ(2u, ICmp->getNumOperands()); |
| EXPECT_EQ(IndvarAdd, ICmp->getOperand(0)); |
| EXPECT_EQ(VecBB->getCondBit(), ICmp); |
| |
| // Add an external value to check we do not print the list of external values, |
| // as this is not required with the new printing. |
| Plan->addVPValue(&*F->arg_begin()); |
| std::string FullDump; |
| raw_string_ostream(FullDump) << *Plan; |
| const char *ExpectedStr = R"(digraph VPlan { |
| graph [labelloc=t, fontsize=30; label="Vectorization Plan"] |
| node [shape=rect, fontname=Courier, fontsize=30] |
| edge [fontname=Courier, fontsize=30] |
| compound=true |
| subgraph cluster_N0 { |
| fontname=Courier |
| label="\<x1\> TopRegion" |
| N1 [label = |
| "entry:\n" |
| ] |
| N1 -> N2 [ label=""] |
| N2 [label = |
| "for.body:\n" + |
| "EMIT ir<%indvars.iv> = phi ir<0> ir<%indvars.iv.next>\l" + |
| "EMIT ir<%arr.idx> = getelementptr ir<%A> ir<%indvars.iv>\l" + |
| "EMIT ir<%l1> = load ir<%arr.idx>\l" + |
| "EMIT ir<%res> = add ir<%l1> ir<10>\l" + |
| "EMIT store ir<%res> ir<%arr.idx>\l" + |
| "EMIT ir<%indvars.iv.next> = add ir<%indvars.iv> ir<1>\l" + |
| "EMIT ir<%exitcond> = icmp ir<%indvars.iv.next> ir<%N>\l" + |
| "CondBit: ir<%exitcond> (for.body)\l" |
| ] |
| N2 -> N2 [ label="T"] |
| N2 -> N3 [ label="F"] |
| N3 [label = |
| "for.end:\n" + |
| "EMIT ret\l" |
| ] |
| } |
| } |
| )"; |
| EXPECT_EQ(ExpectedStr, FullDump); |
| |
| LoopVectorizationLegality::InductionList Inductions; |
| SmallPtrSet<Instruction *, 1> DeadInstructions; |
| VPlanTransforms::VPInstructionsToVPRecipes(LI->getLoopFor(LoopHeader), Plan, |
| Inductions, DeadInstructions); |
| } |
| |
| TEST_F(VPlanHCFGTest, testVPInstructionToVPRecipesInner) { |
| const char *ModuleString = |
| "define void @f(i32* %A, i64 %N) {\n" |
| "entry:\n" |
| " br label %for.body\n" |
| "for.body:\n" |
| " %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]\n" |
| " %arr.idx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv\n" |
| " %l1 = load i32, i32* %arr.idx, align 4\n" |
| " %res = add i32 %l1, 10\n" |
| " store i32 %res, i32* %arr.idx, align 4\n" |
| " %indvars.iv.next = add i64 %indvars.iv, 1\n" |
| " %exitcond = icmp ne i64 %indvars.iv.next, %N\n" |
| " br i1 %exitcond, label %for.body, label %for.end\n" |
| "for.end:\n" |
| " ret void\n" |
| "}\n"; |
| |
| Module &M = parseModule(ModuleString); |
| |
| Function *F = M.getFunction("f"); |
| BasicBlock *LoopHeader = F->getEntryBlock().getSingleSuccessor(); |
| auto Plan = buildHCFG(LoopHeader); |
| |
| LoopVectorizationLegality::InductionList Inductions; |
| SmallPtrSet<Instruction *, 1> DeadInstructions; |
| VPlanTransforms::VPInstructionsToVPRecipes(LI->getLoopFor(LoopHeader), Plan, |
| Inductions, DeadInstructions); |
| |
| VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); |
| EXPECT_NE(nullptr, Entry->getSingleSuccessor()); |
| EXPECT_EQ(0u, Entry->getNumPredecessors()); |
| EXPECT_EQ(1u, Entry->getNumSuccessors()); |
| |
| VPBasicBlock *VecBB = Entry->getSingleSuccessor()->getEntryBasicBlock(); |
| EXPECT_EQ(7u, VecBB->size()); |
| EXPECT_EQ(2u, VecBB->getNumPredecessors()); |
| EXPECT_EQ(2u, VecBB->getNumSuccessors()); |
| |
| auto Iter = VecBB->begin(); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenPHIRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenGEPRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenMemoryInstructionRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenMemoryInstructionRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenRecipe>(&*Iter++)); |
| EXPECT_NE(nullptr, dyn_cast<VPWidenRecipe>(&*Iter++)); |
| EXPECT_EQ(VecBB->end(), Iter); |
| } |
| |
| } // namespace |
| } // namespace llvm |