Mercurial > hg > CbC > CbC_llvm

annotate polly/test/ScopInfo/assume_gep_bounds.ll @ 252:1f2b6ac9f198 llvm-original

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
LLVM16-1
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Fri, 18 Aug 2023 09:04:13 +0900
parents c4bab56944e8
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
236
c4bab56944e8 LLVM 16
kono
parents: 150
diff changeset
1 ; RUN: opt %loadPolly -polly-print-scops -disable-output < %s | FileCheck %s
c4bab56944e8 LLVM 16
kono
parents: 150
diff changeset
2 ; RUN: opt %loadPolly -polly-print-function-scops -disable-output < %s | FileCheck %s
150
anatofuz
parents:
diff changeset
3
anatofuz
parents:
diff changeset
4 ; void foo(float A[][20][30], long n, long m, long p) {
anatofuz
parents:
diff changeset
5 ; for (long i = 0; i < n; i++)
anatofuz
parents:
diff changeset
6 ; for (long j = 0; j < m; j++)
anatofuz
parents:
diff changeset
7 ; for (long k = 0; k < p; k++)
anatofuz
parents:
diff changeset
8 ; A[i][j][k] = i + j + k;
anatofuz
parents:
diff changeset
9 ; }
anatofuz
parents:
diff changeset
10
anatofuz
parents:
diff changeset
11 ; For the above code we want to assume that all memory accesses are within the
anatofuz
parents:
diff changeset
12 ; bounds of the array A. In C (and LLVM-IR) this is not required, such that out
anatofuz
parents:
diff changeset
13 ; of bounds accesses are valid. However, as such accesses are uncommon, cause
anatofuz
parents:
diff changeset
14 ; complicated dependence pattern and as a result make dependence analysis more
anatofuz
parents:
diff changeset
15 ; costly and may prevent or hinder useful program transformations, we assume
anatofuz
parents:
diff changeset
16 ; absence of out-of-bound accesses. To do so we derive the set of parameter
anatofuz
parents:
diff changeset
17 ; values for which our assumption holds.
anatofuz
parents:
diff changeset
18
anatofuz
parents:
diff changeset
19 ; CHECK: Assumed Context
anatofuz
parents:
diff changeset
20 ; CHECK-NEXT: [n, m, p] -> { :
anatofuz
parents:
diff changeset
21 ; CHECK-DAG: p <= 30
anatofuz
parents:
diff changeset
22 ; CHECK-DAG: and
anatofuz
parents:
diff changeset
23 ; CHECK-DAG: m <= 20
anatofuz
parents:
diff changeset
24 ; CHECK: }
anatofuz
parents:
diff changeset
25
anatofuz
parents:
diff changeset
26 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
anatofuz
parents:
diff changeset
27
252
1f2b6ac9f198 LLVM16-1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 236
diff changeset
28 define void @foo(ptr %A, i64 %n, i64 %m, i64 %p) {
150
anatofuz
parents:
diff changeset
29 entry:
anatofuz
parents:
diff changeset
30 br label %for.cond
anatofuz
parents:
diff changeset
31
anatofuz
parents:
diff changeset
32 for.cond: ; preds = %for.inc13, %entry
anatofuz
parents:
diff changeset
33 %i.0 = phi i64 [ 0, %entry ], [ %inc14, %for.inc13 ]
anatofuz
parents:
diff changeset
34 %cmp = icmp slt i64 %i.0, %n
anatofuz
parents:
diff changeset
35 br i1 %cmp, label %for.body, label %for.end15
anatofuz
parents:
diff changeset
36
anatofuz
parents:
diff changeset
37 for.body: ; preds = %for.cond
anatofuz
parents:
diff changeset
38 br label %for.cond1
anatofuz
parents:
diff changeset
39
anatofuz
parents:
diff changeset
40 for.cond1: ; preds = %for.inc10, %for.body
anatofuz
parents:
diff changeset
41 %j.0 = phi i64 [ 0, %for.body ], [ %inc11, %for.inc10 ]
anatofuz
parents:
diff changeset
42 %cmp2 = icmp slt i64 %j.0, %m
anatofuz
parents:
diff changeset
43 br i1 %cmp2, label %for.body3, label %for.end12
anatofuz
parents:
diff changeset
44
anatofuz
parents:
diff changeset
45 for.body3: ; preds = %for.cond1
anatofuz
parents:
diff changeset
46 br label %for.cond4
anatofuz
parents:
diff changeset
47
anatofuz
parents:
diff changeset
48 for.cond4: ; preds = %for.inc, %for.body3
anatofuz
parents:
diff changeset
49 %k.0 = phi i64 [ 0, %for.body3 ], [ %inc, %for.inc ]
anatofuz
parents:
diff changeset
50 %cmp5 = icmp slt i64 %k.0, %p
anatofuz
parents:
diff changeset
51 br i1 %cmp5, label %for.body6, label %for.end
anatofuz
parents:
diff changeset
52
anatofuz
parents:
diff changeset
53 for.body6: ; preds = %for.cond4
anatofuz
parents:
diff changeset
54 %add = add nsw i64 %i.0, %j.0
anatofuz
parents:
diff changeset
55 %add7 = add nsw i64 %add, %k.0
anatofuz
parents:
diff changeset
56 %conv = sitofp i64 %add7 to float
252
1f2b6ac9f198 LLVM16-1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 236
diff changeset
57 %arrayidx9 = getelementptr inbounds [20 x [30 x float]], ptr %A, i64 %i.0, i64 %j.0, i64 %k.0
1f2b6ac9f198 LLVM16-1
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 236
diff changeset
58 store float %conv, ptr %arrayidx9, align 4
150
anatofuz
parents:
diff changeset
59 br label %for.inc
anatofuz
parents:
diff changeset
60
anatofuz
parents:
diff changeset
61 for.inc: ; preds = %for.body6
anatofuz
parents:
diff changeset
62 %inc = add nsw i64 %k.0, 1
anatofuz
parents:
diff changeset
63 br label %for.cond4
anatofuz
parents:
diff changeset
64
anatofuz
parents:
diff changeset
65 for.end: ; preds = %for.cond4
anatofuz
parents:
diff changeset
66 br label %for.inc10
anatofuz
parents:
diff changeset
67
anatofuz
parents:
diff changeset
68 for.inc10: ; preds = %for.end
anatofuz
parents:
diff changeset
69 %inc11 = add nsw i64 %j.0, 1
anatofuz
parents:
diff changeset
70 br label %for.cond1
anatofuz
parents:
diff changeset
71
anatofuz
parents:
diff changeset
72 for.end12: ; preds = %for.cond1
anatofuz
parents:
diff changeset
73 br label %for.inc13
anatofuz
parents:
diff changeset
74
anatofuz
parents:
diff changeset
75 for.inc13: ; preds = %for.end12
anatofuz
parents:
diff changeset
76 %inc14 = add nsw i64 %i.0, 1
anatofuz
parents:
diff changeset
77 br label %for.cond
anatofuz
parents:
diff changeset
78
anatofuz
parents:
diff changeset
79 for.end15: ; preds = %for.cond
anatofuz
parents:
diff changeset
80 ret void
anatofuz
parents:
diff changeset
81 }