2013-04-13 00:55:41 +00:00
|
|
|
; RUN: llc -march=mips -mattr=dsp < %s | FileCheck %s -check-prefix=R1
|
|
|
|
|
; RUN: llc -march=mips -mattr=dspr2 < %s | FileCheck %s -check-prefix=R2
|
2013-03-30 02:14:45 +00:00
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_lbux:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: lbux ${{[0-9]+}}
|
2013-03-30 02:14:45 +00:00
|
|
|
|
|
|
|
|
define zeroext i8 @test_lbux(i8* nocapture %b, i32 %i) {
|
|
|
|
|
entry:
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230786 91177308-0d34-0410-b5e6-96231b3b80d8
2015-02-27 19:29:02 +00:00
|
|
|
%add.ptr = getelementptr inbounds i8, i8* %b, i32 %i
|
2015-02-27 21:17:42 +00:00
|
|
|
%0 = load i8, i8* %add.ptr, align 1
|
2013-03-30 02:14:45 +00:00
|
|
|
ret i8 %0
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_lhx:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: lhx ${{[0-9]+}}
|
2013-03-30 02:14:45 +00:00
|
|
|
|
|
|
|
|
define signext i16 @test_lhx(i16* nocapture %b, i32 %i) {
|
|
|
|
|
entry:
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230786 91177308-0d34-0410-b5e6-96231b3b80d8
2015-02-27 19:29:02 +00:00
|
|
|
%add.ptr = getelementptr inbounds i16, i16* %b, i32 %i
|
2015-02-27 21:17:42 +00:00
|
|
|
%0 = load i16, i16* %add.ptr, align 2
|
2013-03-30 02:14:45 +00:00
|
|
|
ret i16 %0
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_lwx:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: lwx ${{[0-9]+}}
|
2013-03-30 02:14:45 +00:00
|
|
|
|
|
|
|
|
define i32 @test_lwx(i32* nocapture %b, i32 %i) {
|
|
|
|
|
entry:
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230786 91177308-0d34-0410-b5e6-96231b3b80d8
2015-02-27 19:29:02 +00:00
|
|
|
%add.ptr = getelementptr inbounds i32, i32* %b, i32 %i
|
2015-02-27 21:17:42 +00:00
|
|
|
%0 = load i32, i32* %add.ptr, align 4
|
2013-03-30 02:14:45 +00:00
|
|
|
ret i32 %0
|
|
|
|
|
}
|
2013-04-13 00:55:41 +00:00
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_add_v2q15_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: addq.ph ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_add_v2q15_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <2 x i16>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <2 x i16>
|
|
|
|
|
%add = add <2 x i16> %0, %1
|
|
|
|
|
%2 = bitcast <2 x i16> %add to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_sub_v2q15_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: subq.ph ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_sub_v2q15_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <2 x i16>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <2 x i16>
|
|
|
|
|
%sub = sub <2 x i16> %0, %1
|
|
|
|
|
%2 = bitcast <2 x i16> %sub to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R2-LABEL: test_mul_v2q15_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R2: mul.ph ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
; mul.ph is an R2 instruction. Check that multiply node gets expanded.
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_mul_v2q15_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: mul ${{[0-9]+}}
|
|
|
|
|
; R1: mul ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_mul_v2q15_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <2 x i16>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <2 x i16>
|
|
|
|
|
%mul = mul <2 x i16> %0, %1
|
|
|
|
|
%2 = bitcast <2 x i16> %mul to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_add_v4i8_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: addu.qb ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_add_v4i8_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <4 x i8>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <4 x i8>
|
|
|
|
|
%add = add <4 x i8> %0, %1
|
|
|
|
|
%2 = bitcast <4 x i8> %add to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_sub_v4i8_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: subu.qb ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_sub_v4i8_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <4 x i8>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <4 x i8>
|
|
|
|
|
%sub = sub <4 x i8> %0, %1
|
|
|
|
|
%2 = bitcast <4 x i8> %sub to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; DSP-ASE doesn't have a v4i8 multiply instruction. Check that multiply node gets expanded.
|
2013-07-13 20:38:47 +00:00
|
|
|
; R2-LABEL: test_mul_v4i8_:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R2: mul ${{[0-9]+}}
|
|
|
|
|
; R2: mul ${{[0-9]+}}
|
|
|
|
|
; R2: mul ${{[0-9]+}}
|
|
|
|
|
; R2: mul ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_mul_v4i8_(i32 %a.coerce, i32 %b.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <4 x i8>
|
|
|
|
|
%1 = bitcast i32 %b.coerce to <4 x i8>
|
|
|
|
|
%mul = mul <4 x i8> %0, %1
|
|
|
|
|
%2 = bitcast <4 x i8> %mul to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %2, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_addsc:
|
2013-04-13 00:55:41 +00:00
|
|
|
; R1: addsc ${{[0-9]+}}
|
|
|
|
|
; R1: addwc ${{[0-9]+}}
|
|
|
|
|
|
|
|
|
|
define i64 @test_addsc(i64 %a, i64 %b) {
|
|
|
|
|
entry:
|
|
|
|
|
%add = add nsw i64 %b, %a
|
|
|
|
|
ret i64 %add
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v2i16_shl_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1: shll.ph ${{[0-9]+}}, ${{[0-9]+}}, 15
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v2i16_shl_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <2 x i16>
|
|
|
|
|
%shl = shl <2 x i16> %0, <i16 15, i16 15>
|
|
|
|
|
%1 = bitcast <2 x i16> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v2i16_sra_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1: shra.ph ${{[0-9]+}}, ${{[0-9]+}}, 15
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v2i16_sra_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <2 x i16>
|
|
|
|
|
%shr = ashr <2 x i16> %0, <i16 15, i16 15>
|
|
|
|
|
%1 = bitcast <2 x i16> %shr to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v2ui16_srl_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1-NOT: shrl.ph
|
2013-07-14 06:24:09 +00:00
|
|
|
; R2-LABEL: shift1_v2ui16_srl_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R2: shrl.ph ${{[0-9]+}}, ${{[0-9]+}}, 15
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v2ui16_srl_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <2 x i16>
|
|
|
|
|
%shr = lshr <2 x i16> %0, <i16 15, i16 15>
|
|
|
|
|
%1 = bitcast <2 x i16> %shr to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v4i8_shl_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1: shll.qb ${{[0-9]+}}, ${{[0-9]+}}, 7
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v4i8_shl_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <4 x i8>
|
|
|
|
|
%shl = shl <4 x i8> %0, <i8 7, i8 7, i8 7, i8 7>
|
|
|
|
|
%1 = bitcast <4 x i8> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v4i8_sra_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1-NOT: shra.qb
|
2013-07-14 06:24:09 +00:00
|
|
|
; R2-LABEL: shift1_v4i8_sra_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R2: shra.qb ${{[0-9]+}}, ${{[0-9]+}}, 7
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v4i8_sra_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <4 x i8>
|
|
|
|
|
%shr = ashr <4 x i8> %0, <i8 7, i8 7, i8 7, i8 7>
|
|
|
|
|
%1 = bitcast <4 x i8> %shr to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-14 06:24:09 +00:00
|
|
|
; R1-LABEL: shift1_v4ui8_srl_:
|
2013-04-19 23:21:32 +00:00
|
|
|
; R1: shrl.qb ${{[0-9]+}}, ${{[0-9]+}}, 7
|
|
|
|
|
|
|
|
|
|
define { i32 } @shift1_v4ui8_srl_(i32 %a0.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a0.coerce to <4 x i8>
|
|
|
|
|
%shr = lshr <4 x i8> %0, <i8 7, i8 7, i8 7, i8 7>
|
|
|
|
|
%1 = bitcast <4 x i8> %shr to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
2013-04-22 19:58:23 +00:00
|
|
|
|
|
|
|
|
; Check that shift node is expanded if splat element size is not 16-bit.
|
|
|
|
|
;
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_vector_splat_imm_v2q15:
|
2013-04-22 19:58:23 +00:00
|
|
|
; R1-NOT: shll.ph
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_vector_splat_imm_v2q15(i32 %a.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <2 x i16>
|
|
|
|
|
%shl = shl <2 x i16> %0, <i16 0, i16 2>
|
|
|
|
|
%1 = bitcast <2 x i16> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Check that shift node is expanded if splat element size is not 8-bit.
|
|
|
|
|
;
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_vector_splat_imm_v4i8:
|
2013-04-22 19:58:23 +00:00
|
|
|
; R1-NOT: shll.qb
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_vector_splat_imm_v4i8(i32 %a.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <4 x i8>
|
|
|
|
|
%shl = shl <4 x i8> %0, <i8 0, i8 2, i8 0, i8 2>
|
|
|
|
|
%1 = bitcast <4 x i8> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Check that shift node is expanded if shift amount doesn't fit in 4-bit sa field.
|
|
|
|
|
;
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_shift_amount_v2q15:
|
2013-04-22 19:58:23 +00:00
|
|
|
; R1-NOT: shll.ph
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_shift_amount_v2q15(i32 %a.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <2 x i16>
|
|
|
|
|
%shl = shl <2 x i16> %0, <i16 16, i16 16>
|
|
|
|
|
%1 = bitcast <2 x i16> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Check that shift node is expanded if shift amount doesn't fit in 3-bit sa field.
|
|
|
|
|
;
|
2013-07-13 20:38:47 +00:00
|
|
|
; R1-LABEL: test_shift_amount_v4i8:
|
2013-04-22 19:58:23 +00:00
|
|
|
; R1-NOT: shll.qb
|
|
|
|
|
|
|
|
|
|
define { i32 } @test_shift_amount_v4i8(i32 %a.coerce) {
|
|
|
|
|
entry:
|
|
|
|
|
%0 = bitcast i32 %a.coerce to <4 x i8>
|
|
|
|
|
%shl = shl <4 x i8> %0, <i8 8, i8 8, i8 8, i8 8>
|
|
|
|
|
%1 = bitcast <4 x i8> %shl to i32
|
|
|
|
|
%.fca.0.insert = insertvalue { i32 } undef, i32 %1, 0
|
|
|
|
|
ret { i32 } %.fca.0.insert
|
|
|
|
|
}
|