aboutsummaryrefslogtreecommitdiff
path: root/llvm/unittests/Transforms/Scalar
diff options
context:
space:
mode:
Diffstat (limited to 'llvm/unittests/Transforms/Scalar')
-rw-r--r--llvm/unittests/Transforms/Scalar/LICMTest.cpp12
-rw-r--r--llvm/unittests/Transforms/Scalar/LoopPassManagerTest.cpp44
2 files changed, 28 insertions, 28 deletions
diff --git a/llvm/unittests/Transforms/Scalar/LICMTest.cpp b/llvm/unittests/Transforms/Scalar/LICMTest.cpp
index 98a69bb..a193993b 100644
--- a/llvm/unittests/Transforms/Scalar/LICMTest.cpp
+++ b/llvm/unittests/Transforms/Scalar/LICMTest.cpp
@@ -37,13 +37,13 @@ TEST(LICMTest, TestSCEVInvalidationOnHoisting) {
SMDiagnostic Error;
StringRef Text = R"(
- define void @foo(i64* %ptr) {
+ define void @foo(ptr %ptr) {
entry:
br label %loop
loop:
%iv = phi i64 [ 0, %entry ], [ %iv.inc, %loop ]
- %n = load i64, i64* %ptr, !invariant.load !0
+ %n = load i64, ptr %ptr, !invariant.load !0
%iv.inc = add i64 %iv, 1
%cmp = icmp ult i64 %iv.inc, %n
br i1 %cmp, label %loop, label %exit
@@ -62,17 +62,17 @@ TEST(LICMTest, TestSCEVInvalidationOnHoisting) {
BasicBlock &EntryBB = F->getEntryBlock();
BasicBlock *LoopBB = EntryBB.getUniqueSuccessor();
- // Select `load i64, i64* %ptr`.
+ // Select `load i64, ptr %ptr`.
Instruction *IBefore = &*LoopBB->getFirstNonPHIIt();
// Make sure the right instruction was selected.
ASSERT_TRUE(isa<LoadInst>(IBefore));
- // Upon this query SCEV caches disposition of <load i64, i64* %ptr> SCEV.
+ // Upon this query SCEV caches disposition of <load i64, ptr %ptr> SCEV.
ASSERT_EQ(SE.getBlockDisposition(SE.getSCEV(IBefore), LoopBB),
ScalarEvolution::BlockDisposition::DominatesBlock);
MPM.run(*M, MAM);
- // Select `load i64, i64* %ptr` after it was hoisted.
+ // Select `load i64, ptr %ptr` after it was hoisted.
Instruction *IAfter = &*EntryBB.getFirstNonPHIIt();
// Make sure the right instruction was selected.
ASSERT_TRUE(isa<LoadInst>(IAfter));
@@ -84,7 +84,7 @@ TEST(LICMTest, TestSCEVInvalidationOnHoisting) {
SE.getBlockDisposition(SE.getSCEV(IAfter), LoopBB);
// If LICM have properly invalidated SCEV,
- // 1. SCEV of <load i64, i64* %ptr> should properly dominate the "loop" BB,
+ // 1. SCEV of <load i64, ptr %ptr> should properly dominate the "loop" BB,
// 2. extra invalidation shouldn't change result of the query.
EXPECT_EQ(DispositionBeforeInvalidation,
ScalarEvolution::BlockDisposition::ProperlyDominatesBlock);
diff --git a/llvm/unittests/Transforms/Scalar/LoopPassManagerTest.cpp b/llvm/unittests/Transforms/Scalar/LoopPassManagerTest.cpp
index cb3d1001..88eaa87 100644
--- a/llvm/unittests/Transforms/Scalar/LoopPassManagerTest.cpp
+++ b/llvm/unittests/Transforms/Scalar/LoopPassManagerTest.cpp
@@ -265,21 +265,21 @@ protected:
public:
LoopPassManagerTest()
: M(parseIR(Context,
- "define void @f(i1* %ptr) {\n"
+ "define void @f(ptr %ptr) {\n"
"entry:\n"
" br label %loop.0\n"
"loop.0:\n"
- " %cond.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0, label %loop.0.0.ph, label %end\n"
"loop.0.0.ph:\n"
" br label %loop.0.0\n"
"loop.0.0:\n"
- " %cond.0.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.0, label %loop.0.0, label %loop.0.1.ph\n"
"loop.0.1.ph:\n"
" br label %loop.0.1\n"
"loop.0.1:\n"
- " %cond.0.1 = load volatile i1, i1* %ptr\n"
+ " %cond.0.1 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.1, label %loop.0.1, label %loop.0.latch\n"
"loop.0.latch:\n"
" br label %loop.0\n"
@@ -287,11 +287,11 @@ public:
" ret void\n"
"}\n"
"\n"
- "define void @g(i1* %ptr) {\n"
+ "define void @g(ptr %ptr) {\n"
"entry:\n"
" br label %loop.g.0\n"
"loop.g.0:\n"
- " %cond.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0, label %loop.g.0, label %end\n"
"end:\n"
" ret void\n"
@@ -861,26 +861,26 @@ TEST_F(LoopPassManagerTest, IndirectOuterPassInvalidation) {
TEST_F(LoopPassManagerTest, LoopChildInsertion) {
// Super boring module with three loops in a single loop nest.
- M = parseIR(Context, "define void @f(i1* %ptr) {\n"
+ M = parseIR(Context, "define void @f(ptr %ptr) {\n"
"entry:\n"
" br label %loop.0\n"
"loop.0:\n"
- " %cond.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0, label %loop.0.0.ph, label %end\n"
"loop.0.0.ph:\n"
" br label %loop.0.0\n"
"loop.0.0:\n"
- " %cond.0.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.0, label %loop.0.0, label %loop.0.1.ph\n"
"loop.0.1.ph:\n"
" br label %loop.0.1\n"
"loop.0.1:\n"
- " %cond.0.1 = load volatile i1, i1* %ptr\n"
+ " %cond.0.1 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.1, label %loop.0.1, label %loop.0.2.ph\n"
"loop.0.2.ph:\n"
" br label %loop.0.2\n"
"loop.0.2:\n"
- " %cond.0.2 = load volatile i1, i1* %ptr\n"
+ " %cond.0.2 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.2, label %loop.0.2, label %loop.0.latch\n"
"loop.0.latch:\n"
" br label %loop.0\n"
@@ -1064,28 +1064,28 @@ TEST_F(LoopPassManagerTest, LoopChildInsertion) {
TEST_F(LoopPassManagerTest, LoopPeerInsertion) {
// Super boring module with two loop nests and loop nest with two child
// loops.
- M = parseIR(Context, "define void @f(i1* %ptr) {\n"
+ M = parseIR(Context, "define void @f(ptr %ptr) {\n"
"entry:\n"
" br label %loop.0\n"
"loop.0:\n"
- " %cond.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0, label %loop.0.0.ph, label %loop.2.ph\n"
"loop.0.0.ph:\n"
" br label %loop.0.0\n"
"loop.0.0:\n"
- " %cond.0.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.0, label %loop.0.0, label %loop.0.2.ph\n"
"loop.0.2.ph:\n"
" br label %loop.0.2\n"
"loop.0.2:\n"
- " %cond.0.2 = load volatile i1, i1* %ptr\n"
+ " %cond.0.2 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.2, label %loop.0.2, label %loop.0.latch\n"
"loop.0.latch:\n"
" br label %loop.0\n"
"loop.2.ph:\n"
" br label %loop.2\n"
"loop.2:\n"
- " %cond.2 = load volatile i1, i1* %ptr\n"
+ " %cond.2 = load volatile i1, ptr %ptr\n"
" br i1 %cond.2, label %loop.2, label %end\n"
"end:\n"
" ret void\n"
@@ -1318,31 +1318,31 @@ TEST_F(LoopPassManagerTest, LoopDeletion) {
// Build a module with a single loop nest that contains one outer loop with
// three subloops, and one of those with its own subloop. We will
// incrementally delete all of these to test different deletion scenarios.
- M = parseIR(Context, "define void @f(i1* %ptr) {\n"
+ M = parseIR(Context, "define void @f(ptr %ptr) {\n"
"entry:\n"
" br label %loop.0\n"
"loop.0:\n"
- " %cond.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0, label %loop.0.0.ph, label %end\n"
"loop.0.0.ph:\n"
" br label %loop.0.0\n"
"loop.0.0:\n"
- " %cond.0.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.0, label %loop.0.0, label %loop.0.1.ph\n"
"loop.0.1.ph:\n"
" br label %loop.0.1\n"
"loop.0.1:\n"
- " %cond.0.1 = load volatile i1, i1* %ptr\n"
+ " %cond.0.1 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.1, label %loop.0.1, label %loop.0.2.ph\n"
"loop.0.2.ph:\n"
" br label %loop.0.2\n"
"loop.0.2:\n"
- " %cond.0.2 = load volatile i1, i1* %ptr\n"
+ " %cond.0.2 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.2, label %loop.0.2.0.ph, label %loop.0.latch\n"
"loop.0.2.0.ph:\n"
" br label %loop.0.2.0\n"
"loop.0.2.0:\n"
- " %cond.0.2.0 = load volatile i1, i1* %ptr\n"
+ " %cond.0.2.0 = load volatile i1, ptr %ptr\n"
" br i1 %cond.0.2.0, label %loop.0.2.0, label %loop.0.2.latch\n"
"loop.0.2.latch:\n"
" br label %loop.0.2\n"
generated by cgit v1.1 at 2025-11-12 18:56:47 +0000