llvm-6502/test/Analysis/DependenceAnalysis/ExactRDIV.ll
Sebastian Pop ad43499fc4 dependence analysis
Patch from Preston Briggs <preston.briggs@gmail.com>.

This is an updated version of the dependence-analysis patch, including an MIV
test based on Banerjee's inequalities.

It's a fairly complete implementation of the paper

    Practical Dependence Testing
    Gina Goff, Ken Kennedy, and Chau-Wen Tseng
    PLDI 1991

It cannot yet propagate constraints between coupled RDIV subscripts (discussed
in Section 5.3.2 of the paper).

It's organized as a FunctionPass with a single entry point that supports testing
for dependence between two instructions in a function. If there's no dependence,
it returns null. If there's a dependence, it returns a pointer to a Dependence
which can be queried about details (what kind of dependence, is it loop
independent, direction and distance vector entries, etc). I haven't included
every imaginable feature, but there's a good selection that should be adequate
for supporting many loop transformations. Of course, it can be extended as
necessary.

Included in the patch file are many test cases, commented with C code showing
the loops and array references.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@165708 91177308-0d34-0410-b5e6-96231b3b80d8
2012-10-11 07:32:34 +00:00

509 lines
18 KiB
LLVM

; RUN: opt < %s -analyze -basicaa -da | FileCheck %s
; ModuleID = 'ExactRDIV.bc'
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
target triple = "x86_64-apple-macosx10.6.0"
;; for (long int i = 0; i < 10; i++)
;; A[4*i + 10] = ...
;; for (long int j = 0; j < 10; j++)
;; ... = A[2*j + 1];
define void @rdiv0(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = shl nsw i64 %i.03, 2
%add = add nsw i64 %mul, 10
%arrayidx = getelementptr inbounds i32* %A, i64 %add
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 10
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc9, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%mul5 = shl nsw i64 %j.02, 1
%add64 = or i64 %mul5, 1
%arrayidx7 = getelementptr inbounds i32* %A, i64 %add64
%0 = load i32* %arrayidx7, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc9 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc9, 10
br i1 %cmp2, label %for.body4, label %for.end10
for.end10: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i < 5; i++)
;; A[11*i - 45] = ...
;; for (long int j = 0; j < 10; j++)
;; ... = A[j];
define void @rdiv1(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = add nsw i64 %mul, -45
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 5
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%arrayidx5 = getelementptr inbounds i32* %A, i64 %j.02
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 10
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i <= 5; i++)
;; A[11*i - 45] = ...
;; for (long int j = 0; j < 10; j++)
;; ... = A[j];
define void @rdiv2(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = add nsw i64 %mul, -45
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 6
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%arrayidx5 = getelementptr inbounds i32* %A, i64 %j.02
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 10
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i < 5; i++)
;; A[11*i - 45] = ...
;; for (long int j = 0; j <= 10; j++)
;; ... = A[j];
define void @rdiv3(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = add nsw i64 %mul, -45
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 5
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%arrayidx5 = getelementptr inbounds i32* %A, i64 %j.02
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 11
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i <= 5; i++)
;; A[11*i - 45] = ...
;; for (long int j = 0; j <= 10; j++)
;; ... = A[j];
define void @rdiv4(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = add nsw i64 %mul, -45
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 6
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%arrayidx5 = getelementptr inbounds i32* %A, i64 %j.02
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - flow!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 11
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i < 5; i++)
;; A[-11*i + 45] = ...
;; for (long int j = 0; j < 10; j++)
;; ... = A[-j];
define void @rdiv5(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, -11
%add = add nsw i64 %mul, 45
%arrayidx = getelementptr inbounds i32* %A, i64 %add
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 5
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%sub = sub nsw i64 0, %j.02
%arrayidx5 = getelementptr inbounds i32* %A, i64 %sub
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 10
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i <= 5; i++)
;; A[-11*i + 45] = ...
;; for (long int j = 0; j < 10; j++)
;; ... = A[-j];
define void @rdiv6(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, -11
%add = add nsw i64 %mul, 45
%arrayidx = getelementptr inbounds i32* %A, i64 %add
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 6
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%sub = sub nsw i64 0, %j.02
%arrayidx5 = getelementptr inbounds i32* %A, i64 %sub
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 10
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i < 5; i++)
;; A[-11*i + 45] = ...
;; for (long int j = 0; j <= 10; j++)
;; ... = A[-j];
define void @rdiv7(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, -11
%add = add nsw i64 %mul, 45
%arrayidx = getelementptr inbounds i32* %A, i64 %add
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 5
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%sub = sub nsw i64 0, %j.02
%arrayidx5 = getelementptr inbounds i32* %A, i64 %sub
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 11
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i <= 5; i++)
;; A[-11*i + 45] = ...
;; for (long int j = 0; j <= 10; j++)
;; ... = A[-j];
define void @rdiv8(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.body
for.body: ; preds = %for.body, %entry
%i.03 = phi i64 [ 0, %entry ], [ %inc, %for.body ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, -11
%add = add nsw i64 %mul, 45
%arrayidx = getelementptr inbounds i32* %A, i64 %add
store i32 %conv, i32* %arrayidx, align 4
%inc = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc, 6
br i1 %cmp, label %for.body, label %for.body4
for.body4: ; preds = %for.body4, %for.body
%j.02 = phi i64 [ %inc7, %for.body4 ], [ 0, %for.body ]
%B.addr.01 = phi i32* [ %incdec.ptr, %for.body4 ], [ %B, %for.body ]
%sub = sub nsw i64 0, %j.02
%arrayidx5 = getelementptr inbounds i32* %A, i64 %sub
%0 = load i32* %arrayidx5, align 4
; CHECK: da analyze - flow!
%incdec.ptr = getelementptr inbounds i32* %B.addr.01, i64 1
store i32 %0, i32* %B.addr.01, align 4
%inc7 = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc7, 11
br i1 %cmp2, label %for.body4, label %for.end8
for.end8: ; preds = %for.body4
ret void
}
;; for (long int i = 0; i < 5; i++)
;; for (long int j = 0; j < 10; j++)
;; A[11*i - j] = ...
;; ... = A[45];
define void @rdiv9(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.cond1.preheader
for.cond1.preheader: ; preds = %for.inc5, %entry
%B.addr.04 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.inc5 ]
%i.03 = phi i64 [ 0, %entry ], [ %inc6, %for.inc5 ]
br label %for.body3
for.body3: ; preds = %for.body3, %for.cond1.preheader
%j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
%B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = sub nsw i64 %mul, %j.02
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%arrayidx4 = getelementptr inbounds i32* %A, i64 45
%0 = load i32* %arrayidx4, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.11, i64 1
store i32 %0, i32* %B.addr.11, align 4
%inc = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc, 10
br i1 %cmp2, label %for.body3, label %for.inc5
for.inc5: ; preds = %for.body3
%inc6 = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc6, 5
br i1 %cmp, label %for.cond1.preheader, label %for.end7
for.end7: ; preds = %for.inc5
ret void
}
;; for (long int i = 0; i < 5; i++)
;; for (long int j = 0; j <= 10; j++)
;; A[11*i - j] = ...
;; ... = A[45];
define void @rdiv10(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.cond1.preheader
for.cond1.preheader: ; preds = %for.inc5, %entry
%B.addr.04 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.inc5 ]
%i.03 = phi i64 [ 0, %entry ], [ %inc6, %for.inc5 ]
br label %for.body3
for.body3: ; preds = %for.body3, %for.cond1.preheader
%j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
%B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = sub nsw i64 %mul, %j.02
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%arrayidx4 = getelementptr inbounds i32* %A, i64 45
%0 = load i32* %arrayidx4, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.11, i64 1
store i32 %0, i32* %B.addr.11, align 4
%inc = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc, 10
br i1 %cmp2, label %for.body3, label %for.inc5
for.inc5: ; preds = %for.body3
%inc6 = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc6, 6
br i1 %cmp, label %for.cond1.preheader, label %for.end7
for.end7: ; preds = %for.inc5
ret void
}
;; for (long int i = 0; i <= 5; i++)
;; for (long int j = 0; j <= 10; j++)
;; A[11*i - j] = ...
;; ... = A[45];
define void @rdiv11(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.cond1.preheader
for.cond1.preheader: ; preds = %for.inc5, %entry
%B.addr.04 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.inc5 ]
%i.03 = phi i64 [ 0, %entry ], [ %inc6, %for.inc5 ]
br label %for.body3
for.body3: ; preds = %for.body3, %for.cond1.preheader
%j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
%B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = sub nsw i64 %mul, %j.02
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%arrayidx4 = getelementptr inbounds i32* %A, i64 45
%0 = load i32* %arrayidx4, align 4
; CHECK: da analyze - none!
%incdec.ptr = getelementptr inbounds i32* %B.addr.11, i64 1
store i32 %0, i32* %B.addr.11, align 4
%inc = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc, 11
br i1 %cmp2, label %for.body3, label %for.inc5
for.inc5: ; preds = %for.body3
%inc6 = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc6, 5
br i1 %cmp, label %for.cond1.preheader, label %for.end7
for.end7: ; preds = %for.inc5
ret void
}
;; for (long int i = 0; i < 5; i++)
;; for (long int j = 0; j < 10; j++)
;; A[11*i - j] = ...
;; ... = A[45];
define void @rdiv12(i32* %A, i32* %B) nounwind uwtable ssp {
entry:
br label %for.cond1.preheader
for.cond1.preheader: ; preds = %for.inc5, %entry
%B.addr.04 = phi i32* [ %B, %entry ], [ %incdec.ptr, %for.inc5 ]
%i.03 = phi i64 [ 0, %entry ], [ %inc6, %for.inc5 ]
br label %for.body3
for.body3: ; preds = %for.body3, %for.cond1.preheader
%j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
%B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
%conv = trunc i64 %i.03 to i32
%mul = mul nsw i64 %i.03, 11
%sub = sub nsw i64 %mul, %j.02
%arrayidx = getelementptr inbounds i32* %A, i64 %sub
store i32 %conv, i32* %arrayidx, align 4
%arrayidx4 = getelementptr inbounds i32* %A, i64 45
%0 = load i32* %arrayidx4, align 4
; CHECK: da analyze - flow [* *|<]!
%incdec.ptr = getelementptr inbounds i32* %B.addr.11, i64 1
store i32 %0, i32* %B.addr.11, align 4
%inc = add nsw i64 %j.02, 1
%cmp2 = icmp slt i64 %inc, 11
br i1 %cmp2, label %for.body3, label %for.inc5
for.inc5: ; preds = %for.body3
%inc6 = add nsw i64 %i.03, 1
%cmp = icmp slt i64 %inc6, 6
br i1 %cmp, label %for.cond1.preheader, label %for.end7
for.end7: ; preds = %for.inc5
ret void
}