mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-01 08:23:21 +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
118 lines
2.8 KiB
LLVM
118 lines
2.8 KiB
LLVM
; Test 32-bit GPR stores.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Test an i32 store.
|
|
define void @f1(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: st %r3, 0(%r2)
|
|
; CHECK: br %r14
|
|
store i32 %val, i32 *%dst
|
|
ret void
|
|
}
|
|
|
|
; Test a truncating i64 store.
|
|
define void @f2(i32 *%dst, i64 %val) {
|
|
%word = trunc i64 %val to i32
|
|
store i32 %word, i32 *%dst
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the aligned ST range.
|
|
define void @f3(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: st %r3, 4092(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 1023
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next word up, which should use STY instead of ST.
|
|
define void @f4(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: sty %r3, 4096(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 1024
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the aligned STY range.
|
|
define void @f5(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK: sty %r3, 524284(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 131071
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next word up, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f6(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK: agfi %r2, 524288
|
|
; CHECK: st %r3, 0(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 131072
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the negative aligned STY range.
|
|
define void @f7(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: sty %r3, -4(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 -1
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the low end of the STY range.
|
|
define void @f8(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: sty %r3, -524288(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 -131072
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next word down, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f9(i32 *%dst, i32 %val) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: agfi %r2, -524292
|
|
; CHECK: st %r3, 0(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32 *%dst, i64 -131073
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that ST allows an index.
|
|
define void @f10(i64 %dst, i64 %index, i32 %val) {
|
|
; CHECK-LABEL: f10:
|
|
; CHECK: st %r4, 4095(%r3,%r2)
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %dst, %index
|
|
%add2 = add i64 %add1, 4095
|
|
%ptr = inttoptr i64 %add2 to i32 *
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that STY allows an index.
|
|
define void @f11(i64 %dst, i64 %index, i32 %val) {
|
|
; CHECK-LABEL: f11:
|
|
; CHECK: sty %r4, 4096(%r3,%r2)
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %dst, %index
|
|
%add2 = add i64 %add1, 4096
|
|
%ptr = inttoptr i64 %add2 to i32 *
|
|
store i32 %val, i32 *%ptr
|
|
ret void
|
|
}
|