RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 11:13:28 +01:00
Code Issues Projects Releases Wiki Activity
aa88690f46
llvm-mirror/test/Analysis/ScalarEvolution/trip-count9.ll
Nikita Popov fa8894df7b [SCEV] Strength nowrap flags after constant folding 
We should first try to constant fold the add expression and only
strengthen nowrap flags afterwards. This allows us to determine
stronger flags if e.g. only two operands are left after constant
folding (and thus "guaranteed no wrap region" code applies) or the
resulting operands are non-negative and thus nsw->nuw strengthening
applies.
2020-10-25 18:00:22 +01:00

530 lines
17 KiB
LLVM
Raw Blame History

; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt -analyze -enable-new-pm=0 -scalar-evolution -S -scalar-evolution-classify-expressions=0 < %s | FileCheck %s
; RUN: opt -disable-output "-passes=print<scalar-evolution>" -S -scalar-evolution-classify-expressions=0 < %s 2>&1 | FileCheck %s
; Every combination of
; - starting at 0, 1, or %x
; - steping by 1 or 2
; - stopping at %n or %n*2
; - using nsw, or not
; Some of these represent missed opportunities.
define void @foo(i4 %n) {
; CHECK-LABEL: 'foo'
; CHECK-NEXT: Determining loop execution counts for: @foo
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 6
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @step2(i4 %n) {
; CHECK-LABEL: 'step2'
; CHECK-NEXT: Determining loop execution counts for: @step2
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @start1(i4 %n) {
; CHECK-LABEL: 'start1'
; CHECK-NEXT: Determining loop execution counts for: @start1
; CHECK-NEXT: Loop %loop: backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: max backedge-taken count is 5
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @start1_step2(i4 %n) {
; CHECK-LABEL: 'start1_step2'
; CHECK-NEXT: Determining loop execution counts for: @start1_step2
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @startx(i4 %n, i4 %x) {
; CHECK-LABEL: 'startx'
; CHECK-NEXT: Determining loop execution counts for: @startx
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @startx_step2(i4 %n, i4 %x) {
; CHECK-LABEL: 'startx_step2'
; CHECK-NEXT: Determining loop execution counts for: @startx_step2
; CHECK-NEXT: Loop %loop: Unpredictable backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable max backedge-taken count.
; CHECK-NEXT: Loop %loop: Unpredictable predicated backedge-taken count.
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @nsw(i4 %n) {
; CHECK-LABEL: 'nsw'
; CHECK-NEXT: Determining loop execution counts for: @nsw
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + %n)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 6
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + %n)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
; If %n is INT4_MAX, %i.next will wrap. The nsw bit says that the
; result is undefined. Therefore, after the loop's second iteration,
; we are free to assume that the loop exits. This is valid because:
; (a) %i.next is a poison value after the second iteration, which can
; also be considered an undef value.
; (b) the return instruction enacts a side effect that is control
; dependent on the poison value.
;
define void @nsw_step2(i4 %n) {
; CHECK-LABEL: 'nsw_step2'
; CHECK-NEXT: Determining loop execution counts for: @nsw_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + %n) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @nsw_start1(i4 %n) {
; CHECK-LABEL: 'nsw_start1'
; CHECK-NEXT: Determining loop execution counts for: @nsw_start1
; CHECK-NEXT: Loop %loop: backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Loop %loop: max backedge-taken count is 5
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax %n))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @nsw_start1_step2(i4 %n) {
; CHECK-LABEL: 'nsw_start1_step2'
; CHECK-NEXT: Determining loop execution counts for: @nsw_start1_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (3 smax %n))<nsw> /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @nsw_startx(i4 %n, i4 %x) {
; CHECK-LABEL: 'nsw_startx'
; CHECK-NEXT: Determining loop execution counts for: @nsw_startx
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Loop %loop: max backedge-taken count is -1
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-LABEL: 'nsw_startx_step2'
; CHECK-NEXT: Determining loop execution counts for: @nsw_startx_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 7
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%s = icmp sgt i4 %n, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %n
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even(i4 %n) {
; CHECK-LABEL: 'even'
; CHECK-NEXT: Determining loop execution counts for: @even
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: max backedge-taken count is 5
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_step2(i4 %n) {
; CHECK-LABEL: 'even_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_start1(i4 %n) {
; CHECK-LABEL: 'even_start1'
; CHECK-NEXT: Determining loop execution counts for: @even_start1
; CHECK-NEXT: Loop %loop: backedge-taken count is (-2 + (2 smax (2 * %n)))<nsw>
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax (2 * %n)))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_start1_step2(i4 %n) {
; CHECK-LABEL: 'even_start1_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_start1_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-2 + (3 smax (2 * %n)))<nsw> /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (3 smax (2 * %n)))<nsw> /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_startx(i4 %n, i4 %x) {
; CHECK-LABEL: 'even_startx'
; CHECK-NEXT: Determining loop execution counts for: @even_startx
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: max backedge-taken count is -2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_startx_step2(i4 %n, i4 %x) {
; CHECK-LABEL: 'even_startx_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_startx_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 7
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw(i4 %n) {
; CHECK-LABEL: 'even_nsw'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Loop %loop: max backedge-taken count is 5
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (2 * %n))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 2
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw_step2(i4 %n) {
; CHECK-LABEL: 'even_nsw_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (2 * %n)) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 0, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw_start1(i4 %n) {
; CHECK-LABEL: 'even_nsw_start1'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw_start1
; CHECK-NEXT: Loop %loop: backedge-taken count is (-2 + (2 smax (2 * %n)))<nsw>
; CHECK-NEXT: Loop %loop: max backedge-taken count is 4
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-2 + (2 smax (2 * %n)))<nsw>
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw_start1_step2(i4 %n) {
; CHECK-LABEL: 'even_nsw_start1_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw_start1_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-2 + (3 smax (2 * %n)))<nsw> /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-2 + (3 smax (2 * %n)))<nsw> /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ 1, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw_startx(i4 %n, i4 %x) {
; CHECK-LABEL: 'even_nsw_startx'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw_startx
; CHECK-NEXT: Loop %loop: backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Loop %loop: max backedge-taken count is -2
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is (-1 + (-1 * %x) + ((1 + %x) smax (2 * %n)))
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 1
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
define void @even_nsw_startx_step2(i4 %n, i4 %x) {
; CHECK-LABEL: 'even_nsw_startx_step2'
; CHECK-NEXT: Determining loop execution counts for: @even_nsw_startx_step2
; CHECK-NEXT: Loop %loop: backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Loop %loop: max backedge-taken count is 7
; CHECK-NEXT: Loop %loop: Predicated backedge-taken count is ((-1 + (-1 * %x) + ((2 + %x) smax (2 * %n))) /u 2)
; CHECK-NEXT: Predicates:
; CHECK: Loop %loop: Trip multiple is 1
;
entry:
%m = shl i4 %n, 1
%s = icmp sgt i4 %m, 0
br i1 %s, label %loop, label %exit
loop:
%i = phi i4 [ %x, %entry ], [ %i.next, %loop ]
%i.next = add nsw i4 %i, 2
%t = icmp slt i4 %i.next, %m
br i1 %t, label %loop, label %exit
exit:
ret void
}
Reference in New Issue View Git Blame Copy Permalink