branch-references-loop-scev-with-unknown-iterations.ll
1.77 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
; RUN: opt %loadPolly -polly-scops -analyze < %s | \
; RUN: FileCheck %s -check-prefix=NONAFFINE
; RUN: opt %loadPolly -polly-scops -analyze \
; RUN: -polly-allow-nonaffine-branches=false < %s | \
; RUN: FileCheck %s -check-prefix=NO-NONEAFFINE
; NONAFFINE-NOT: Statements
; NO-NONEAFFINE: Statements {
; NO-NONEAFFINE-NEXT: Stmt_then
; NO-NONEAFFINE-NEXT: Domain :=
; NO-NONEAFFINE-NEXT: [p_0] -> { Stmt_then[] : p_0 <= -2 or p_0 >= 0 };
; NO-NONEAFFINE-NEXT: Schedule :=
; NO-NONEAFFINE-NEXT: [p_0] -> { Stmt_then[] -> [] };
; NO-NONEAFFINE-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; NO-NONEAFFINE-NEXT: [p_0] -> { Stmt_then[] -> MemRef_A[0] };
; NO-NONEAFFINE-NEXT: }
; Verify that this test case does not crash -polly-scops. The problem in
; this test case is that the branch instruction in %branch references
; a scalar evolution expression for which no useful value can be computed at the
; location %branch, as the loop %loop does not terminate. At some point, we
; did not identify the branch condition as non-affine during scop detection.
; This test verifies that we either model the branch condition as non-affine
; region (and return an empty scop) or only detect a smaller region if
; non-affine conditions are not allowed.
target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"
target triple = "aarch64--linux-android"
define void @f(i16 %event, float* %A) {
entry:
br label %loop
loop:
%indvar = phi i8 [ 0, %entry ], [ %indvar.next, %loop ]
%indvar.next = add i8 %indvar, 1
%cmp = icmp eq i8 %indvar.next, 0
br i1 false, label %branch, label %loop
branch:
br i1 %cmp, label %end, label %then
then:
store float 1.0, float* %A
br label %end
end:
ret void
}