2017-12-11 14:16:26 +08:00
|
|
|
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
|
2017-08-02 08:28:10 +08:00
|
|
|
; RUN: llc < %s -mtriple=x86_64-- -mattr=+sse4.2 | FileCheck %s
|
2009-11-30 10:42:27 +08:00
|
|
|
|
|
|
|
|
; Verify when widening a divide/remainder operation, we only generate a
|
|
|
|
|
; divide/rem per element since divide/remainder can trap.
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: vectorDiv
|
2009-11-30 10:42:27 +08:00
|
|
|
define void @vectorDiv (<2 x i32> addrspace(1)* %nsource, <2 x i32> addrspace(1)* %dsource, <2 x i32> addrspace(1)* %qdest) nounwind {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: vectorDiv:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %r8
|
|
|
|
|
; CHECK-NEXT: movq %rdi, -{{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rsi, -{{[0-9]+}}(%rsp)
|
2018-02-28 00:59:10 +08:00
|
|
|
; CHECK-NEXT: movq %rdx, -{{[0-9]+}}(%rsp)
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: movslq -{{[0-9]+}}(%rsp), %rcx
|
2018-09-13 14:13:37 +08:00
|
|
|
; CHECK-NEXT: movq {{.*#+}} xmm0 = mem[0],zero
|
|
|
|
|
; CHECK-NEXT: movq {{.*#+}} xmm1 = mem[0],zero
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %esi
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %esi
|
|
|
|
|
; CHECK-NEXT: movl %eax, %esi
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %edi
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %edi
|
|
|
|
|
; CHECK-NEXT: movd %eax, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %esi, %xmm0
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: movq %xmm0, (%r8,%rcx,8)
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
entry:
|
|
|
|
|
%nsource.addr = alloca <2 x i32> addrspace(1)*, align 4
|
|
|
|
|
%dsource.addr = alloca <2 x i32> addrspace(1)*, align 4
|
|
|
|
|
%qdest.addr = alloca <2 x i32> addrspace(1)*, align 4
|
|
|
|
|
%index = alloca i32, align 4
|
|
|
|
|
store <2 x i32> addrspace(1)* %nsource, <2 x i32> addrspace(1)** %nsource.addr
|
|
|
|
|
store <2 x i32> addrspace(1)* %dsource, <2 x i32> addrspace(1)** %dsource.addr
|
|
|
|
|
store <2 x i32> addrspace(1)* %qdest, <2 x i32> addrspace(1)** %qdest.addr
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp = load <2 x i32> addrspace(1)*, <2 x i32> addrspace(1)** %qdest.addr
|
|
|
|
|
%tmp1 = load i32, i32* %index
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx = getelementptr <2 x i32>, <2 x i32> addrspace(1)* %tmp, i32 %tmp1
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp2 = load <2 x i32> addrspace(1)*, <2 x i32> addrspace(1)** %nsource.addr
|
|
|
|
|
%tmp3 = load i32, i32* %index
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx4 = getelementptr <2 x i32>, <2 x i32> addrspace(1)* %tmp2, i32 %tmp3
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp5 = load <2 x i32>, <2 x i32> addrspace(1)* %arrayidx4
|
|
|
|
|
%tmp6 = load <2 x i32> addrspace(1)*, <2 x i32> addrspace(1)** %dsource.addr
|
|
|
|
|
%tmp7 = load i32, i32* %index
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx8 = getelementptr <2 x i32>, <2 x i32> addrspace(1)* %tmp6, i32 %tmp7
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp9 = load <2 x i32>, <2 x i32> addrspace(1)* %arrayidx8
|
2009-11-30 10:42:27 +08:00
|
|
|
%tmp10 = sdiv <2 x i32> %tmp5, %tmp9
|
|
|
|
|
store <2 x i32> %tmp10, <2 x i32> addrspace(1)* %arrayidx
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_char_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <3 x i8> @test_char_div(<3 x i8> %num, <3 x i8> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_char_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
2018-09-20 02:59:08 +08:00
|
|
|
; CHECK-NEXT: movl %edx, %r10d
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: movl %edi, %eax
|
2018-09-20 02:59:08 +08:00
|
|
|
; CHECK-NEXT: # kill: def $al killed $al killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cbtw
|
|
|
|
|
; CHECK-NEXT: idivb %cl
|
|
|
|
|
; CHECK-NEXT: movl %eax, %edi
|
|
|
|
|
; CHECK-NEXT: movl %esi, %eax
|
|
|
|
|
; CHECK-NEXT: cbtw
|
|
|
|
|
; CHECK-NEXT: idivb %r8b
|
2018-09-20 02:59:08 +08:00
|
|
|
; CHECK-NEXT: movl %eax, %edx
|
|
|
|
|
; CHECK-NEXT: movl %r10d, %eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cbtw
|
|
|
|
|
; CHECK-NEXT: idivb %r9b
|
|
|
|
|
; CHECK-NEXT: movl %eax, %ecx
|
|
|
|
|
; CHECK-NEXT: movl %edi, %eax
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = sdiv <3 x i8> %num, %div
|
|
|
|
|
ret <3 x i8> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:43:41 +08:00
|
|
|
; CHECK: test_uchar_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <3 x i8> @test_uchar_div(<3 x i8> %num, <3 x i8> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_uchar_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: movzbl %dil, %eax
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $eax killed $eax def $ax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divb %cl
|
|
|
|
|
; CHECK-NEXT: movl %eax, %edi
|
|
|
|
|
; CHECK-NEXT: movzbl %sil, %eax
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $eax killed $eax def $ax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divb %r8b
|
|
|
|
|
; CHECK-NEXT: movl %eax, %esi
|
|
|
|
|
; CHECK-NEXT: movzbl %dl, %eax
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $eax killed $eax def $ax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divb %r9b
|
|
|
|
|
; CHECK-NEXT: movl %eax, %ecx
|
|
|
|
|
; CHECK-NEXT: movl %edi, %eax
|
|
|
|
|
; CHECK-NEXT: movl %esi, %edx
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = udiv <3 x i8> %num, %div
|
|
|
|
|
ret <3 x i8> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_short_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <5 x i16> @test_short_div(<5 x i16> %num, <5 x i16> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_short_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pextrw $4, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $4, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %r8d
|
|
|
|
|
; CHECK-NEXT: pextrw $3, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $3, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %r9d
|
|
|
|
|
; CHECK-NEXT: pextrw $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $2, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %edi
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %ecx
|
|
|
|
|
; CHECK-NEXT: pextrw $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $1, %xmm1, %esi
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %si
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax def $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: movd %ecx, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $1, %eax, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $2, %edi, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $3, %r9d, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $4, %r8d, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = sdiv <5 x i16> %num, %div
|
|
|
|
|
ret <5 x i16> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_ushort_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <4 x i16> @test_ushort_div(<4 x i16> %num, <4 x i16> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_ushort_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pxor %xmm2, %xmm2
|
|
|
|
|
; CHECK-NEXT: pblendw {{.*#+}} xmm1 = xmm1[0],xmm2[1],xmm1[2],xmm2[3],xmm1[4],xmm2[5],xmm1[6],xmm2[7]
|
|
|
|
|
; CHECK-NEXT: pblendw {{.*#+}} xmm0 = xmm0[0],xmm2[1],xmm0[2],xmm2[3],xmm0[4],xmm2[5],xmm0[6],xmm2[7]
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %ecx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %ecx
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %esi
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %esi
|
|
|
|
|
; CHECK-NEXT: movd %eax, %xmm2
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %ecx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $2, %eax, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $3, %eax, %xmm2
|
|
|
|
|
; CHECK-NEXT: movdqa %xmm2, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = udiv <4 x i16> %num, %div
|
|
|
|
|
ret <4 x i16> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_uint_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <3 x i32> @test_uint_div(<3 x i32> %num, <3 x i32> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_uint_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %ecx
|
|
|
|
|
; CHECK-NEXT: movl %eax, %ecx
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %esi
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %esi
|
|
|
|
|
; CHECK-NEXT: movl %eax, %esi
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %edi
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divl %edi
|
|
|
|
|
; CHECK-NEXT: movd %eax, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %esi, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrd $2, %ecx, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = udiv <3 x i32> %num, %div
|
|
|
|
|
ret <3 x i32> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_long_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <3 x i64> @test_long_div(<3 x i64> %num, <3 x i64> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_long_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %r10
|
|
|
|
|
; CHECK-NEXT: movq %rdi, %rax
|
|
|
|
|
; CHECK-NEXT: cqto
|
|
|
|
|
; CHECK-NEXT: idivq %rcx
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rcx
|
|
|
|
|
; CHECK-NEXT: movq %rsi, %rax
|
|
|
|
|
; CHECK-NEXT: cqto
|
|
|
|
|
; CHECK-NEXT: idivq %r8
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rsi
|
|
|
|
|
; CHECK-NEXT: movq %r10, %rax
|
|
|
|
|
; CHECK-NEXT: cqto
|
|
|
|
|
; CHECK-NEXT: idivq %r9
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rdi
|
|
|
|
|
; CHECK-NEXT: movq %rcx, %rax
|
|
|
|
|
; CHECK-NEXT: movq %rsi, %rdx
|
|
|
|
|
; CHECK-NEXT: movq %rdi, %rcx
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = sdiv <3 x i64> %num, %div
|
|
|
|
|
ret <3 x i64> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_ulong_div
|
2009-11-30 10:42:27 +08:00
|
|
|
define <3 x i64> @test_ulong_div(<3 x i64> %num, <3 x i64> %div) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_ulong_div:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %r10
|
|
|
|
|
; CHECK-NEXT: movq %rdi, %rax
|
2018-09-20 02:59:08 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq %rcx
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rcx
|
|
|
|
|
; CHECK-NEXT: movq %rsi, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq %r8
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rsi
|
|
|
|
|
; CHECK-NEXT: movq %r10, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq %r9
|
|
|
|
|
; CHECK-NEXT: movq %rax, %rdi
|
|
|
|
|
; CHECK-NEXT: movq %rcx, %rax
|
|
|
|
|
; CHECK-NEXT: movq %rsi, %rdx
|
|
|
|
|
; CHECK-NEXT: movq %rdi, %rcx
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%div.r = udiv <3 x i64> %num, %div
|
|
|
|
|
ret <3 x i64> %div.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_char_rem
|
2009-11-30 10:42:27 +08:00
|
|
|
define <4 x i8> @test_char_rem(<4 x i8> %num, <4 x i8> %rem) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_char_rem:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pslld $24, %xmm1
|
|
|
|
|
; CHECK-NEXT: psrad $24, %xmm1
|
|
|
|
|
; CHECK-NEXT: pslld $24, %xmm0
|
|
|
|
|
; CHECK-NEXT: psrad $24, %xmm0
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %ecx
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %esi
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %esi
|
|
|
|
|
; CHECK-NEXT: movd %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %ecx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $2, %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $3, %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: movdqa %xmm2, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%rem.r = srem <4 x i8> %num, %rem
|
|
|
|
|
ret <4 x i8> %rem.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_short_rem
|
2009-11-30 10:42:27 +08:00
|
|
|
define <5 x i16> @test_short_rem(<5 x i16> %num, <5 x i16> %rem) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_short_rem:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pextrw $4, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $4, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %r8d
|
|
|
|
|
; CHECK-NEXT: pextrw $3, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $3, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %r9d
|
|
|
|
|
; CHECK-NEXT: pextrw $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $2, %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %edi
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %ecx
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %cx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %ecx
|
|
|
|
|
; CHECK-NEXT: pextrw $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrw $1, %xmm1, %esi
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $ax killed $ax killed $eax
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: cwtd
|
|
|
|
|
; CHECK-NEXT: idivw %si
|
2018-02-01 06:04:26 +08:00
|
|
|
; CHECK-NEXT: # kill: def $dx killed $dx def $edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: movd %ecx, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $1, %edx, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $2, %edi, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $3, %r9d, %xmm0
|
|
|
|
|
; CHECK-NEXT: pinsrw $4, %r8d, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%rem.r = srem <5 x i16> %num, %rem
|
|
|
|
|
ret <5 x i16> %rem.r
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_uint_rem
|
2009-11-30 10:42:27 +08:00
|
|
|
define <4 x i32> @test_uint_rem(<4 x i32> %num, <4 x i32> %rem) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_uint_rem:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: movl %edx, %ecx
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %esi
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %esi
|
|
|
|
|
; CHECK-NEXT: movd %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %ecx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $2, %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $3, %xmm1, %ecx
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %ecx
|
|
|
|
|
; CHECK-NEXT: pinsrd $3, %edx, %xmm2
|
|
|
|
|
; CHECK-NEXT: movdqa %xmm2, %xmm0
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%rem.r = srem <4 x i32> %num, %rem
|
|
|
|
|
ret <4 x i32> %rem.r
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_ulong_rem
|
2009-11-30 10:42:27 +08:00
|
|
|
define <5 x i64> @test_ulong_rem(<5 x i64> %num, <5 x i64> %rem) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_ulong_rem:
|
|
|
|
|
; CHECK: # %bb.0:
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %rax
|
|
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
|
|
|
|
; CHECK-NEXT: divq {{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %xmm0
|
|
|
|
|
; CHECK-NEXT: movq %rsi, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq {{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %xmm1
|
|
|
|
|
; CHECK-NEXT: punpcklqdq {{.*#+}} xmm1 = xmm1[0],xmm0[0]
|
|
|
|
|
; CHECK-NEXT: movq %r8, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq {{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %xmm0
|
|
|
|
|
; CHECK-NEXT: movq %rcx, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq {{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rdx, %xmm2
|
|
|
|
|
; CHECK-NEXT: punpcklqdq {{.*#+}} xmm2 = xmm2[0],xmm0[0]
|
|
|
|
|
; CHECK-NEXT: movq %r9, %rax
|
Bias physical register immediate assignments
The machine scheduler currently biases register copies to/from
physical registers to be closer to their point of use / def to
minimize their live ranges. This change extends this to also physical
register assignments from immediate values.
This causes a reduction in reduction in overall register pressure and
minor reduction in spills and indirectly fixes an out-of-registers
assertion (PR39391).
Most test changes are from minor instruction reorderings and register
name selection changes and direct consequences of that.
Reviewers: MatzeB, qcolombet, myatsina, pcc
Subscribers: nemanjai, jvesely, nhaehnle, eraman, hiraditya,
javed.absar, arphaman, jfb, jsji, llvm-commits
Differential Revision: https://reviews.llvm.org/D54218
llvm-svn: 346894
2018-11-15 05:11:53 +08:00
|
|
|
; CHECK-NEXT: xorl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: divq {{[0-9]+}}(%rsp)
|
|
|
|
|
; CHECK-NEXT: movq %rdx, 32(%rdi)
|
|
|
|
|
; CHECK-NEXT: movdqa %xmm2, 16(%rdi)
|
|
|
|
|
; CHECK-NEXT: movdqa %xmm1, (%rdi)
|
|
|
|
|
; CHECK-NEXT: movq %rdi, %rax
|
|
|
|
|
; CHECK-NEXT: retq
|
2009-11-30 10:42:27 +08:00
|
|
|
%rem.r = urem <5 x i64> %num, %rem
|
|
|
|
|
ret <5 x i64> %rem.r
|
|
|
|
|
}
|
2010-02-11 07:37:45 +08:00
|
|
|
|
2011-10-17 04:31:33 +08:00
|
|
|
; CHECK: test_int_div
|
2010-02-11 07:37:45 +08:00
|
|
|
define void @test_int_div(<3 x i32>* %dest, <3 x i32>* %old, i32 %n) {
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-LABEL: test_int_div:
|
|
|
|
|
; CHECK: # %bb.0: # %entry
|
2018-02-28 00:59:10 +08:00
|
|
|
; CHECK-NEXT: testl %edx, %edx
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: jle .LBB12_3
|
|
|
|
|
; CHECK-NEXT: # %bb.1: # %bb.nph
|
[CodeGen] Add a new pass for PostRA sink
Summary:
This pass sinks COPY instructions into a successor block, if the COPY is not
used in the current block and the COPY is live-in to a single successor
(i.e., doesn't require the COPY to be duplicated). This avoids executing the
the copy on paths where their results aren't needed. This also exposes
additional opportunites for dead copy elimination and shrink wrapping.
These copies were either not handled by or are inserted after the MachineSink
pass. As an example of the former case, the MachineSink pass cannot sink
COPY instructions with allocatable source registers; for AArch64 these type
of copy instructions are frequently used to move function parameters (PhyReg)
into virtual registers in the entry block..
For the machine IR below, this pass will sink %w19 in the entry into its
successor (%bb.1) because %w19 is only live-in in %bb.1.
```
%bb.0:
%wzr = SUBSWri %w1, 1
%w19 = COPY %w0
Bcc 11, %bb.2
%bb.1:
Live Ins: %w19
BL @fun
%w0 = ADDWrr %w0, %w19
RET %w0
%bb.2:
%w0 = COPY %wzr
RET %w0
```
As we sink %w19 (CSR in AArch64) into %bb.1, the shrink-wrapping pass will be
able to see %bb.0 as a candidate.
With this change I observed 12% more shrink-wrapping candidate and 13% more dead copies deleted in spec2000/2006/2017 on AArch64.
Reviewers: qcolombet, MatzeB, thegameg, mcrosier, gberry, hfinkel, john.brawn, twoh, RKSimon, sebpop, kparzysz
Reviewed By: sebpop
Subscribers: evandro, sebpop, sfertile, aemerson, mgorny, javed.absar, kristof.beyls, llvm-commits
Differential Revision: https://reviews.llvm.org/D41463
llvm-svn: 328237
2018-03-23 04:06:47 +08:00
|
|
|
; CHECK-NEXT: movl %edx, %r9d
|
2017-12-11 14:16:26 +08:00
|
|
|
; CHECK-NEXT: xorl %ecx, %ecx
|
|
|
|
|
; CHECK-NEXT: .p2align 4, 0x90
|
|
|
|
|
; CHECK-NEXT: .LBB12_2: # %for.body
|
|
|
|
|
; CHECK-NEXT: # =>This Inner Loop Header: Depth=1
|
|
|
|
|
; CHECK-NEXT: movdqa (%rdi,%rcx), %xmm0
|
|
|
|
|
; CHECK-NEXT: movdqa (%rsi,%rcx), %xmm1
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $1, %xmm1, %r8d
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %r8d
|
|
|
|
|
; CHECK-NEXT: movl %eax, %r8d
|
|
|
|
|
; CHECK-NEXT: movd %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: movd %xmm1, %r10d
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %r10d
|
|
|
|
|
; CHECK-NEXT: movd %eax, %xmm2
|
|
|
|
|
; CHECK-NEXT: pinsrd $1, %r8d, %xmm2
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm0, %eax
|
|
|
|
|
; CHECK-NEXT: pextrd $2, %xmm1, %r8d
|
|
|
|
|
; CHECK-NEXT: cltd
|
|
|
|
|
; CHECK-NEXT: idivl %r8d
|
|
|
|
|
; CHECK-NEXT: movl %eax, 8(%rdi,%rcx)
|
|
|
|
|
; CHECK-NEXT: movq %xmm2, (%rdi,%rcx)
|
|
|
|
|
; CHECK-NEXT: addq $16, %rcx
|
|
|
|
|
; CHECK-NEXT: decl %r9d
|
|
|
|
|
; CHECK-NEXT: jne .LBB12_2
|
|
|
|
|
; CHECK-NEXT: .LBB12_3: # %for.end
|
|
|
|
|
; CHECK-NEXT: retq
|
2010-02-11 07:37:45 +08:00
|
|
|
entry:
|
|
|
|
|
%cmp13 = icmp sgt i32 %n, 0
|
|
|
|
|
br i1 %cmp13, label %bb.nph, label %for.end
|
|
|
|
|
|
2017-12-11 14:16:26 +08:00
|
|
|
bb.nph:
|
2010-02-11 07:37:45 +08:00
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
|
|
for.body:
|
2017-12-11 14:16:26 +08:00
|
|
|
%i.014 = phi i32 [ 0, %bb.nph ], [ %inc, %for.body ]
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx11 = getelementptr <3 x i32>, <3 x i32>* %dest, i32 %i.014
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp4 = load <3 x i32>, <3 x i32>* %arrayidx11 ; <<3 x i32>> [#uses=1]
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx7 = getelementptr inbounds <3 x i32>, <3 x i32>* %old, i32 %i.014
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp8 = load <3 x i32>, <3 x i32>* %arrayidx7 ; <<3 x i32>> [#uses=1]
|
2010-02-11 07:37:45 +08:00
|
|
|
%div = sdiv <3 x i32> %tmp4, %tmp8
|
|
|
|
|
store <3 x i32> %div, <3 x i32>* %arrayidx11
|
|
|
|
|
%inc = add nsw i32 %i.014, 1
|
2017-12-11 14:16:26 +08:00
|
|
|
%exitcond = icmp eq i32 %inc, %n
|
2010-02-11 07:37:45 +08:00
|
|
|
br i1 %exitcond, label %for.end, label %for.body
|
|
|
|
|
|
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
|
|
|
ret void
|
|
|
|
|
}
|