mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-13 23:18:51 +00:00
d8c5ecbd82
This patch fixes the non-determinism caused due to iterating SmallPtrSet's which was uncovered due to the experimental "reverse iteration order " patch: https://reviews.llvm.org/D26718 The following unit tests failed because of the undefined order of iteration. LLVM :: Transforms/Util/MemorySSA/cyclicphi.ll LLVM :: Transforms/Util/MemorySSA/many-dom-backedge.ll LLVM :: Transforms/Util/MemorySSA/many-doms.ll LLVM :: Transforms/Util/MemorySSA/phi-translation.ll Reviewers: dberlin, mgrang Subscribers: dberlin, llvm-commits, david2050 Differential Revision: https://reviews.llvm.org/D26704 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@287563 91177308-0d34-0410-b5e6-96231b3b80d8
124 lines
4.7 KiB
LLVM
124 lines
4.7 KiB
LLVM
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
|
|
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
|
|
|
|
%struct.hoge = type { i32, %struct.widget }
|
|
%struct.widget = type { i64 }
|
|
|
|
define hidden void @quux(%struct.hoge *%f) align 2 {
|
|
%tmp = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1, i32 0
|
|
%tmp24 = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1
|
|
%tmp25 = bitcast %struct.widget* %tmp24 to i64**
|
|
br label %bb26
|
|
|
|
bb26: ; preds = %bb77, %0
|
|
; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3})
|
|
; CHECK-NEXT: br i1 undef, label %bb68, label %bb77
|
|
br i1 undef, label %bb68, label %bb77
|
|
|
|
bb68: ; preds = %bb26
|
|
; CHECK: MemoryUse(liveOnEntry)
|
|
; CHECK-NEXT: %tmp69 = load i64, i64* null, align 8
|
|
%tmp69 = load i64, i64* null, align 8
|
|
; CHECK: 1 = MemoryDef(2)
|
|
; CHECK-NEXT: store i64 %tmp69, i64* %tmp, align 8
|
|
store i64 %tmp69, i64* %tmp, align 8
|
|
br label %bb77
|
|
|
|
bb77: ; preds = %bb68, %bb26
|
|
; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1})
|
|
; CHECK: MemoryUse(3)
|
|
; CHECK-NEXT: %tmp78 = load i64*, i64** %tmp25, align 8
|
|
%tmp78 = load i64*, i64** %tmp25, align 8
|
|
%tmp79 = getelementptr inbounds i64, i64* %tmp78, i64 undef
|
|
br label %bb26
|
|
}
|
|
|
|
; CHECK-LABEL: define void @quux_skip
|
|
define void @quux_skip(%struct.hoge* noalias %f, i64* noalias %g) align 2 {
|
|
%tmp = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1, i32 0
|
|
%tmp24 = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1
|
|
%tmp25 = bitcast %struct.widget* %tmp24 to i64**
|
|
br label %bb26
|
|
|
|
bb26: ; preds = %bb77, %0
|
|
; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3})
|
|
; CHECK-NEXT: br i1 undef, label %bb68, label %bb77
|
|
br i1 undef, label %bb68, label %bb77
|
|
|
|
bb68: ; preds = %bb26
|
|
; CHECK: MemoryUse(2)
|
|
; CHECK-NEXT: %tmp69 = load i64, i64* %g, align 8
|
|
%tmp69 = load i64, i64* %g, align 8
|
|
; CHECK: 1 = MemoryDef(2)
|
|
; CHECK-NEXT: store i64 %tmp69, i64* %g, align 8
|
|
store i64 %tmp69, i64* %g, align 8
|
|
br label %bb77
|
|
|
|
bb77: ; preds = %bb68, %bb26
|
|
; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1})
|
|
; CHECK: MemoryUse(liveOnEntry)
|
|
; CHECK-NEXT: %tmp78 = load i64*, i64** %tmp25, align 8
|
|
%tmp78 = load i64*, i64** %tmp25, align 8
|
|
br label %bb26
|
|
}
|
|
|
|
; CHECK-LABEL: define void @quux_dominated
|
|
define void @quux_dominated(%struct.hoge* noalias %f, i64* noalias %g) align 2 {
|
|
%tmp = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1, i32 0
|
|
%tmp24 = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1
|
|
%tmp25 = bitcast %struct.widget* %tmp24 to i64**
|
|
br label %bb26
|
|
|
|
bb26: ; preds = %bb77, %0
|
|
; CHECK: 3 = MemoryPhi({%0,liveOnEntry},{bb77,2})
|
|
; CHECK: MemoryUse(3)
|
|
; CHECK-NEXT: load i64*, i64** %tmp25, align 8
|
|
load i64*, i64** %tmp25, align 8
|
|
br i1 undef, label %bb68, label %bb77
|
|
|
|
bb68: ; preds = %bb26
|
|
; CHECK: MemoryUse(3)
|
|
; CHECK-NEXT: %tmp69 = load i64, i64* %g, align 8
|
|
%tmp69 = load i64, i64* %g, align 8
|
|
; CHECK: 1 = MemoryDef(3)
|
|
; CHECK-NEXT: store i64 %tmp69, i64* %g, align 8
|
|
store i64 %tmp69, i64* %g, align 8
|
|
br label %bb77
|
|
|
|
bb77: ; preds = %bb68, %bb26
|
|
; CHECK: 4 = MemoryPhi({bb26,3},{bb68,1})
|
|
; CHECK: 2 = MemoryDef(4)
|
|
; CHECK-NEXT: store i64* null, i64** %tmp25, align 8
|
|
store i64* null, i64** %tmp25, align 8
|
|
br label %bb26
|
|
}
|
|
|
|
; CHECK-LABEL: define void @quux_nodominate
|
|
define void @quux_nodominate(%struct.hoge* noalias %f, i64* noalias %g) align 2 {
|
|
%tmp = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1, i32 0
|
|
%tmp24 = getelementptr inbounds %struct.hoge, %struct.hoge* %f, i64 0, i32 1
|
|
%tmp25 = bitcast %struct.widget* %tmp24 to i64**
|
|
br label %bb26
|
|
|
|
bb26: ; preds = %bb77, %0
|
|
; CHECK: 2 = MemoryPhi({%0,liveOnEntry},{bb77,3})
|
|
; CHECK: MemoryUse(liveOnEntry)
|
|
; CHECK-NEXT: load i64*, i64** %tmp25, align 8
|
|
load i64*, i64** %tmp25, align 8
|
|
br i1 undef, label %bb68, label %bb77
|
|
|
|
bb68: ; preds = %bb26
|
|
; CHECK: MemoryUse(2)
|
|
; CHECK-NEXT: %tmp69 = load i64, i64* %g, align 8
|
|
%tmp69 = load i64, i64* %g, align 8
|
|
; CHECK: 1 = MemoryDef(2)
|
|
; CHECK-NEXT: store i64 %tmp69, i64* %g, align 8
|
|
store i64 %tmp69, i64* %g, align 8
|
|
br label %bb77
|
|
|
|
bb77: ; preds = %bb68, %bb26
|
|
; CHECK: 3 = MemoryPhi({bb26,2},{bb68,1})
|
|
; CHECK-NEXT: br label %bb26
|
|
br label %bb26
|
|
}
|