6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-25 13:24:46 +00:00
Code Issues Projects Releases Wiki Activity

[LoopAccesses] Add -analyze support

Browse Source 
The LoopInfo in combination with depth_first is used to enumerate the
loops.

Right now -analyze is not yet complete.  It only prints the result of
the analysis, the report and the run-time checks.  Printing the unsafe
depedences will require a bit more reshuffling which I'd like to do in a
follow-on to this patchset.  Unsafe dependences are currently checked
via -debug-only=loop-accesses in the new test.

This is part of the patchset that converts LoopAccessAnalysis into an
actual analysis pass.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@229633 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Adam Nemet
2015-02-18 03:44:30 +00:00
parent c548c640bc
commit f367b60abe
4 changed files with 184 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

60
test/Analysis/LoopAccessAnalysis/unsafe-and-rt-checks-no-dbg.ll Normal file
View File

@@ -0,0 +1,60 @@
; RUN: opt -loop-accesses -analyze < %s | FileCheck %s
; FIXME: This is the non-debug version of unsafe-and-rt-checks.ll not
; requiring "asserts". Once we can check memory dependences without -debug,
; we should remove this test.
; Analyze this loop:
; for (i = 0; i < n; i++)
; A[i + 1] = A[i] * B[i] * C[i];
target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-apple-macosx10.10.0"
; CHECK: Report: unsafe dependent memory operations in loop
; CHECK: Run-time memory checks:
; CHECK-NEXT: 0:
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
; CHECK-NEXT: %arrayidxB = getelementptr inbounds i16* %b, i64 %storemerge3
; CHECK-NEXT: 1:
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
; CHECK-NEXT: %arrayidxC = getelementptr inbounds i16* %c, i64 %storemerge3
@n = global i32 20, align 4
@B = common global i16* null, align 8
@A = common global i16* null, align 8
@C = common global i16* null, align 8
define void @f() {
entry:
%a = load i16** @A, align 8
%b = load i16** @B, align 8
%c = load i16** @C, align 8
br label %for.body
for.body: ; preds = %for.body, %entry
%storemerge3 = phi i64 [ 0, %entry ], [ %add, %for.body ]
%arrayidxA = getelementptr inbounds i16* %a, i64 %storemerge3
%loadA = load i16* %arrayidxA, align 2
%arrayidxB = getelementptr inbounds i16* %b, i64 %storemerge3
%loadB = load i16* %arrayidxB, align 2
%arrayidxC = getelementptr inbounds i16* %c, i64 %storemerge3
%loadC = load i16* %arrayidxC, align 2
%mul = mul i16 %loadB, %loadA
%mul1 = mul i16 %mul, %loadC
%add = add nuw nsw i64 %storemerge3, 1
%arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
store i16 %mul1, i16* %arrayidxA_plus_2, align 2
%exitcond = icmp eq i64 %add, 20
br i1 %exitcond, label %for.end, label %for.body
for.end: ; preds = %for.body
ret void
}

61
test/Analysis/LoopAccessAnalysis/unsafe-and-rt-checks.ll Normal file
View File

@@ -0,0 +1,61 @@
; RUN: opt -loop-accesses -analyze < %s | FileCheck %s
; RUN: opt -loop-accesses -analyze -debug-only=loop-accesses < %s 2>&1 | FileCheck %s --check-prefix=DEBUG
; REQUIRES: asserts
; Analyze this loop:
; for (i = 0; i < n; i++)
; A[i + 1] = A[i] * B[i] * C[i];
target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-apple-macosx10.10.0"
; CHECK: Report: unsafe dependent memory operations in loop
; DEBUG: LAA: Distance for %loadA = load i16* %arrayidxA, align 2 to store i16 %mul1, i16* %arrayidxA_plus_2, align 2: 2
; DEBUG-NEXT: LAA: Failure because of Positive distance 2
; CHECK: Run-time memory checks:
; CHECK-NEXT: 0:
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
; CHECK-NEXT: %arrayidxB = getelementptr inbounds i16* %b, i64 %storemerge3
; CHECK-NEXT: 1:
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
; CHECK-NEXT: %arrayidxC = getelementptr inbounds i16* %c, i64 %storemerge3
@n = global i32 20, align 4
@B = common global i16* null, align 8
@A = common global i16* null, align 8
@C = common global i16* null, align 8
define void @f() {
entry:
%a = load i16** @A, align 8
%b = load i16** @B, align 8
%c = load i16** @C, align 8
br label %for.body
for.body: ; preds = %for.body, %entry
%storemerge3 = phi i64 [ 0, %entry ], [ %add, %for.body ]
%arrayidxA = getelementptr inbounds i16* %a, i64 %storemerge3
%loadA = load i16* %arrayidxA, align 2
%arrayidxB = getelementptr inbounds i16* %b, i64 %storemerge3
%loadB = load i16* %arrayidxB, align 2
%arrayidxC = getelementptr inbounds i16* %c, i64 %storemerge3
%loadC = load i16* %arrayidxC, align 2
%mul = mul i16 %loadB, %loadA
%mul1 = mul i16 %mul, %loadC
%add = add nuw nsw i64 %storemerge3, 1
%arrayidxA_plus_2 = getelementptr inbounds i16* %a, i64 %add
store i16 %mul1, i16* %arrayidxA_plus_2, align 2
%exitcond = icmp eq i64 %add, 20
br i1 %exitcond, label %for.end, label %for.body
for.end: ; preds = %for.body
ret void
}