Differential D86844 Diff 308249 llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll

Changeset View

Standalone View

	; RUN: opt < %s -loop-deletion -S \| FileCheck %s			; RUN: opt < %s -loop-deletion -S \| FileCheck %s
	; RUN: opt < %s -passes='loop(loop-deletion)' -S \| FileCheck %s			; RUN: opt < %s -passes='loop(loop-deletion)' -S \| FileCheck %s

	; ScalarEvolution can prove the loop iteration is finite, even though			; ScalarEvolution can prove the loop iteration is finite, even though
	; it can't represent the exact trip count as an expression. That's			; it can't represent the exact trip count as an expression. That's
	; good enough to let the loop be deleted.			; good enough to let the loop be deleted.

	; CHECK: entry:			; CHECK: entry:
	; CHECK-NEXT: br label %return			; CHECK-NEXT: br label %return

	; CHECK: return:			; CHECK: return:
	; CHECK-NEXT: ret void			; CHECK-NEXT: ret void

	define void @foo(i64 %n, i64 %m) nounwind {			define void @foo(i64 %n, i64 %m) nounwind willreturn {
	entry:			entry:
	br label %bb			br label %bb

	bb:			bb:
	%x.0 = phi i64 [ 0, %entry ], [ %t0, %bb ]			%x.0 = phi i64 [ 0, %entry ], [ %t0, %bb ]
	%t0 = add i64 %x.0, 1			%t0 = add i64 %x.0, 1
	%t1 = icmp slt i64 %x.0, %n			%t1 = icmp slt i64 %x.0, %n
	%t3 = icmp sgt i64 %x.0, %m			%t3 = icmp sgt i64 %x.0, %m
	%t4 = and i1 %t1, %t3			%t4 = and i1 %t1, %t3
	br i1 %t4, label %bb, label %return			br i1 %t4, label %bb, label %return

	return:			return:
	ret void			ret void
	}			}