blob: 6140992b5183d6f0950352d807e06fcaff45e902 [file] [log] [blame]
Tobias Grosserf4ee3712015-10-06 15:36:44 +00001; RUN: opt %loadPolly -basicaa -polly-detect -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=false -analyze < %s | FileCheck %s --check-prefix=REJECTNONAFFINELOOPS
2; RUN: opt %loadPolly -basicaa -polly-detect -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true -analyze < %s | FileCheck %s --check-prefix=ALLOWNONAFFINELOOPS
3; RUN: opt %loadPolly -basicaa -polly-detect -polly-allow-nonaffine -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true -analyze < %s | FileCheck %s --check-prefix=ALLOWNONAFFINELOOPSANDACCESSES
Tobias Grosser575aca82015-10-06 16:10:29 +00004; RUN: opt %loadPolly -basicaa -polly-detect -polly-process-unprofitable=false \
Tobias Grosser935f62c2015-10-06 15:19:35 +00005; RUN: -polly-allow-nonaffine -polly-allow-nonaffine-branches \
6; RUN: -polly-allow-nonaffine-loops=true -analyze < %s \
7; RUN: | FileCheck %s --check-prefix=PROFIT
Johannes Doerfertf8206cf2015-04-12 22:58:40 +00008;
9; Here we have a non-affine loop but also a non-affine access which should
10; be rejected as long as -polly-allow-nonaffine isn't given.
11;
12; REJECTNONAFFINELOOPS-NOT: Valid
13; ALLOWNONAFFINELOOPS-NOT: Valid
14; ALLOWNONAFFINELOOPSANDACCESSES: Valid Region for Scop: bb1 => bb13
Johannes Doerfertf61df692015-10-04 14:56:08 +000015; PROFIT-NOT: Valid
Johannes Doerfertf8206cf2015-04-12 22:58:40 +000016;
17; void f(int * restrict A, int * restrict C) {
Johannes Doerfert09e36972015-10-07 20:17:36 +000018; int j = 0;
Johannes Doerfertf8206cf2015-04-12 22:58:40 +000019; for (int i = 0; i < 1024; i++) {
Johannes Doerfert09e36972015-10-07 20:17:36 +000020; while ((j = C[j]))
Johannes Doerfertf8206cf2015-04-12 22:58:40 +000021; A[j]++;
22; }
23; }
24;
25target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
26
27define void @f(i32* noalias %A, i32* noalias %C) {
28bb:
29 br label %bb1
30
31bb1: ; preds = %bb12, %bb
32 %indvars.iv = phi i64 [ %indvars.iv.next, %bb12 ], [ 0, %bb ]
33 %exitcond = icmp ne i64 %indvars.iv, 1024
34 br i1 %exitcond, label %bb2, label %bb13
35
36bb2: ; preds = %bb1
37 br label %bb3
38
39bb3: ; preds = %bb6, %bb2
Johannes Doerfert09e36972015-10-07 20:17:36 +000040 %indvars.j = phi i32 [ %tmp4, %bb6 ], [ 0, %bb2 ]
41 %tmp = getelementptr inbounds i32, i32* %C, i32 %indvars.j
Johannes Doerfertf8206cf2015-04-12 22:58:40 +000042 %tmp4 = load i32, i32* %tmp, align 4
43 %tmp5 = icmp eq i32 %tmp4, 0
44 br i1 %tmp5, label %bb11, label %bb6
45
46bb6: ; preds = %bb3
47 %tmp7 = sext i32 %tmp4 to i64
48 %tmp8 = getelementptr inbounds i32, i32* %A, i64 %tmp7
49 %tmp9 = load i32, i32* %tmp8, align 4
50 %tmp10 = add nsw i32 %tmp9, 1
51 store i32 %tmp10, i32* %tmp8, align 4
52 br label %bb3
53
54bb11: ; preds = %bb3
55 br label %bb12
56
57bb12: ; preds = %bb11
58 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
59 br label %bb1
60
61bb13: ; preds = %bb1
62 ret void
63}