| Johannes Doerfert | f61df69 | 2015-10-04 14:56:08 +0000 | [diff] [blame^] | 1 | ; RUN: opt %loadPolly -basicaa -polly-detect-unprofitable -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-unprofitable -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-unprofitable -polly-detect -polly-allow-nonaffine -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true -analyze < %s | FileCheck %s --check-prefix=ALLOWNONAFFINELOOPSANDACCESSES |
| 4 | ; RUN: opt %loadPolly -basicaa -polly-detect -polly-allow-nonaffine -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true -analyze < %s | FileCheck %s --check-prefix=PROFIT |
| Johannes Doerfert | f8206cf | 2015-04-12 22:58:40 +0000 | [diff] [blame] | 5 | ; |
| 6 | ; Here we have a non-affine loop but also a non-affine access which should |
| 7 | ; be rejected as long as -polly-allow-nonaffine isn't given. |
| 8 | ; |
| 9 | ; REJECTNONAFFINELOOPS-NOT: Valid |
| 10 | ; ALLOWNONAFFINELOOPS-NOT: Valid |
| 11 | ; ALLOWNONAFFINELOOPSANDACCESSES: Valid Region for Scop: bb1 => bb13 |
| Johannes Doerfert | f61df69 | 2015-10-04 14:56:08 +0000 | [diff] [blame^] | 12 | ; PROFIT-NOT: Valid |
| Johannes Doerfert | f8206cf | 2015-04-12 22:58:40 +0000 | [diff] [blame] | 13 | ; |
| 14 | ; void f(int * restrict A, int * restrict C) { |
| 15 | ; int j; |
| 16 | ; for (int i = 0; i < 1024; i++) { |
| 17 | ; while ((j = C[i])) |
| 18 | ; A[j]++; |
| 19 | ; } |
| 20 | ; } |
| 21 | ; |
| 22 | target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" |
| 23 | |
| 24 | define void @f(i32* noalias %A, i32* noalias %C) { |
| 25 | bb: |
| 26 | br label %bb1 |
| 27 | |
| 28 | bb1: ; preds = %bb12, %bb |
| 29 | %indvars.iv = phi i64 [ %indvars.iv.next, %bb12 ], [ 0, %bb ] |
| 30 | %exitcond = icmp ne i64 %indvars.iv, 1024 |
| 31 | br i1 %exitcond, label %bb2, label %bb13 |
| 32 | |
| 33 | bb2: ; preds = %bb1 |
| 34 | br label %bb3 |
| 35 | |
| 36 | bb3: ; preds = %bb6, %bb2 |
| 37 | %tmp = getelementptr inbounds i32, i32* %C, i64 %indvars.iv |
| 38 | %tmp4 = load i32, i32* %tmp, align 4 |
| 39 | %tmp5 = icmp eq i32 %tmp4, 0 |
| 40 | br i1 %tmp5, label %bb11, label %bb6 |
| 41 | |
| 42 | bb6: ; preds = %bb3 |
| 43 | %tmp7 = sext i32 %tmp4 to i64 |
| 44 | %tmp8 = getelementptr inbounds i32, i32* %A, i64 %tmp7 |
| 45 | %tmp9 = load i32, i32* %tmp8, align 4 |
| 46 | %tmp10 = add nsw i32 %tmp9, 1 |
| 47 | store i32 %tmp10, i32* %tmp8, align 4 |
| 48 | br label %bb3 |
| 49 | |
| 50 | bb11: ; preds = %bb3 |
| 51 | br label %bb12 |
| 52 | |
| 53 | bb12: ; preds = %bb11 |
| 54 | %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 |
| 55 | br label %bb1 |
| 56 | |
| 57 | bb13: ; preds = %bb1 |
| 58 | ret void |
| 59 | } |