mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-28 23:43:50 +00:00
80f54784da
This first cut is pretty conservative. The final argument register (R6) is call-saved, so we would need to make sure that the R6 argument to a sibling call is the same as the R6 argument to the calling function, which seems worth keeping as a separate patch. Saying that integer truncations are free means that we no longer use the extending instructions LGF and LLGF for spills in int-conv-09.ll and int-conv-10.ll. Instead we treat the registers as 64 bits wide and truncate them to 32-bits where necessary. I think it's unlikely we'd use LGF and LLGF for spills in other situations for the same reason, so I'm removing the tests rather than replacing them. The associated code is generic and applies to many more instructions than just LGF and LLGF, so there is no corresponding code removal. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@188669 91177308-0d34-0410-b5e6-96231b3b80d8
105 lines
2.4 KiB
LLVM
105 lines
2.4 KiB
LLVM
; Test sign extensions from an i32 to an i64.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Test register extension, starting with an i32.
|
|
define i64 @f1(i32 %a) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: lgfr %r2, %r2
|
|
; CHECK: br %r14
|
|
%ext = sext i32 %a to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; ...and again with an i64.
|
|
define i64 @f2(i64 %a) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: lgfr %r2, %r2
|
|
; CHECK: br %r14
|
|
%word = trunc i64 %a to i32
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check LGF with no displacement.
|
|
define i64 @f3(i32 *%src) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: lgf %r2, 0(%r2)
|
|
; CHECK: br %r14
|
|
%word = load i32 *%src
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check the high end of the LGF range.
|
|
define i64 @f4(i32 *%src) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: lgf %r2, 524284(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%src, i64 131071
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check the next word up, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define i64 @f5(i32 *%src) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK: agfi %r2, 524288
|
|
; CHECK: lgf %r2, 0(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%src, i64 131072
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check the high end of the negative LGF range.
|
|
define i64 @f6(i32 *%src) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK: lgf %r2, -4(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%src, i64 -1
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check the low end of the LGF range.
|
|
define i64 @f7(i32 *%src) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: lgf %r2, -524288(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%src, i64 -131072
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check the next word down, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define i64 @f8(i32 *%src) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: agfi %r2, -524292
|
|
; CHECK: lgf %r2, 0(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%src, i64 -131073
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|
|
|
|
; Check that LGF allows an index.
|
|
define i64 @f9(i64 %src, i64 %index) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: lgf %r2, 524287(%r3,%r2)
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %src, %index
|
|
%add2 = add i64 %add1, 524287
|
|
%ptr = inttoptr i64 %add2 to i32 *
|
|
%word = load i32 *%ptr
|
|
%ext = sext i32 %word to i64
|
|
ret i64 %ext
|
|
}
|