mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-16 08:27:21 +00:00
65696f40e4
The code have been developed by Daniel Berlin over the years, and the new implementation goal is that of addressing shortcomings of the current GVN infrastructure, i.e. long compile time for large testcases, lack of phi predication, no load/store value numbering etc... The current code just implements the "core" GVN algorithm, although other pieces (load coercion, phi handling, predicate system) are already implemented in a branch out of tree. Once the core is stable, we'll start adding pieces on top of the base framework. The test currently living in test/Transform/NewGVN are a copy of the ones in GVN, with proper `XFAIL` (missing features in NewGVN). A flag will be added in a future commit to enable NewGVN, so that interested parties can exercise this code easily. Differential Revision: https://reviews.llvm.org/D26224 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@290346 91177308-0d34-0410-b5e6-96231b3b80d8
21 lines
477 B
LLVM
21 lines
477 B
LLVM
; RUN: opt -newgvn -S < %s | FileCheck %s
|
|
|
|
; Check that an unreachable predecessor to a PHI node doesn't cause a crash.
|
|
; PR21625.
|
|
|
|
define i32 @f(i32** %f) {
|
|
; CHECK: bb0:
|
|
; Load should be removed, since it's ignored.
|
|
; CHECK-NEXT: br label
|
|
bb0:
|
|
%bar = load i32*, i32** %f
|
|
br label %bb2
|
|
bb1:
|
|
%zed = load i32*, i32** %f
|
|
br i1 false, label %bb1, label %bb2
|
|
bb2:
|
|
%foo = phi i32* [ null, %bb0 ], [ %zed, %bb1 ]
|
|
%storemerge = load i32, i32* %foo
|
|
ret i32 %storemerge
|
|
}
|