[llvm] 7ee863b - [Test] Add simplified versions of tests for loop deletion that don't need context
Max Kazantsev via llvm-commits
llvm-commits at lists.llvm.org
Wed May 26 02:39:26 PDT 2021
Author: Max Kazantsev
Date: 2021-05-26T16:39:00+07:00
New Revision: 7ee863b8ebfad9249450dd283087042354a02939
URL: https://github.com/llvm/llvm-project/commit/7ee863b8ebfad9249450dd283087042354a02939
DIFF: https://github.com/llvm/llvm-project/commit/7ee863b8ebfad9249450dd283087042354a02939.diff
LOG: [Test] Add simplified versions of tests for loop deletion that don't need context
Added:
Modified:
llvm/test/Transforms/LoopDeletion/eval_first_iteration.ll
Removed:
################################################################################
diff --git a/llvm/test/Transforms/LoopDeletion/eval_first_iteration.ll b/llvm/test/Transforms/LoopDeletion/eval_first_iteration.ll
index 1cb98be580cd1..98dafebe0df02 100644
--- a/llvm/test/Transforms/LoopDeletion/eval_first_iteration.ll
+++ b/llvm/test/Transforms/LoopDeletion/eval_first_iteration.ll
@@ -337,3 +337,314 @@ done: ; preds = %backedge
failure:
unreachable
}
+
+; TODO: We can break the backedge here.
+define i32 @test_ne_const() {
+; CHECK-LABEL: @test_ne_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[BACKEDGE]], label [[IF_FALSE:%.*]]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[LOOP]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %backedge, label %if.false
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge: ; preds = %if.false, %loop
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %loop ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp ne i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
+
+; TODO: We can break the backedge here.
+define i32 @test_slt_const() {
+; CHECK-LABEL: @test_slt_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[BACKEDGE]], label [[IF_FALSE:%.*]]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[LOOP]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp slt i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %backedge, label %if.false
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge: ; preds = %if.false, %loop
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %loop ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp slt i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
+
+; TODO: We can break the backedge here.
+define i32 @test_ult_const() {
+; CHECK-LABEL: @test_ult_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[BACKEDGE]], label [[IF_FALSE:%.*]]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[LOOP]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ult i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %backedge, label %if.false
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge: ; preds = %if.false, %loop
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %loop ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp ult i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
+
+; TODO: We can break the backedge here.
+define i32 @test_sgt_const() {
+; CHECK-LABEL: @test_sgt_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[BACKEDGE]], label [[IF_FALSE:%.*]]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[LOOP]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp sgt i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %backedge, label %if.false
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge: ; preds = %if.false, %loop
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %loop ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp sgt i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
+
+; TODO: We can break the backedge here.
+define i32 @test_ugt_const() {
+; CHECK-LABEL: @test_ugt_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[BACKEDGE]], label [[IF_FALSE:%.*]]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[LOOP]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ugt i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %backedge, label %if.false
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge: ; preds = %if.false, %loop
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %loop ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp ugt i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
+
+; TODO: We can break the backedge here.
+define i32 @test_multiple_pred_const() {
+; CHECK-LABEL: @test_multiple_pred_const(
+; CHECK-NEXT: entry:
+; CHECK-NEXT: br label [[LOOP:%.*]]
+; CHECK: loop:
+; CHECK-NEXT: [[SUM:%.*]] = phi i32 [ 0, [[ENTRY:%.*]] ], [ [[SUM_NEXT:%.*]], [[BACKEDGE:%.*]] ]
+; CHECK-NEXT: [[SUB:%.*]] = sub i32 4, [[SUM]]
+; CHECK-NEXT: [[IS_POSITIVE:%.*]] = icmp sgt i32 [[SUB]], 0
+; CHECK-NEXT: br i1 [[IS_POSITIVE]], label [[IF_TRUE:%.*]], label [[IF_FALSE:%.*]]
+; CHECK: if.true:
+; CHECK-NEXT: switch i32 4, label [[FAILURE:%.*]] [
+; CHECK-NEXT: i32 100, label [[BACKEDGE]]
+; CHECK-NEXT: i32 200, label [[BACKEDGE]]
+; CHECK-NEXT: ]
+; CHECK: if.false:
+; CHECK-NEXT: br label [[BACKEDGE]]
+; CHECK: backedge:
+; CHECK-NEXT: [[MERGE_PHI:%.*]] = phi i32 [ 0, [[IF_FALSE]] ], [ [[SUB]], [[IF_TRUE]] ], [ [[SUB]], [[IF_TRUE]] ]
+; CHECK-NEXT: [[SUM_NEXT]] = add i32 [[SUM]], [[MERGE_PHI]]
+; CHECK-NEXT: [[LOOP_COND:%.*]] = icmp ne i32 [[SUM_NEXT]], 4
+; CHECK-NEXT: br i1 [[LOOP_COND]], label [[LOOP]], label [[DONE:%.*]]
+; CHECK: done:
+; CHECK-NEXT: [[SUM_NEXT_LCSSA:%.*]] = phi i32 [ [[SUM_NEXT]], [[BACKEDGE]] ]
+; CHECK-NEXT: ret i32 [[SUM_NEXT_LCSSA]]
+; CHECK: failure:
+; CHECK-NEXT: unreachable
+;
+entry:
+
+ br label %loop
+
+loop: ; preds = %backedge, %entry
+ %sum = phi i32 [ 0, %entry ], [ %sum.next, %backedge ]
+ %sub = sub i32 4, %sum
+ %is.positive = icmp sgt i32 %sub, 0
+ br i1 %is.positive, label %if.true, label %if.false
+
+if.true:
+ switch i32 4, label %failure [
+ i32 100, label %backedge
+ i32 200, label %backedge
+ ]
+
+if.false: ; preds = %loop
+ br label %backedge
+
+backedge:
+ %merge.phi = phi i32 [ 0, %if.false ], [ %sub, %if.true ], [ %sub, %if.true ]
+ %sum.next = add i32 %sum, %merge.phi
+ %loop.cond = icmp ne i32 %sum.next, 4
+ br i1 %loop.cond, label %loop, label %done
+
+done: ; preds = %backedge
+ %sum.next.lcssa = phi i32 [ %sum.next, %backedge ]
+ ret i32 %sum.next.lcssa
+
+failure:
+ unreachable
+}
More information about the llvm-commits
mailing list