mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
495950222a
First step after e1133179587dd895962a2fe4d6eb0cb1e63b5ee2, in these tests, DomTree is valid afterwards, so mark them as such, so that they don't regress. In further steps, SimplifyCFG transforms shall taught to preserve DomTree, in as small steps as possible.
46 lines
1.4 KiB
LLVM
46 lines
1.4 KiB
LLVM
; These tests have an infinite trip count. We obviously shouldn't remove the
|
|
; loops! :)
|
|
;
|
|
; RUN: opt < %s -indvars -adce -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
|
|
|
|
;; test for (i = 1; i != 100; i += 2)
|
|
define i32 @infinite_linear() {
|
|
; CHECK-LABEL: @infinite_linear(
|
|
entry:
|
|
br label %loop
|
|
|
|
loop: ; preds = %loop, %entry
|
|
; CHECK-LABEL: loop:
|
|
%i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
|
|
%i.next = add i32 %i, 2 ; <i32> [#uses=1]
|
|
%c = icmp ne i32 %i, 100 ; <i1> [#uses=1]
|
|
; CHECK: icmp
|
|
; CHECK: br
|
|
br i1 %c, label %loop, label %loopexit
|
|
|
|
loopexit: ; preds = %loop
|
|
; CHECK-LABEL: loopexit:
|
|
ret i32 %i
|
|
}
|
|
|
|
;; test for (i = 1; i*i != 63; ++i)
|
|
define i32 @infinite_quadratic() {
|
|
; CHECK-LABEL: @infinite_quadratic(
|
|
entry:
|
|
br label %loop
|
|
|
|
loop: ; preds = %loop, %entry
|
|
; CHECK-LABEL: loop:
|
|
%i = phi i32 [ 1, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4]
|
|
%isquare = mul i32 %i, %i ; <i32> [#uses=1]
|
|
%i.next = add i32 %i, 1 ; <i32> [#uses=1]
|
|
%c = icmp ne i32 %isquare, 63 ; <i1> [#uses=1]
|
|
; CHECK: icmp
|
|
; CHECK: br
|
|
br i1 %c, label %loop, label %loopexit
|
|
|
|
loopexit: ; preds = %loop
|
|
; CHECK-LABEL: loopexit:
|
|
ret i32 %i
|
|
}
|