416 lines
18 KiB
LLVM
416 lines
18 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
|
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
|
|
|
|
declare { i16, i1 } @llvm.sadd.with.overflow.i16(i16, i16) nounwind readnone
|
|
declare { i16, i1 } @llvm.uadd.with.overflow.i16(i16, i16) nounwind readnone
|
|
declare { i16, i1 } @llvm.ssub.with.overflow.i16(i16, i16) nounwind readnone
|
|
declare { i16, i1 } @llvm.usub.with.overflow.i16(i16, i16) nounwind readnone
|
|
declare { i16, i1 } @llvm.smul.with.overflow.i16(i16, i16) nounwind readnone
|
|
declare { i16, i1 } @llvm.umul.with.overflow.i16(i16, i16) nounwind readnone
|
|
|
|
define void @uadd_exhaustive() {
|
|
; CHECK-LABEL: 'uadd_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @uadd_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 35
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 35
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 35
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 35
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 36
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ 65500, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @sadd_exhaustive() {
|
|
; CHECK-LABEL: 'sadd_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @sadd_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 67
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 67
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 67
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 67
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 68
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ 32700, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @usub_exhaustive() {
|
|
; CHECK-LABEL: 'usub_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @usub_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 50
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 50
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 50
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 50
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 51
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ 50, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @ssub_exhaustive() {
|
|
; CHECK-LABEL: 'ssub_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @ssub_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 68
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 68
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 68
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 68
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 69
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ -32700, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @smul_exhaustive() {
|
|
; CHECK-LABEL: 'smul_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @smul_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 14
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 14
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 14
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 14
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 15
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @umul_exhaustive() {
|
|
; CHECK-LABEL: 'umul_exhaustive'
|
|
; CHECK-NEXT: Determining loop execution counts for: @umul_exhaustive
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is 15
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is 15
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is 15
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is 15
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 16
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ 1, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @uadd_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'uadd_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @uadd_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is (-1 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-1 + (-1 * %start))
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @sadd_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'sadd_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is (32767 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (32767 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (32767 + (-1 * %start))
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @sadd_symbolic_start2(i16 %start) {
|
|
; CHECK-LABEL: 'sadd_symbolic_start2'
|
|
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_start2
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
%not = xor i1 true, %ov
|
|
br i1 %not, label %for.body, label %for.end
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @sadd_symbolic_swapped(i16 %start) {
|
|
; CHECK-LABEL: 'sadd_symbolic_swapped'
|
|
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_swapped
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.body, label %for.end
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @usub_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'usub_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @usub_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is %start
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is %start
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is %start
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.usub.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @ssub_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'ssub_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @ssub_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: backedge-taken count is (-32768 + %start)
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-32768 + %start)
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is (-32768 + %start)
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.ssub.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @smul_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'smul_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @smul_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.smul.with.overflow.i16(i16 %indvars.iv, i16 2)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @umul_symbolic_start(i16 %start) {
|
|
; CHECK-LABEL: 'umul_symbolic_start'
|
|
; CHECK-NEXT: Determining loop execution counts for: @umul_symbolic_start
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable constant max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable symbolic max backedge-taken count.
|
|
; CHECK-NEXT: Loop %for.body: Unpredictable predicated backedge-taken count.
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.body ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.umul.with.overflow.i16(i16 %indvars.iv, i16 2)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
define void @sadd_symbolic_non_latch(i16 %start) {
|
|
; CHECK-LABEL: 'sadd_symbolic_non_latch'
|
|
; CHECK-NEXT: Determining loop execution counts for: @sadd_symbolic_non_latch
|
|
; CHECK-NEXT: Loop %for.body: <multiple exits> backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
|
|
; CHECK-NEXT: exit count for for.body: (32767 + (-1 * %start))
|
|
; CHECK-NEXT: exit count for for.latch: (230 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is -1
|
|
; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
|
|
; CHECK-NEXT: symbolic max exit count for for.body: (32767 + (-1 * %start))
|
|
; CHECK-NEXT: symbolic max exit count for for.latch: (230 + (-1 * %start))
|
|
; CHECK-NEXT: Loop %for.body: Predicated backedge-taken count is ((230 + (-1 * %start)) umin (32767 + (-1 * %start)))
|
|
; CHECK-NEXT: Predicates:
|
|
; CHECK: Loop %for.body: Trip multiple is 1
|
|
;
|
|
entry:
|
|
br i1 undef, label %for.end, label %for.body.preheader
|
|
|
|
for.body.preheader: ; preds = %entry
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body.preheader, %for.body
|
|
%indvars.iv = phi i16 [ %math, %for.latch ], [ %start, %for.body.preheader ]
|
|
%0 = call { i16, i1 } @llvm.sadd.with.overflow.i16(i16 %indvars.iv, i16 1)
|
|
%math = extractvalue { i16, i1 } %0, 0
|
|
%ov = extractvalue { i16, i1 } %0, 1
|
|
br i1 %ov, label %for.end, label %for.latch
|
|
|
|
for.latch:
|
|
%cmp = icmp eq i16 %math, 231
|
|
br i1 %cmp, label %for.end, label %for.body
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|