llvm-mirror/test/Transforms/NewGVN/pr28562.ll

; RUN: opt -S -newgvn < %s | FileCheck %s
define i32* @test1(i32* %a) {
  %x1 = getelementptr inbounds i32, i32* %a, i32 10
  %x2 = getelementptr i32, i32* %a, i32 10
  ret i32* %x2
; CHECK-LABEL: @test1(
; CHECK: %[[x:.*]] = getelementptr i32, i32* %a, i32 10
; CHECK: ret i32* %[[x]]
}
[GVN] Initial check-in of a new global value numbering algorithm. 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 2016-12-22 17:03:48 +01:00			`; RUN: opt -S -newgvn < %s \| FileCheck %s`
			`define i32* @test1(i32* %a) {`
			`%x1 = getelementptr inbounds i32, i32* %a, i32 10`
			`%x2 = getelementptr i32, i32* %a, i32 10`
			`ret i32* %x2`
			`; CHECK-LABEL: @test1(`
			`; CHECK: %[[x:.]] = getelementptr i32, i32 %a, i32 10`
			`; CHECK: ret i32* %[[x]]`
			`}`