mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
9a45e65673
This function is responsible for checking the legality of fusing an instance of load -> op -> store into a single operation. In the SystemZ backend the check was incomplete and a test case emerged with a cycle in the instruction selection DAG as a result. Instead of using the NodeIds to determine node relationships, hasPredecessorHelper() now is used just like in the X86 backend. This handled the failing tests and as well gave a few additional transformations on benchmarks. The SystemZ isFusableLoadOpStorePattern() is now a very near copy of the X86 function, and it seems this could be made a utility function in common code instead. Review: Ulrich Weigand https://reviews.llvm.org/D60255 llvm-svn: 357688
35 lines
1.9 KiB
LLVM
35 lines
1.9 KiB
LLVM
; Test that this test case does not abort after the folding of load -> add ->
|
|
; store into an alsi. This folding is suppose to not happen as it would
|
|
; introduce a loop in the DAG.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z13 -disable-basicaa -consthoist-gep | FileCheck %s
|
|
|
|
@g_295 = external dso_local unnamed_addr global i32, align 4
|
|
@g_672 = external dso_local unnamed_addr global i64, align 8
|
|
@g_1484 = external dso_local global <{ i8, i64, { i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, [2 x i8], i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, i8 }, i32 }>, align 2
|
|
|
|
define void @fun() {
|
|
; CHECK-LABEL: fun:
|
|
|
|
bb:
|
|
br label %bb1
|
|
|
|
bb1: ; preds = %bb1, %bb
|
|
store i32 2, i32* getelementptr inbounds (<{ i8, i64, { i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, [2 x i8], i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, i8 }, i32 }>, <{ i8, i64, { i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, [2 x i8], i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, i8 }, i32 }>* @g_1484, i64 0, i32 2, i32 16)
|
|
%tmp = icmp slt i32 undef, 3
|
|
br i1 %tmp, label %bb1, label %bb2
|
|
|
|
bb2: ; preds = %bb1
|
|
%tmp3 = load i32, i32* getelementptr inbounds (<{ i8, i64, { i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, [2 x i8], i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, i8 }, i32 }>, <{ i8, i64, { i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, [2 x i8], i8, i8, i8, i8, i8, i8, i8, i8, i32, i8, i8, i8 }, i32 }>* @g_1484, i64 0, i32 2, i32 28)
|
|
%tmp4 = load i64, i64* @g_672
|
|
%tmp5 = add i64 %tmp4, 1
|
|
store i64 %tmp5, i64* @g_672
|
|
%tmp6 = icmp eq i64 %tmp5, 0
|
|
%tmp7 = zext i1 %tmp6 to i32
|
|
%tmp8 = icmp ult i32 %tmp3, %tmp7
|
|
%tmp9 = zext i1 %tmp8 to i32
|
|
store i32 %tmp9, i32* @g_295
|
|
ret void
|
|
}
|
|
|