mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2026-04-25 21:18:19 +00:00
Silviu Baranga
f283cd9acf
Summary: The checking pointer group construction algorithm relied on the iteration on DepCands. We would need the same leaders across runs and the same iteration order over the underlying std::set for determinism. This changes the algorithm to process the pointers in the order in which they were added to the runtime check, which is deterministic. We need to update the tests, since the order in which pointers appear has changed. No new tests were added, since it is impossible to test for non-determinism. Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D11064 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@241809 91177308-0d34-0410-b5e6-96231b3b80d8
65 lines
2.3 KiB
LLVM
65 lines
2.3 KiB
LLVM
; RUN: opt -loop-accesses -analyze < %s | FileCheck %s
|
|
|
|
; 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-NEXT: Interesting Dependences:
|
|
; CHECK-NEXT: Backward:
|
|
; CHECK-NEXT: %loadA = load i16, i16* %arrayidxA, align 2 ->
|
|
; CHECK-NEXT: store i16 %mul1, i16* %arrayidxA_plus_2, align 2
|
|
; CHECK: Run-time memory checks:
|
|
; CHECK-NEXT: 0:
|
|
; CHECK-NEXT: Comparing group
|
|
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16, i16* %a, i64 %add
|
|
; CHECK-NEXT: %arrayidxA = getelementptr inbounds i16, i16* %a, i64 %storemerge3
|
|
; CHECK-NEXT: Against group
|
|
; CHECK-NEXT: %arrayidxB = getelementptr inbounds i16, i16* %b, i64 %storemerge3
|
|
; CHECK-NEXT: 1:
|
|
; CHECK-NEXT: Comparing group
|
|
; CHECK-NEXT: %arrayidxA_plus_2 = getelementptr inbounds i16, i16* %a, i64 %add
|
|
; CHECK-NEXT: %arrayidxA = getelementptr inbounds i16, i16* %a, i64 %storemerge3
|
|
; CHECK-NEXT: Against group
|
|
; CHECK-NEXT: %arrayidxC = getelementptr inbounds i16, i16* %c, i64 %storemerge3
|
|
|
|
@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*, i16** @A, align 8
|
|
%b = load i16*, i16** @B, align 8
|
|
%c = load i16*, 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, i16* %a, i64 %storemerge3
|
|
%loadA = load i16, i16* %arrayidxA, align 2
|
|
|
|
%arrayidxB = getelementptr inbounds i16, i16* %b, i64 %storemerge3
|
|
%loadB = load i16, i16* %arrayidxB, align 2
|
|
|
|
%arrayidxC = getelementptr inbounds i16, i16* %c, i64 %storemerge3
|
|
%loadC = load i16, 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, 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
|
|
}
|