mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +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
41 lines
873 B
LLVM
41 lines
873 B
LLVM
; Test 32-bit XORs in which the second operand is constant.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Check the lowest useful XILF value.
|
|
define i32 @f1(i32 %a) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: xilf %r2, 1
|
|
; CHECK: br %r14
|
|
%xor = xor i32 %a, 1
|
|
ret i32 %xor
|
|
}
|
|
|
|
; Check the high end of the signed range.
|
|
define i32 @f2(i32 %a) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: xilf %r2, 2147483647
|
|
; CHECK: br %r14
|
|
%xor = xor i32 %a, 2147483647
|
|
ret i32 %xor
|
|
}
|
|
|
|
; Check the low end of the signed range, which should be treated
|
|
; as a positive value.
|
|
define i32 @f3(i32 %a) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: xilf %r2, 2147483648
|
|
; CHECK: br %r14
|
|
%xor = xor i32 %a, -2147483648
|
|
ret i32 %xor
|
|
}
|
|
|
|
; Check the high end of the XILF range.
|
|
define i32 @f4(i32 %a) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: xilf %r2, 4294967295
|
|
; CHECK: br %r14
|
|
%xor = xor i32 %a, 4294967295
|
|
ret i32 %xor
|
|
}
|