File: non-affine-loop.ll

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (50 lines) | stat: -rw-r--r-- 2,723 bytes parent folder | download | duplicates (5)
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-allow-nonaffine-branches -polly-allow-nonaffine-loops=false                                                          -polly-print-detect -disable-output < %s | FileCheck %s --check-prefix=REJECTNONAFFINELOOPS
; RUN: opt %loadPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true                                                           -polly-print-detect -disable-output < %s | FileCheck %s --check-prefix=ALLOWNONAFFINELOOPS
; RUN: opt %loadPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=false -polly-allow-nonaffine                                   -polly-print-detect -disable-output < %s | FileCheck %s --check-prefix=ALLOWNONAFFINEREGIONSANDACCESSES
; RUN: opt %loadPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true  -polly-allow-nonaffine                                   -polly-print-detect -disable-output < %s | FileCheck %s --check-prefix=ALLOWNONAFFINELOOPSANDACCESSES
; RUN: opt %loadPolly -polly-allow-nonaffine-branches -polly-allow-nonaffine-loops=true  -polly-allow-nonaffine -polly-process-unprofitable=false -polly-print-detect -disable-output < %s | FileCheck %s --check-prefix=PROFIT
;
; This function/region does contain a loop, however it is non-affine, hence the access
; A[i] is also. Furthermore, it is the only loop, thus when we over approximate
; non-affine loops __and__ accesses __and__ allow regions without a (affine) loop we will
; detect it, otherwise we won't.
;
;    void f(int *A) {
;      for (int i = 0; i < A[i]; i++)
;        A[-1]++;
;    }
;
; REJECTNONAFFINELOOPS-NOT:              Valid
; ALLOWNONAFFINELOOPS-NOT:               Valid
; ALLOWNONAFFINEREGIONSANDACCESSES-NOT:  Valid
; ALLOWNONAFFINELOOPSANDACCESSES:        Valid
; PROFIT-NOT:                            Valid
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"

define void @f(ptr %A) {
bb:
  br label %bb1

bb1:                                              ; preds = %bb9, %bb
  %indvars.iv = phi i64 [ %indvars.iv.next, %bb9 ], [ 0, %bb ]
  %tmp = getelementptr inbounds i32, ptr %A, i64 %indvars.iv
  %tmp2 = load i32, ptr %tmp, align 4
  %tmp3 = sext i32 %tmp2 to i64
  %tmp4 = icmp slt i64 %indvars.iv, %tmp3
  br i1 %tmp4, label %bb5, label %bb10

bb5:                                              ; preds = %bb1
  %tmp6 = getelementptr inbounds i32, ptr %A, i64 -1
  %tmp7 = load i32, ptr %tmp6, align 4
  %tmp8 = add nsw i32 %tmp7, 1
  store i32 %tmp8, ptr %tmp6, align 4
  br label %bb9

bb9:                                              ; preds = %bb5
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  br label %bb1

bb10:                                             ; preds = %bb1
  ret void
}