mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 18:54:02 +01:00
7e501cf4c3
This update was done with the following bash script:
find test/CodeGen -name "*.ll" | \
while read NAME; do
echo "$NAME"
if ! grep -q "^; *RUN: *llc.*debug" $NAME; then
TEMP=`mktemp -t temp`
cp $NAME $TEMP
sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \
while read FUNC; do
sed -i '' "s/;\(.*\)\([A-Za-z0-9_-]*\):\( *\)$FUNC: *\$/;\1\2-LABEL:\3$FUNC:/g" $TEMP
done
sed -i '' "s/;\(.*\)-LABEL-LABEL:/;\1-LABEL:/" $TEMP
sed -i '' "s/;\(.*\)-NEXT-LABEL:/;\1-NEXT:/" $TEMP
sed -i '' "s/;\(.*\)-NOT-LABEL:/;\1-NOT:/" $TEMP
sed -i '' "s/;\(.*\)-DAG-LABEL:/;\1-DAG:/" $TEMP
mv $TEMP $NAME
fi
done
llvm-svn: 186280
152 lines
4.0 KiB
LLVM
152 lines
4.0 KiB
LLVM
; Test 128-bit floating-point stores.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Check stores with no offset.
|
|
define void @f1(i64 %src, double %val) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: std %f0, 0(%r2)
|
|
; CHECK: std %f2, 8(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = inttoptr i64 %src to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the highest aligned offset that allows STD for both halves.
|
|
define void @f2(i64 %src, double %val) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: std %f0, 4080(%r2)
|
|
; CHECK: std %f2, 4088(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, 4080
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next doubleword up, which requires a mixture of STD and STDY.
|
|
define void @f3(i64 %src, double %val) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: std %f0, 4088(%r2)
|
|
; CHECK: stdy %f2, 4096(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, 4088
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next doubleword after that, which requires STDY for both halves.
|
|
define void @f4(i64 %src, double %val) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: stdy %f0, 4096(%r2)
|
|
; CHECK: stdy %f2, 4104(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, 4096
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the highest aligned offset that allows STDY for both halves.
|
|
define void @f5(i64 %src, double %val) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK: stdy %f0, 524272(%r2)
|
|
; CHECK: stdy %f2, 524280(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, 524272
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next doubleword up, which requires separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f6(i64 %src, double %val) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK: lay %r1, 524280(%r2)
|
|
; CHECK: std %f0, 0(%r1)
|
|
; CHECK: std %f2, 8(%r1)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, 524280
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the highest aligned negative offset, which needs a combination of
|
|
; STDY and STD.
|
|
define void @f7(i64 %src, double %val) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: stdy %f0, -8(%r2)
|
|
; CHECK: std %f2, 0(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, -8
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next doubleword down, which requires STDY for both halves.
|
|
define void @f8(i64 %src, double %val) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: stdy %f0, -16(%r2)
|
|
; CHECK: stdy %f2, -8(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, -16
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the lowest offset that allows STDY for both halves.
|
|
define void @f9(i64 %src, double %val) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: stdy %f0, -524288(%r2)
|
|
; CHECK: stdy %f2, -524280(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, -524288
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next doubleword down, which requires separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f10(i64 %src, double %val) {
|
|
; CHECK-LABEL: f10:
|
|
; CHECK: agfi %r2, -524296
|
|
; CHECK: std %f0, 0(%r2)
|
|
; CHECK: std %f2, 8(%r2)
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, -524296
|
|
%ptr = inttoptr i64 %add to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that indices are allowed.
|
|
define void @f11(i64 %src, i64 %index, double %val) {
|
|
; CHECK-LABEL: f11:
|
|
; CHECK: std %f0, 4088({{%r2,%r3|%r3,%r2}})
|
|
; CHECK: stdy %f2, 4096({{%r2,%r3|%r3,%r2}})
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %src, %index
|
|
%add2 = add i64 %add1, 4088
|
|
%ptr = inttoptr i64 %add2 to fp128 *
|
|
%ext = fpext double %val to fp128
|
|
store fp128 %ext, fp128 *%ptr
|
|
ret void
|
|
}
|