mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-24 21:42:54 +02: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
27 lines
852 B
LLVM
27 lines
852 B
LLVM
; XFAIL: *
|
|
; RUN: opt -S -basicaa -newgvn < %s | FileCheck %s
|
|
; RUN: opt -S -basicaa -newgvn -disable-simplify-libcalls < %s | FileCheck %s -check-prefix=CHECK_NO_LIBCALLS
|
|
; Check that loads from calloc are recognized as being zero.
|
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
|
|
|
|
; Function Attrs: nounwind uwtable
|
|
define i32 @test1() {
|
|
%1 = tail call noalias i8* @calloc(i64 1, i64 4)
|
|
%2 = bitcast i8* %1 to i32*
|
|
; This load is trivially constant zero
|
|
%3 = load i32, i32* %2, align 4
|
|
ret i32 %3
|
|
|
|
; CHECK-LABEL: @test1(
|
|
; CHECK-NOT: %3 = load i32, i32* %2, align 4
|
|
; CHECK: ret i32 0
|
|
|
|
; CHECK_NO_LIBCALLS-LABEL: @test1(
|
|
; CHECK_NO_LIBCALLS: load
|
|
; CHECK_NO_LIBCALLS: ret i32 %
|
|
|
|
}
|
|
|
|
declare noalias i8* @calloc(i64, i64)
|