mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
bd0298b1e1
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 llvm-svn: 290346
68 lines
2.0 KiB
LLVM
68 lines
2.0 KiB
LLVM
; RUN: opt < %s -newgvn | llvm-dis
|
|
; PR4256
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32"
|
|
target triple = "i386-pc-linux-gnu"
|
|
%llvm.dbg.anchor.type = type { i32, i32 }
|
|
%struct.cset = type { i8*, i8, i8, i32, i8* }
|
|
%struct.lmat = type { %struct.re_guts*, i32, %llvm.dbg.anchor.type*, i8*, i8*, i8*, i8*, i8**, i32, i8*, i8*, i8*, i8*, i8* }
|
|
%struct.re_guts = type { i32*, %struct.cset*, i8*, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i32, i8*, i8*, i32, i32, i32, i32, [1 x i8] }
|
|
|
|
define i8* @lbackref(%struct.lmat* %m, i8* %start, i8* %stop, i32 %startst, i32 %stopst, i32 %lev, i32 %rec) nounwind {
|
|
entry:
|
|
br label %bb63
|
|
|
|
bb: ; preds = %bb63
|
|
switch i32 0, label %bb62 [
|
|
i32 268435456, label %bb2
|
|
i32 805306368, label %bb9
|
|
i32 -1610612736, label %bb51
|
|
]
|
|
|
|
bb2: ; preds = %bb
|
|
br label %bb62
|
|
|
|
bb9: ; preds = %bb
|
|
%0 = load i8, i8* %sp.1, align 1 ; <i8> [#uses=0]
|
|
br label %bb62
|
|
|
|
bb51: ; preds = %bb
|
|
%1 = load i8, i8* %sp.1, align 1 ; <i8> [#uses=0]
|
|
ret i8* null
|
|
|
|
bb62: ; preds = %bb9, %bb2, %bb
|
|
br label %bb63
|
|
|
|
bb63: ; preds = %bb84, %bb69, %bb62, %entry
|
|
%sp.1 = phi i8* [ null, %bb62 ], [ %sp.1.lcssa, %bb84 ], [ %start, %entry ], [ %sp.1.lcssa, %bb69 ] ; <i8*> [#uses=3]
|
|
br i1 false, label %bb, label %bb65
|
|
|
|
bb65: ; preds = %bb63
|
|
%sp.1.lcssa = phi i8* [ %sp.1, %bb63 ] ; <i8*> [#uses=4]
|
|
br i1 false, label %bb66, label %bb69
|
|
|
|
bb66: ; preds = %bb65
|
|
ret i8* null
|
|
|
|
bb69: ; preds = %bb65
|
|
switch i32 0, label %bb108.loopexit2.loopexit.loopexit [
|
|
i32 1342177280, label %bb63
|
|
i32 1476395008, label %bb84
|
|
i32 1879048192, label %bb104
|
|
i32 2013265920, label %bb93
|
|
]
|
|
|
|
bb84: ; preds = %bb69
|
|
%2 = tail call i8* @lbackref(%struct.lmat* %m, i8* %sp.1.lcssa, i8* %stop, i32 0, i32 %stopst, i32 0, i32 0) nounwind ; <i8*> [#uses=0]
|
|
br label %bb63
|
|
|
|
bb93: ; preds = %bb69
|
|
ret i8* null
|
|
|
|
bb104: ; preds = %bb69
|
|
%sp.1.lcssa.lcssa33 = phi i8* [ %sp.1.lcssa, %bb69 ] ; <i8*> [#uses=0]
|
|
unreachable
|
|
|
|
bb108.loopexit2.loopexit.loopexit: ; preds = %bb69
|
|
ret i8* null
|
|
}
|