2011-01-20 21:21:55 +08:00
|
|
|
; RUN: opt < %s -instsimplify -S | FileCheck %s
|
|
|
|
|
target datalayout = "p:32:32"
|
|
|
|
|
|
|
|
|
|
define i1 @ptrtoint() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @ptrtoint(
|
2011-01-20 21:21:55 +08:00
|
|
|
%a = alloca i8
|
|
|
|
|
%tmp = ptrtoint i8* %a to i32
|
|
|
|
|
%r = icmp eq i32 %tmp, 0
|
|
|
|
|
ret i1 %r
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-16 21:49:39 +08:00
|
|
|
define i1 @bitcast() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @bitcast(
|
2012-02-16 21:49:39 +08:00
|
|
|
%a = alloca i32
|
|
|
|
|
%b = alloca i64
|
|
|
|
|
%x = bitcast i32* %a to i8*
|
|
|
|
|
%y = bitcast i64* %b to i8*
|
|
|
|
|
%cmp = icmp eq i8* %x, %y
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep(
|
2012-02-16 21:49:39 +08:00
|
|
|
%a = alloca [3 x i8], align 8
|
[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
|
|
|
%x = getelementptr inbounds [3 x i8], [3 x i8]* %a, i32 0, i32 0
|
2012-02-16 21:49:39 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-18 11:29:25 +08:00
|
|
|
define i1 @gep2() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep2(
|
2012-02-18 11:29:25 +08:00
|
|
|
%a = alloca [3 x i8], align 8
|
[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
|
|
|
%x = getelementptr inbounds [3 x i8], [3 x i8]* %a, i32 0, i32 0
|
|
|
|
|
%y = getelementptr inbounds [3 x i8], [3 x i8]* %a, i32 0, i32 0
|
2012-02-18 11:29:25 +08:00
|
|
|
%cmp = icmp eq i8* %x, %y
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-26 10:09:49 +08:00
|
|
|
; PR11238
|
|
|
|
|
%gept = type { i32, i32 }
|
|
|
|
|
@gepy = global %gept zeroinitializer, align 8
|
|
|
|
|
@gepz = extern_weak global %gept
|
|
|
|
|
|
|
|
|
|
define i1 @gep3() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep3(
|
2012-02-26 10:09:49 +08:00
|
|
|
%x = alloca %gept, align 8
|
[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
|
|
|
%a = getelementptr %gept, %gept* %x, i64 0, i32 0
|
|
|
|
|
%b = getelementptr %gept, %gept* %x, i64 0, i32 1
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp eq i32* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep4() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep4(
|
2012-02-26 10:09:49 +08:00
|
|
|
%x = alloca %gept, align 8
|
[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
|
|
|
%a = getelementptr %gept, %gept* @gepy, i64 0, i32 0
|
|
|
|
|
%b = getelementptr %gept, %gept* @gepy, i64 0, i32 1
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp eq i32* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2016-12-12 04:07:02 +08:00
|
|
|
@a = common global [1 x i32] zeroinitializer, align 4
|
|
|
|
|
|
|
|
|
|
define i1 @PR31262() {
|
|
|
|
|
; CHECK-LABEL: @PR31262(
|
2017-06-06 18:17:14 +08:00
|
|
|
; CHECK-NEXT: ret i1 icmp uge (i32* getelementptr ([1 x i32], [1 x i32]* @a, i32 0, i32 undef), i32* getelementptr inbounds ([1 x i32], [1 x i32]* @a, i32 0, i32 0))
|
2016-12-12 04:07:02 +08:00
|
|
|
;
|
|
|
|
|
%idx = getelementptr inbounds [1 x i32], [1 x i32]* @a, i64 0, i64 undef
|
|
|
|
|
%cmp = icmp uge i32* %idx, getelementptr inbounds ([1 x i32], [1 x i32]* @a, i32 0, i32 0)
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
}
|
|
|
|
|
|
2012-02-26 10:09:49 +08:00
|
|
|
define i1 @gep5() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep5(
|
2012-02-26 10:09:49 +08:00
|
|
|
%x = alloca %gept, align 8
|
[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
|
|
|
%a = getelementptr inbounds %gept, %gept* %x, i64 0, i32 1
|
|
|
|
|
%b = getelementptr %gept, %gept* @gepy, i64 0, i32 0
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp eq i32* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep6(%gept* %x) {
|
|
|
|
|
; Same as @gep3 but potentially null.
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep6(
|
[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
|
|
|
%a = getelementptr %gept, %gept* %x, i64 0, i32 0
|
|
|
|
|
%b = getelementptr %gept, %gept* %x, i64 0, i32 1
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp eq i32* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep7(%gept* %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep7(
|
[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
|
|
|
%a = getelementptr %gept, %gept* %x, i64 0, i32 0
|
|
|
|
|
%b = getelementptr %gept, %gept* @gepz, i64 0, i32 0
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp eq i32* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK: ret i1 %equal
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep8(%gept* %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep8(
|
[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
|
|
|
%a = getelementptr %gept, %gept* %x, i32 1
|
|
|
|
|
%b = getelementptr %gept, %gept* %x, i32 -1
|
2012-02-26 10:09:49 +08:00
|
|
|
%equal = icmp ugt %gept* %a, %b
|
|
|
|
|
ret i1 %equal
|
|
|
|
|
; CHECK: ret i1 %equal
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-26 05:28:14 +08:00
|
|
|
define i1 @gep9(i8* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep9(
|
2012-03-26 05:28:14 +08:00
|
|
|
; CHECK-NOT: ret
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
|
|
|
|
|
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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%first1 = getelementptr inbounds i8, i8* %ptr, i32 0
|
|
|
|
|
%first2 = getelementptr inbounds i8, i8* %first1, i32 1
|
|
|
|
|
%first3 = getelementptr inbounds i8, i8* %first2, i32 2
|
|
|
|
|
%first4 = getelementptr inbounds i8, i8* %first3, i32 4
|
|
|
|
|
%last1 = getelementptr inbounds i8, i8* %first2, i32 48
|
|
|
|
|
%last2 = getelementptr inbounds i8, i8* %last1, i32 8
|
|
|
|
|
%last3 = getelementptr inbounds i8, i8* %last2, i32 -4
|
|
|
|
|
%last4 = getelementptr inbounds i8, i8* %last3, i32 -4
|
2012-03-26 05:28:14 +08:00
|
|
|
%first.int = ptrtoint i8* %first4 to i32
|
|
|
|
|
%last.int = ptrtoint i8* %last4 to i32
|
|
|
|
|
%cmp = icmp ne i32 %last.int, %first.int
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep10(i8* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep10(
|
2012-03-26 05:28:14 +08:00
|
|
|
; CHECK-NOT: ret
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
|
|
|
|
|
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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
|
|
|
|
|
%first2 = getelementptr inbounds i8, i8* %first1, i32 44
|
|
|
|
|
%last1 = getelementptr inbounds i8, i8* %ptr, i32 48
|
|
|
|
|
%last2 = getelementptr inbounds i8, i8* %last1, i32 -6
|
2012-03-26 05:28:14 +08:00
|
|
|
%first.int = ptrtoint i8* %first2 to i32
|
|
|
|
|
%last.int = ptrtoint i8* %last2 to i32
|
|
|
|
|
%cmp = icmp eq i32 %last.int, %first.int
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep11(i8* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep11(
|
2012-03-26 05:28:14 +08:00
|
|
|
; CHECK-NOT: ret
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
|
|
|
|
|
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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
|
|
|
|
|
%last1 = getelementptr inbounds i8, i8* %ptr, i32 48
|
|
|
|
|
%last2 = getelementptr inbounds i8, i8* %last1, i32 -6
|
2012-03-26 05:28:14 +08:00
|
|
|
%cmp = icmp ult i8* %first1, %last2
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep12(i8* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep12(
|
2012-03-26 05:28:14 +08:00
|
|
|
; CHECK-NOT: ret
|
|
|
|
|
; CHECK: ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%first1 = getelementptr inbounds i8, i8* %ptr, i32 -2
|
|
|
|
|
%last1 = getelementptr inbounds i8, i8* %ptr, i32 48
|
|
|
|
|
%last2 = getelementptr inbounds i8, i8* %last1, i32 -6
|
2012-03-26 05:28:14 +08:00
|
|
|
%cmp = icmp slt i8* %first1, %last2
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
}
|
2012-12-07 10:08:58 +08:00
|
|
|
|
|
|
|
|
define i1 @gep13(i8* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep13(
|
2012-12-07 10:08:58 +08:00
|
|
|
; We can prove this GEP is non-null because it is inbounds.
|
[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
|
|
|
%x = getelementptr inbounds i8, i8* %ptr, i32 1
|
2012-12-07 10:08:58 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep14({ {}, i8 }* %ptr) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep14(
|
2012-12-07 10:08:58 +08:00
|
|
|
; We can't simplify this because the offset of one in the GEP actually doesn't
|
|
|
|
|
; move the pointer.
|
[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
|
|
|
%x = getelementptr inbounds { {}, i8 }, { {}, i8 }* %ptr, i32 0, i32 1
|
2012-12-07 10:08:58 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NOT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep15({ {}, [4 x {i8, i8}]}* %ptr, i32 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep15(
|
2012-12-07 10:08:58 +08:00
|
|
|
; We can prove this GEP is non-null even though there is a user value, as we
|
|
|
|
|
; would necessarily violate inbounds on one side or the other.
|
[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
|
|
|
%x = getelementptr inbounds { {}, [4 x {i8, i8}]}, { {}, [4 x {i8, i8}]}* %ptr, i32 0, i32 1, i32 %y, i32 1
|
2012-12-07 10:08:58 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @gep16(i8* %ptr, i32 %a) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @gep16(
|
2012-12-07 10:08:58 +08:00
|
|
|
; We can prove this GEP is non-null because it is inbounds and because we know
|
|
|
|
|
; %b is non-zero even though we don't know its value.
|
|
|
|
|
%b = or i32 %a, 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
|
|
|
%x = getelementptr inbounds i8, i8* %ptr, i32 %b
|
2012-12-07 10:08:58 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
2012-03-26 05:28:14 +08:00
|
|
|
|
2016-08-07 15:58:10 +08:00
|
|
|
define i1 @gep17() {
|
|
|
|
|
; CHECK-LABEL: @gep17(
|
|
|
|
|
%alloca = alloca i32, align 4
|
|
|
|
|
%bc = bitcast i32* %alloca to [4 x i8]*
|
|
|
|
|
%gep1 = getelementptr inbounds i32, i32* %alloca, i32 1
|
|
|
|
|
%pti1 = ptrtoint i32* %gep1 to i32
|
|
|
|
|
%gep2 = getelementptr inbounds [4 x i8], [4 x i8]* %bc, i32 0, i32 1
|
|
|
|
|
%pti2 = ptrtoint i8* %gep2 to i32
|
|
|
|
|
%cmp = icmp ugt i32 %pti1, %pti2
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-20 21:21:55 +08:00
|
|
|
define i1 @zext(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @zext(
|
2011-01-20 21:21:55 +08:00
|
|
|
%e1 = zext i32 %x to i64
|
|
|
|
|
%e2 = zext i32 %x to i64
|
|
|
|
|
%r = icmp eq i64 %e1, %e2
|
|
|
|
|
ret i1 %r
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @zext2(i1 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @zext2(
|
2011-01-20 21:21:55 +08:00
|
|
|
%e = zext i1 %x to i32
|
|
|
|
|
%c = icmp ne i32 %e, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %x
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-25 17:38:29 +08:00
|
|
|
define i1 @zext3() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @zext3(
|
2011-01-25 17:38:29 +08:00
|
|
|
%e = zext i1 1 to i32
|
|
|
|
|
%c = icmp ne i32 %e, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-20 21:21:55 +08:00
|
|
|
define i1 @sext(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @sext(
|
2011-01-20 21:21:55 +08:00
|
|
|
%e1 = sext i32 %x to i64
|
|
|
|
|
%e2 = sext i32 %x to i64
|
|
|
|
|
%r = icmp eq i64 %e1, %e2
|
|
|
|
|
ret i1 %r
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @sext2(i1 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @sext2(
|
2011-01-20 21:21:55 +08:00
|
|
|
%e = sext i1 %x to i32
|
|
|
|
|
%c = icmp ne i32 %e, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %x
|
|
|
|
|
}
|
2011-01-25 17:38:29 +08:00
|
|
|
|
|
|
|
|
define i1 @sext3() {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @sext3(
|
2011-01-25 17:38:29 +08:00
|
|
|
%e = sext i1 1 to i32
|
|
|
|
|
%c = icmp ne i32 %e, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @add(i32 %x, i32 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add(
|
2011-01-25 17:38:29 +08:00
|
|
|
%l = lshr i32 %x, 1
|
2011-01-25 23:14:15 +08:00
|
|
|
%q = lshr i32 %y, 1
|
|
|
|
|
%r = or i32 %q, 1
|
2011-01-25 17:38:29 +08:00
|
|
|
%s = add i32 %l, %r
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
2011-01-25 23:14:15 +08:00
|
|
|
; CHECK: ret i1 false
|
2011-01-25 17:38:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @add2(i8 %x, i8 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add2(
|
2011-01-25 17:38:29 +08:00
|
|
|
%l = or i8 %x, 128
|
|
|
|
|
%r = or i8 %y, 129
|
|
|
|
|
%s = add i8 %l, %r
|
|
|
|
|
%c = icmp eq i8 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-25 23:14:15 +08:00
|
|
|
define i1 @add3(i8 %x, i8 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add3(
|
2011-01-25 23:14:15 +08:00
|
|
|
%l = zext i8 %x to i32
|
|
|
|
|
%r = zext i8 %y to i32
|
|
|
|
|
%s = add i32 %l, %r
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %c
|
|
|
|
|
}
|
|
|
|
|
|
2011-02-14 01:15:40 +08:00
|
|
|
define i1 @add4(i32 %x, i32 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add4(
|
2011-02-14 01:15:40 +08:00
|
|
|
%z = add nsw i32 %y, 1
|
|
|
|
|
%s1 = add nsw i32 %x, %y
|
|
|
|
|
%s2 = add nsw i32 %x, %z
|
|
|
|
|
%c = icmp slt i32 %s1, %s2
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @add5(i32 %x, i32 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add5(
|
2011-02-14 01:15:40 +08:00
|
|
|
%z = add nuw i32 %y, 1
|
|
|
|
|
%s1 = add nuw i32 %x, %z
|
|
|
|
|
%s2 = add nuw i32 %x, %y
|
|
|
|
|
%c = icmp ugt i32 %s1, %s2
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2012-11-17 03:41:26 +08:00
|
|
|
define i1 @add6(i64 %A, i64 %B) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @add6(
|
2012-11-17 03:41:26 +08:00
|
|
|
%s1 = add i64 %A, %B
|
|
|
|
|
%s2 = add i64 %B, %A
|
|
|
|
|
%cmp = icmp eq i64 %s1, %s2
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-01-25 17:38:29 +08:00
|
|
|
define i1 @addpowtwo(i32 %x, i32 %y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @addpowtwo(
|
2011-01-25 17:38:29 +08:00
|
|
|
%l = lshr i32 %x, 1
|
|
|
|
|
%r = shl i32 1, %y
|
|
|
|
|
%s = add i32 %l, %r
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @or(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @or(
|
2011-01-25 17:38:29 +08:00
|
|
|
%o = or i32 %x, 1
|
|
|
|
|
%c = icmp eq i32 %o, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
2011-01-29 21:27:00 +08:00
|
|
|
|
2016-02-12 01:11:49 +08:00
|
|
|
; Do not simplify if we cannot guarantee that the ConstantExpr is a non-zero
|
|
|
|
|
; constant.
|
|
|
|
|
@GV = common global i32* null
|
|
|
|
|
define i1 @or_constexp(i32 %x) {
|
|
|
|
|
; CHECK-LABEL: @or_constexp(
|
|
|
|
|
entry:
|
|
|
|
|
%0 = and i32 ptrtoint (i32** @GV to i32), 32
|
|
|
|
|
%o = or i32 %x, %0
|
|
|
|
|
%c = icmp eq i32 %o, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: or
|
|
|
|
|
; CHECK-NEXT: icmp eq
|
|
|
|
|
; CHECK-NOT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-28 11:34:28 +08:00
|
|
|
define i1 @shl1(i32 %x) {
|
|
|
|
|
; CHECK-LABEL: @shl1(
|
2011-01-29 21:27:00 +08:00
|
|
|
%s = shl i32 1, %x
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-28 11:34:28 +08:00
|
|
|
define i1 @shl3(i32 %X) {
|
|
|
|
|
; CHECK: @shl3
|
|
|
|
|
%sub = shl nuw i32 4, %X
|
|
|
|
|
%cmp = icmp eq i32 %sub, 31
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-04 15:00:57 +08:00
|
|
|
define i1 @lshr1(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @lshr1(
|
2011-01-29 21:27:00 +08:00
|
|
|
%s = lshr i32 -1, %x
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-10 06:01:22 +08:00
|
|
|
define i1 @lshr3(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @lshr3(
|
2013-07-10 06:01:22 +08:00
|
|
|
%s = lshr i32 %x, %x
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2016-01-22 02:55:54 +08:00
|
|
|
define i1 @lshr4(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @lshr4(
|
|
|
|
|
%A = lshr i32 %X, %Y
|
|
|
|
|
%C = icmp ule i32 %A, %X
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @lshr5(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @lshr5(
|
|
|
|
|
%A = lshr i32 %X, %Y
|
|
|
|
|
%C = icmp ugt i32 %A, %X
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-27 03:18:43 +08:00
|
|
|
define i1 @lshr6(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @lshr6(
|
|
|
|
|
%A = lshr i32 %X, %Y
|
|
|
|
|
%C = icmp ult i32 %X, %A
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @lshr7(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @lshr7(
|
|
|
|
|
%A = lshr i32 %X, %Y
|
|
|
|
|
%C = icmp uge i32 %X, %A
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-04 15:00:57 +08:00
|
|
|
define i1 @ashr1(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @ashr1(
|
2011-01-29 21:27:00 +08:00
|
|
|
%s = ashr i32 -1, %x
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
2011-02-03 17:37:39 +08:00
|
|
|
|
2013-07-10 06:01:22 +08:00
|
|
|
define i1 @ashr3(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @ashr3(
|
2013-07-10 06:01:22 +08:00
|
|
|
%s = ashr i32 %x, %x
|
|
|
|
|
%c = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-02-03 17:37:39 +08:00
|
|
|
define i1 @select1(i1 %cond) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select1(
|
2011-02-03 17:37:39 +08:00
|
|
|
%s = select i1 %cond, i32 1, i32 0
|
|
|
|
|
%c = icmp eq i32 %s, 1
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %cond
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @select2(i1 %cond) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select2(
|
2011-02-03 17:37:39 +08:00
|
|
|
%x = zext i1 %cond to i32
|
|
|
|
|
%s = select i1 %cond, i32 %x, i32 0
|
|
|
|
|
%c = icmp ne i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %cond
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @select3(i1 %cond) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select3(
|
2011-02-03 17:37:39 +08:00
|
|
|
%x = zext i1 %cond to i32
|
|
|
|
|
%s = select i1 %cond, i32 1, i32 %x
|
|
|
|
|
%c = icmp ne i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %cond
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @select4(i1 %cond) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select4(
|
2011-02-03 17:37:39 +08:00
|
|
|
%invert = xor i1 %cond, 1
|
|
|
|
|
%s = select i1 %invert, i32 0, i32 1
|
|
|
|
|
%c = icmp ne i32 %s, 0
|
|
|
|
|
ret i1 %c
|
|
|
|
|
; CHECK: ret i1 %cond
|
|
|
|
|
}
|
2011-03-01 16:15:50 +08:00
|
|
|
|
2011-10-31 03:56:36 +08:00
|
|
|
define i1 @select5(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select5(
|
2011-10-31 03:56:36 +08:00
|
|
|
%c = icmp eq i32 %x, 0
|
|
|
|
|
%s = select i1 %c, i32 1, i32 %x
|
|
|
|
|
%c2 = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c2
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @select6(i32 %x) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @select6(
|
2011-10-31 03:56:36 +08:00
|
|
|
%c = icmp sgt i32 %x, 0
|
|
|
|
|
%s = select i1 %c, i32 %x, i32 4
|
|
|
|
|
%c2 = icmp eq i32 %s, 0
|
|
|
|
|
ret i1 %c2
|
|
|
|
|
; CHECK: ret i1 %c2
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-01 16:15:50 +08:00
|
|
|
define i1 @urem1(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem1(
|
2011-03-01 16:15:50 +08:00
|
|
|
%A = urem i32 %X, %Y
|
|
|
|
|
%B = icmp ult i32 %A, %Y
|
|
|
|
|
ret i1 %B
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @urem2(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem2(
|
2011-03-01 16:15:50 +08:00
|
|
|
%A = urem i32 %X, %Y
|
|
|
|
|
%B = icmp eq i32 %A, %Y
|
|
|
|
|
ret i1 %B
|
2011-03-10 06:07:31 +08:00
|
|
|
; CHECK: ret i1 false
|
2011-03-01 16:15:50 +08:00
|
|
|
}
|
2011-03-04 15:00:57 +08:00
|
|
|
|
|
|
|
|
define i1 @urem4(i32 %X) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem4(
|
2011-03-04 15:00:57 +08:00
|
|
|
%A = urem i32 %X, 15
|
|
|
|
|
%B = icmp ult i32 %A, 10
|
|
|
|
|
ret i1 %B
|
|
|
|
|
; CHECK: ret i1 %B
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-04 18:06:52 +08:00
|
|
|
define i1 @urem5(i16 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem5(
|
2011-03-04 18:06:52 +08:00
|
|
|
%A = zext i16 %X to i32
|
|
|
|
|
%B = urem i32 %A, %Y
|
|
|
|
|
%C = icmp slt i32 %B, %Y
|
|
|
|
|
ret i1 %C
|
2013-07-13 07:42:57 +08:00
|
|
|
; CHECK-NOT: ret i1 true
|
2011-03-04 18:06:52 +08:00
|
|
|
}
|
|
|
|
|
|
2011-03-09 14:26:03 +08:00
|
|
|
define i1 @urem6(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem6(
|
2011-03-09 14:26:03 +08:00
|
|
|
%A = urem i32 %X, %Y
|
|
|
|
|
%B = icmp ugt i32 %Y, %A
|
|
|
|
|
ret i1 %B
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-13 07:42:57 +08:00
|
|
|
define i1 @urem7(i32 %X) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @urem7(
|
2013-07-13 07:42:57 +08:00
|
|
|
%A = urem i32 1, %X
|
|
|
|
|
%B = icmp sgt i32 %A, %X
|
|
|
|
|
ret i1 %B
|
|
|
|
|
; CHECK-NOT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-11 17:00:19 +08:00
|
|
|
; PR9343 #15
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @srem2(
|
2011-03-11 17:00:19 +08:00
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
define i1 @srem2(i16 %X, i32 %Y) {
|
|
|
|
|
%A = zext i16 %X to i32
|
|
|
|
|
%B = add nsw i32 %A, 1
|
|
|
|
|
%C = srem i32 %B, %Y
|
|
|
|
|
%D = icmp slt i32 %C, 0
|
|
|
|
|
ret i1 %D
|
|
|
|
|
}
|
2011-03-13 01:18:11 +08:00
|
|
|
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @srem3(
|
2011-03-13 01:18:11 +08:00
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
define i1 @srem3(i16 %X, i32 %Y) {
|
|
|
|
|
%A = zext i16 %X to i32
|
|
|
|
|
%B = or i32 2147483648, %A
|
|
|
|
|
%C = sub nsw i32 1, %B
|
|
|
|
|
%D = srem i32 %C, %Y
|
|
|
|
|
%E = icmp slt i32 %D, 0
|
|
|
|
|
ret i1 %E
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-08 02:19:13 +08:00
|
|
|
define i1 @udiv2(i32 %Z) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @udiv2(
|
2017-05-08 02:19:13 +08:00
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
;
|
2011-03-05 13:19:11 +08:00
|
|
|
%A = udiv exact i32 10, %Z
|
|
|
|
|
%B = udiv exact i32 20, %Z
|
|
|
|
|
%C = icmp ult i32 %A, %B
|
|
|
|
|
ret i1 %C
|
2017-05-08 02:19:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Exact sdiv and equality preds can simplify.
|
|
|
|
|
|
|
|
|
|
define i1 @sdiv_exact_equality(i32 %Z) {
|
|
|
|
|
; CHECK-LABEL: @sdiv_exact_equality(
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
;
|
|
|
|
|
%A = sdiv exact i32 10, %Z
|
|
|
|
|
%B = sdiv exact i32 20, %Z
|
|
|
|
|
%C = icmp eq i32 %A, %B
|
|
|
|
|
ret i1 %C
|
|
|
|
|
}
|
|
|
|
|
|
2017-05-16 03:16:49 +08:00
|
|
|
; But not other preds: PR32949 - https://bugs.llvm.org/show_bug.cgi?id=32949
|
2017-05-08 02:19:13 +08:00
|
|
|
|
|
|
|
|
define i1 @sdiv_exact_not_equality(i32 %Z) {
|
|
|
|
|
; CHECK-LABEL: @sdiv_exact_not_equality(
|
2017-05-16 03:16:49 +08:00
|
|
|
; CHECK-NEXT: [[A:%.*]] = sdiv exact i32 10, %Z
|
|
|
|
|
; CHECK-NEXT: [[B:%.*]] = sdiv exact i32 20, %Z
|
|
|
|
|
; CHECK-NEXT: [[C:%.*]] = icmp ult i32 [[A]], [[B]]
|
|
|
|
|
; CHECK-NEXT: ret i1 [[C]]
|
2017-05-08 02:19:13 +08:00
|
|
|
;
|
|
|
|
|
%A = sdiv exact i32 10, %Z
|
|
|
|
|
%B = sdiv exact i32 20, %Z
|
|
|
|
|
%C = icmp ult i32 %A, %B
|
|
|
|
|
ret i1 %C
|
2011-03-05 13:19:11 +08:00
|
|
|
}
|
|
|
|
|
|
2011-10-29 02:17:44 +08:00
|
|
|
define i1 @udiv3(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @udiv3(
|
2011-10-29 02:17:44 +08:00
|
|
|
%A = udiv i32 %X, %Y
|
|
|
|
|
%C = icmp ugt i32 %A, %X
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @udiv4(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @udiv4(
|
2011-10-29 02:17:44 +08:00
|
|
|
%A = udiv i32 %X, %Y
|
|
|
|
|
%C = icmp ule i32 %A, %X
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-11-09 05:08:02 +08:00
|
|
|
; PR11340
|
|
|
|
|
define i1 @udiv6(i32 %X) nounwind {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @udiv6(
|
2011-11-09 05:08:02 +08:00
|
|
|
%A = udiv i32 1, %X
|
|
|
|
|
%C = icmp eq i32 %A, 0
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 %C
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-27 03:18:43 +08:00
|
|
|
define i1 @udiv7(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @udiv7(
|
|
|
|
|
%A = udiv i32 %X, %Y
|
|
|
|
|
%C = icmp ult i32 %X, %A
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @udiv8(i32 %X, i32 %Y) {
|
|
|
|
|
; CHECK-LABEL: @udiv8(
|
|
|
|
|
%A = udiv i32 %X, %Y
|
|
|
|
|
%C = icmp uge i32 %X, %A
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2011-10-28 03:16:21 +08:00
|
|
|
define i1 @mul1(i32 %X) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @mul1(
|
2011-10-28 03:16:21 +08:00
|
|
|
; Square of a non-zero number is non-zero if there is no overflow.
|
|
|
|
|
%Y = or i32 %X, 1
|
|
|
|
|
%M = mul nuw i32 %Y, %Y
|
|
|
|
|
%C = icmp eq i32 %M, 0
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @mul2(i32 %X) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @mul2(
|
2011-10-28 03:16:21 +08:00
|
|
|
; Square of a non-zero number is positive if there is no signed overflow.
|
|
|
|
|
%Y = or i32 %X, 1
|
|
|
|
|
%M = mul nsw i32 %Y, %Y
|
|
|
|
|
%C = icmp sgt i32 %M, 0
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @mul3(i32 %X, i32 %Y) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @mul3(
|
2011-10-28 03:16:21 +08:00
|
|
|
; Product of non-negative numbers is non-negative if there is no signed overflow.
|
|
|
|
|
%XX = mul nsw i32 %X, %X
|
|
|
|
|
%YY = mul nsw i32 %Y, %Y
|
|
|
|
|
%M = mul nsw i32 %XX, %YY
|
|
|
|
|
%C = icmp sge i32 %M, 0
|
|
|
|
|
ret i1 %C
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
2012-02-10 22:26:42 +08:00
|
|
|
|
|
|
|
|
define <2 x i1> @vectorselect1(<2 x i1> %cond) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @vectorselect1(
|
2012-02-10 22:26:42 +08:00
|
|
|
%invert = xor <2 x i1> %cond, <i1 1, i1 1>
|
|
|
|
|
%s = select <2 x i1> %invert, <2 x i32> <i32 0, i32 0>, <2 x i32> <i32 1, i32 1>
|
|
|
|
|
%c = icmp ne <2 x i32> %s, <i32 0, i32 0>
|
|
|
|
|
ret <2 x i1> %c
|
|
|
|
|
; CHECK: ret <2 x i1> %cond
|
|
|
|
|
}
|
2012-02-10 22:31:24 +08:00
|
|
|
|
fold comparisons of gep'd alloca points with null to false,
implementing PR12013. We now compile the testcase to:
__Z4testv: ## @_Z4testv
## BB#0: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
pushq %rbx
subq $64, %rsp
leaq 32(%rsp), %rbx
movq %rbx, (%rsp)
leaq 64(%rsp), %rax
movq %rax, 16(%rsp)
movl $1, 32(%rsp)
leaq 36(%rsp), %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_2
## BB#1:
callq _free
LBB0_2: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
instead of:
__Z4testv: ## @_Z4testv
## BB#0:
pushq %rbx
subq $64, %rsp
xorl %eax, %eax
leaq (%rsp), %rbx
addq $32, %rbx
movq %rbx, (%rsp)
movq %rbx, 8(%rsp)
leaq 64(%rsp), %rcx
movq %rcx, 16(%rsp)
je LBB0_2
## BB#1:
movl $1, 32(%rsp)
movq %rbx, %rax
LBB0_2: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
addq $4, %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_4
## BB#3:
callq _free
LBB0_4: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
This doesn't shrink clang noticably though.
llvm-svn: 150944
2012-02-20 08:42:49 +08:00
|
|
|
; PR11948
|
|
|
|
|
define <2 x i1> @vectorselectcrash(i32 %arg1) {
|
2012-02-10 22:31:24 +08:00
|
|
|
%tobool40 = icmp ne i32 %arg1, 0
|
|
|
|
|
%cond43 = select i1 %tobool40, <2 x i16> <i16 -5, i16 66>, <2 x i16> <i16 46, i16 1>
|
|
|
|
|
%cmp45 = icmp ugt <2 x i16> %cond43, <i16 73, i16 21>
|
|
|
|
|
ret <2 x i1> %cmp45
|
|
|
|
|
}
|
fold comparisons of gep'd alloca points with null to false,
implementing PR12013. We now compile the testcase to:
__Z4testv: ## @_Z4testv
## BB#0: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
pushq %rbx
subq $64, %rsp
leaq 32(%rsp), %rbx
movq %rbx, (%rsp)
leaq 64(%rsp), %rax
movq %rax, 16(%rsp)
movl $1, 32(%rsp)
leaq 36(%rsp), %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_2
## BB#1:
callq _free
LBB0_2: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
instead of:
__Z4testv: ## @_Z4testv
## BB#0:
pushq %rbx
subq $64, %rsp
xorl %eax, %eax
leaq (%rsp), %rbx
addq $32, %rbx
movq %rbx, (%rsp)
movq %rbx, 8(%rsp)
leaq 64(%rsp), %rcx
movq %rcx, 16(%rsp)
je LBB0_2
## BB#1:
movl $1, 32(%rsp)
movq %rbx, %rax
LBB0_2: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
addq $4, %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_4
## BB#3:
callq _free
LBB0_4: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
This doesn't shrink clang noticably though.
llvm-svn: 150944
2012-02-20 08:42:49 +08:00
|
|
|
|
|
|
|
|
; PR12013
|
|
|
|
|
define i1 @alloca_compare(i64 %idx) {
|
|
|
|
|
%sv = alloca { i32, i32, [124 x i32] }
|
[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
|
|
|
%1 = getelementptr inbounds { i32, i32, [124 x i32] }, { i32, i32, [124 x i32] }* %sv, i32 0, i32 2, i64 %idx
|
fold comparisons of gep'd alloca points with null to false,
implementing PR12013. We now compile the testcase to:
__Z4testv: ## @_Z4testv
## BB#0: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
pushq %rbx
subq $64, %rsp
leaq 32(%rsp), %rbx
movq %rbx, (%rsp)
leaq 64(%rsp), %rax
movq %rax, 16(%rsp)
movl $1, 32(%rsp)
leaq 36(%rsp), %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_2
## BB#1:
callq _free
LBB0_2: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
instead of:
__Z4testv: ## @_Z4testv
## BB#0:
pushq %rbx
subq $64, %rsp
xorl %eax, %eax
leaq (%rsp), %rbx
addq $32, %rbx
movq %rbx, (%rsp)
movq %rbx, 8(%rsp)
leaq 64(%rsp), %rcx
movq %rcx, 16(%rsp)
je LBB0_2
## BB#1:
movl $1, 32(%rsp)
movq %rbx, %rax
LBB0_2: ## %_ZN4llvm15SmallVectorImplIiE9push_backERKi.exit
addq $4, %rax
movq %rax, 8(%rsp)
leaq (%rsp), %rdi
callq __Z1gRN4llvm11SmallVectorIiLj8EEE
movq (%rsp), %rdi
cmpq %rbx, %rdi
je LBB0_4
## BB#3:
callq _free
LBB0_4: ## %_ZN4llvm11SmallVectorIiLj8EED1Ev.exit
addq $64, %rsp
popq %rbx
ret
This doesn't shrink clang noticably though.
llvm-svn: 150944
2012-02-20 08:42:49 +08:00
|
|
|
%2 = icmp eq i32* %1, null
|
|
|
|
|
ret i1 %2
|
|
|
|
|
; CHECK: alloca_compare
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
2012-02-25 03:01:58 +08:00
|
|
|
|
|
|
|
|
; PR12075
|
|
|
|
|
define i1 @infinite_gep() {
|
|
|
|
|
ret i1 1
|
|
|
|
|
|
|
|
|
|
unreachableblock:
|
[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
|
|
|
%X = getelementptr i32, i32 *%X, i32 1
|
2012-02-25 03:01:58 +08:00
|
|
|
%Y = icmp eq i32* %X, null
|
|
|
|
|
ret i1 %Y
|
|
|
|
|
}
|
2013-02-01 07:49:33 +08:00
|
|
|
|
|
|
|
|
; It's not valid to fold a comparison of an argument with an alloca, even though
|
|
|
|
|
; that's tempting. An argument can't *alias* an alloca, however the aliasing rule
|
|
|
|
|
; relies on restrictions against guessing an object's address and dereferencing.
|
|
|
|
|
; There are no restrictions against guessing an object's address and comparing.
|
|
|
|
|
|
|
|
|
|
define i1 @alloca_argument_compare(i64* %arg) {
|
|
|
|
|
%alloc = alloca i64
|
|
|
|
|
%cmp = icmp eq i64* %arg, %alloc
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK: alloca_argument_compare
|
|
|
|
|
; CHECK: ret i1 %cmp
|
|
|
|
|
}
|
2013-02-01 08:11:13 +08:00
|
|
|
|
|
|
|
|
; As above, but with the operands reversed.
|
|
|
|
|
|
|
|
|
|
define i1 @alloca_argument_compare_swapped(i64* %arg) {
|
|
|
|
|
%alloc = alloca i64
|
|
|
|
|
%cmp = icmp eq i64* %alloc, %arg
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK: alloca_argument_compare_swapped
|
|
|
|
|
; CHECK: ret i1 %cmp
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Don't assume that a noalias argument isn't equal to a global variable's
|
|
|
|
|
; address. This is an example where AliasAnalysis' NoAlias concept is
|
|
|
|
|
; different from actual pointer inequality.
|
|
|
|
|
|
|
|
|
|
@y = external global i32
|
|
|
|
|
define zeroext i1 @external_compare(i32* noalias %x) {
|
|
|
|
|
%cmp = icmp eq i32* %x, @y
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK: external_compare
|
|
|
|
|
; CHECK: ret i1 %cmp
|
|
|
|
|
}
|
2013-03-19 05:23:25 +08:00
|
|
|
|
|
|
|
|
define i1 @alloca_gep(i64 %a, i64 %b) {
|
2013-07-14 09:42:54 +08:00
|
|
|
; CHECK-LABEL: @alloca_gep(
|
2013-03-19 05:23:25 +08:00
|
|
|
; We can prove this GEP is non-null because it is inbounds and the pointer
|
|
|
|
|
; is non-null.
|
|
|
|
|
%strs = alloca [1000 x [1001 x i8]], align 16
|
[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
|
|
|
%x = getelementptr inbounds [1000 x [1001 x i8]], [1000 x [1001 x i8]]* %strs, i64 0, i64 %a, i64 %b
|
2013-03-19 05:23:25 +08:00
|
|
|
%cmp = icmp eq i8* %x, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
2013-09-23 22:16:38 +08:00
|
|
|
|
|
|
|
|
define i1 @non_inbounds_gep_compare(i64* %a) {
|
|
|
|
|
; CHECK-LABEL: @non_inbounds_gep_compare(
|
|
|
|
|
; Equality compares with non-inbounds GEPs can be folded.
|
[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
|
|
|
%x = getelementptr i64, i64* %a, i64 42
|
|
|
|
|
%y = getelementptr inbounds i64, i64* %x, i64 -42
|
|
|
|
|
%z = getelementptr i64, i64* %a, i64 -42
|
|
|
|
|
%w = getelementptr inbounds i64, i64* %z, i64 42
|
2013-09-23 22:41:35 +08:00
|
|
|
%cmp = icmp eq i64* %y, %w
|
2013-09-23 22:16:38 +08:00
|
|
|
ret i1 %cmp
|
2013-09-23 22:41:35 +08:00
|
|
|
; CHECK-NEXT: ret i1 true
|
2013-09-23 22:16:38 +08:00
|
|
|
}
|
2013-09-29 05:27:49 +08:00
|
|
|
|
|
|
|
|
define i1 @non_inbounds_gep_compare2(i64* %a) {
|
|
|
|
|
; CHECK-LABEL: @non_inbounds_gep_compare2(
|
|
|
|
|
; Equality compares with non-inbounds GEPs can be folded.
|
[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
|
|
|
%x = getelementptr i64, i64* %a, i64 4294967297
|
|
|
|
|
%y = getelementptr i64, i64* %a, i64 1
|
2013-09-29 05:27:49 +08:00
|
|
|
%cmp = icmp eq i64* %y, %y
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
2014-01-25 01:09:53 +08:00
|
|
|
|
2014-05-15 04:16:28 +08:00
|
|
|
define i1 @compare_always_true_slt(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp slt i32 %2, 1
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_true_slt
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @compare_always_true_sle(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp sle i32 %2, 0
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_true_sle
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @compare_always_false_sgt(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp sgt i32 %2, 0
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_false_sgt
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @compare_always_false_sge(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp sge i32 %2, 1
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_false_sge
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @compare_always_false_eq(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp eq i32 %2, 1
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_false_eq
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @compare_always_false_ne(i16 %a) {
|
|
|
|
|
%1 = zext i16 %a to i32
|
|
|
|
|
%2 = sub nsw i32 0, %1
|
|
|
|
|
%3 = icmp ne i32 %2, 1
|
|
|
|
|
ret i1 %3
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @compare_always_false_ne
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
2014-05-17 00:57:04 +08:00
|
|
|
|
2014-05-17 01:14:03 +08:00
|
|
|
define i1 @lshr_ugt_false(i32 %a) {
|
|
|
|
|
%shr = lshr i32 1, %a
|
|
|
|
|
%cmp = icmp ugt i32 %shr, 1
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @lshr_ugt_false
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-05-20 13:13:21 +08:00
|
|
|
define i1 @nonnull_arg(i32* nonnull %i) {
|
|
|
|
|
%cmp = icmp eq i32* %i, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_arg
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-07-18 23:51:28 +08:00
|
|
|
define i1 @nonnull_deref_arg(i32* dereferenceable(4) %i) {
|
|
|
|
|
%cmp = icmp eq i32* %i, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_deref_arg
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @nonnull_deref_as_arg(i32 addrspace(1)* dereferenceable(4) %i) {
|
|
|
|
|
%cmp = icmp eq i32 addrspace(1)* %i, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_deref_as_arg
|
|
|
|
|
; CHECK: icmp
|
2015-03-14 09:43:57 +08:00
|
|
|
; CHECK: ret
|
2014-07-18 23:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
2014-05-20 13:13:21 +08:00
|
|
|
declare nonnull i32* @returns_nonnull_helper()
|
|
|
|
|
define i1 @returns_nonnull() {
|
|
|
|
|
%call = call nonnull i32* @returns_nonnull_helper()
|
|
|
|
|
%cmp = icmp eq i32* %call, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @returns_nonnull
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-07-18 23:51:28 +08:00
|
|
|
declare dereferenceable(4) i32* @returns_nonnull_deref_helper()
|
|
|
|
|
define i1 @returns_nonnull_deref() {
|
|
|
|
|
%call = call dereferenceable(4) i32* @returns_nonnull_deref_helper()
|
|
|
|
|
%cmp = icmp eq i32* %call, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @returns_nonnull_deref
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
declare dereferenceable(4) i32 addrspace(1)* @returns_nonnull_deref_as_helper()
|
|
|
|
|
define i1 @returns_nonnull_as_deref() {
|
|
|
|
|
%call = call dereferenceable(4) i32 addrspace(1)* @returns_nonnull_deref_as_helper()
|
|
|
|
|
%cmp = icmp eq i32 addrspace(1)* %call, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @returns_nonnull_as_deref
|
|
|
|
|
; CHECK: icmp
|
|
|
|
|
; CHECK: ret
|
|
|
|
|
}
|
|
|
|
|
|
2014-10-21 06:40:55 +08:00
|
|
|
define i1 @nonnull_load(i32** %addr) {
|
2015-02-28 05:17:42 +08:00
|
|
|
%ptr = load i32*, i32** %addr, !nonnull !{}
|
2014-10-21 06:40:55 +08:00
|
|
|
%cmp = icmp eq i32* %ptr, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_load
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @nonnull_load_as_outer(i32* addrspace(1)* %addr) {
|
2015-02-28 05:17:42 +08:00
|
|
|
%ptr = load i32*, i32* addrspace(1)* %addr, !nonnull !{}
|
2014-10-21 06:40:55 +08:00
|
|
|
%cmp = icmp eq i32* %ptr, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_load_as_outer
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
define i1 @nonnull_load_as_inner(i32 addrspace(1)** %addr) {
|
2015-02-28 05:17:42 +08:00
|
|
|
%ptr = load i32 addrspace(1)*, i32 addrspace(1)** %addr, !nonnull !{}
|
2014-10-21 06:40:55 +08:00
|
|
|
%cmp = icmp eq i32 addrspace(1)* %ptr, null
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
; CHECK-LABEL: @nonnull_load_as_inner
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
2014-06-19 11:35:49 +08:00
|
|
|
; If a bit is known to be zero for A and known to be one for B,
|
|
|
|
|
; then A and B cannot be equal.
|
2016-08-05 00:48:30 +08:00
|
|
|
define i1 @icmp_eq_const(i32 %a) {
|
|
|
|
|
; CHECK-LABEL: @icmp_eq_const(
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
;
|
2014-06-19 11:35:49 +08:00
|
|
|
%b = mul nsw i32 %a, -2
|
|
|
|
|
%c = icmp eq i32 %b, 1
|
|
|
|
|
ret i1 %c
|
2016-08-05 00:48:30 +08:00
|
|
|
}
|
2014-06-19 11:35:49 +08:00
|
|
|
|
2016-08-05 00:48:30 +08:00
|
|
|
define <2 x i1> @icmp_eq_const_vec(<2 x i32> %a) {
|
|
|
|
|
; CHECK-LABEL: @icmp_eq_const_vec(
|
2016-08-05 01:48:04 +08:00
|
|
|
; CHECK-NEXT: ret <2 x i1> zeroinitializer
|
2016-08-05 00:48:30 +08:00
|
|
|
;
|
|
|
|
|
%b = mul nsw <2 x i32> %a, <i32 -2, i32 -2>
|
|
|
|
|
%c = icmp eq <2 x i32> %b, <i32 1, i32 1>
|
|
|
|
|
ret <2 x i1> %c
|
2014-06-19 11:35:49 +08:00
|
|
|
}
|
|
|
|
|
|
2016-08-05 00:48:30 +08:00
|
|
|
define i1 @icmp_ne_const(i32 %a) {
|
|
|
|
|
; CHECK-LABEL: @icmp_ne_const(
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
;
|
2014-06-19 11:35:49 +08:00
|
|
|
%b = mul nsw i32 %a, -2
|
|
|
|
|
%c = icmp ne i32 %b, 1
|
|
|
|
|
ret i1 %c
|
2016-08-05 00:48:30 +08:00
|
|
|
}
|
2014-06-19 11:35:49 +08:00
|
|
|
|
2016-08-05 00:48:30 +08:00
|
|
|
define <2 x i1> @icmp_ne_const_vec(<2 x i32> %a) {
|
|
|
|
|
; CHECK-LABEL: @icmp_ne_const_vec(
|
2016-08-05 01:48:04 +08:00
|
|
|
; CHECK-NEXT: ret <2 x i1> <i1 true, i1 true>
|
2016-08-05 00:48:30 +08:00
|
|
|
;
|
|
|
|
|
%b = mul nsw <2 x i32> %a, <i32 -2, i32 -2>
|
|
|
|
|
%c = icmp ne <2 x i32> %b, <i32 1, i32 1>
|
|
|
|
|
ret <2 x i1> %c
|
2014-06-19 11:35:49 +08:00
|
|
|
}
|
2014-07-04 08:23:39 +08:00
|
|
|
|
|
|
|
|
define i1 @icmp_sdiv_int_min(i32 %a) {
|
|
|
|
|
%div = sdiv i32 -2147483648, %a
|
|
|
|
|
%cmp = icmp ne i32 %div, -1073741824
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_sdiv_int_min
|
|
|
|
|
; CHECK-NEXT: [[DIV:%.*]] = sdiv i32 -2147483648, %a
|
|
|
|
|
; CHECK-NEXT: [[CMP:%.*]] = icmp ne i32 [[DIV]], -1073741824
|
|
|
|
|
; CHECK-NEXT: ret i1 [[CMP]]
|
|
|
|
|
}
|
2014-07-15 03:49:57 +08:00
|
|
|
|
|
|
|
|
define i1 @icmp_sdiv_pr20288(i64 %a) {
|
|
|
|
|
%div = sdiv i64 %a, -8589934592
|
|
|
|
|
%cmp = icmp ne i64 %div, 1073741824
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_sdiv_pr20288
|
|
|
|
|
; CHECK-NEXT: [[DIV:%.*]] = sdiv i64 %a, -8589934592
|
|
|
|
|
; CHECK-NEXT: [[CMP:%.*]] = icmp ne i64 [[DIV]], 1073741824
|
|
|
|
|
; CHECK-NEXT: ret i1 [[CMP]]
|
|
|
|
|
}
|
2014-07-15 04:38:45 +08:00
|
|
|
|
|
|
|
|
define i1 @icmp_sdiv_neg1(i64 %a) {
|
2014-07-15 04:46:04 +08:00
|
|
|
%div = sdiv i64 %a, -1
|
2014-07-15 04:38:45 +08:00
|
|
|
%cmp = icmp ne i64 %div, 1073741824
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_sdiv_neg1
|
|
|
|
|
; CHECK-NEXT: [[DIV:%.*]] = sdiv i64 %a, -1
|
|
|
|
|
; CHECK-NEXT: [[CMP:%.*]] = icmp ne i64 [[DIV]], 1073741824
|
|
|
|
|
; CHECK-NEXT: ret i1 [[CMP]]
|
|
|
|
|
}
|
2014-08-22 08:40:43 +08:00
|
|
|
|
|
|
|
|
define i1 @icmp_known_bits(i4 %x, i4 %y) {
|
|
|
|
|
%and1 = and i4 %y, -7
|
|
|
|
|
%and2 = and i4 %x, -7
|
|
|
|
|
%or1 = or i4 %and1, 2
|
|
|
|
|
%or2 = or i4 %and2, 2
|
|
|
|
|
%add = add i4 %or1, %or2
|
|
|
|
|
%cmp = icmp eq i4 %add, 0
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_known_bits
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
2014-08-28 02:03:46 +08:00
|
|
|
|
|
|
|
|
define i1 @icmp_shl_nuw_1(i64 %a) {
|
|
|
|
|
%shl = shl nuw i64 1, %a
|
|
|
|
|
%cmp = icmp ne i64 %shl, 0
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_shl_nuw_1
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
2014-08-28 11:34:28 +08:00
|
|
|
define i1 @icmp_shl_1_V_ugt_2147483648(i32 %V) {
|
|
|
|
|
%shl = shl i32 1, %V
|
|
|
|
|
%cmp = icmp ugt i32 %shl, 2147483648
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_shl_1_V_ugt_2147483648(
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @icmp_shl_1_V_ule_2147483648(i32 %V) {
|
|
|
|
|
%shl = shl i32 1, %V
|
|
|
|
|
%cmp = icmp ule i32 %shl, 2147483648
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_shl_1_V_ule_2147483648(
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @icmp_shl_1_V_eq_31(i32 %V) {
|
|
|
|
|
%shl = shl i32 1, %V
|
|
|
|
|
%cmp = icmp eq i32 %shl, 31
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_shl_1_V_eq_31(
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @icmp_shl_1_V_ne_31(i32 %V) {
|
|
|
|
|
%shl = shl i32 1, %V
|
|
|
|
|
%cmp = icmp ne i32 %shl, 31
|
|
|
|
|
ret i1 %cmp
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: @icmp_shl_1_V_ne_31(
|
|
|
|
|
; CHECK-NEXT: ret i1 true
|
|
|
|
|
}
|
2014-11-25 10:55:48 +08:00
|
|
|
|
|
|
|
|
define i1 @tautological1(i32 %A, i32 %B) {
|
|
|
|
|
%C = and i32 %A, %B
|
|
|
|
|
%D = icmp ugt i32 %C, %A
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological1(
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological2(i32 %A, i32 %B) {
|
|
|
|
|
%C = and i32 %A, %B
|
|
|
|
|
%D = icmp ule i32 %C, %A
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological2(
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological3(i32 %A, i32 %B) {
|
|
|
|
|
%C = or i32 %A, %B
|
|
|
|
|
%D = icmp ule i32 %A, %C
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological3(
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological4(i32 %A, i32 %B) {
|
|
|
|
|
%C = or i32 %A, %B
|
|
|
|
|
%D = icmp ugt i32 %A, %C
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological4(
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological5(i32 %A, i32 %B) {
|
|
|
|
|
%C = or i32 %A, %B
|
|
|
|
|
%D = icmp ult i32 %C, %A
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological5(
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological6(i32 %A, i32 %B) {
|
|
|
|
|
%C = or i32 %A, %B
|
|
|
|
|
%D = icmp uge i32 %C, %A
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological6(
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological7(i32 %A, i32 %B) {
|
|
|
|
|
%C = and i32 %A, %B
|
|
|
|
|
%D = icmp uge i32 %A, %C
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological7(
|
|
|
|
|
; CHECK: ret i1 true
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @tautological8(i32 %A, i32 %B) {
|
|
|
|
|
%C = and i32 %A, %B
|
|
|
|
|
%D = icmp ult i32 %A, %C
|
|
|
|
|
ret i1 %D
|
|
|
|
|
; CHECK-LABEL: @tautological8(
|
|
|
|
|
; CHECK: ret i1 false
|
|
|
|
|
}
|
2015-08-21 07:01:41 +08:00
|
|
|
|
Add optimization for 'icmp slt (or A, B), A' and some related idioms based on knowledge of the sign bit for A and B.
No matter what value you OR in to A, the result of (or A, B) is going to be UGE A. When A and B are positive, it's SGE too. If A is negative, OR'ing a value into it can't make it positive, but can increase its value closer to -1, therefore (or A, B) is SGE A. Working through all possible combinations produces this truth table:
```
A is
+, -, +/-
F F F + B is
T F ? -
? F ? +/-
```
The related optimizations are flipping the 'slt' for 'sge' which always NOTs the result (if the result is known), and swapping the LHS and RHS while swapping the comparison predicate.
There are more idioms left to implement (aren't there always!) but I've stopped here because any more would risk becoming unreasonable for reviewers.
llvm-svn: 266939
2016-04-21 08:53:14 +08:00
|
|
|
declare void @helper_i1(i1)
|
|
|
|
|
; Series of tests for icmp s[lt|ge] (or A, B), A and icmp s[gt|le] A, (or A, B)
|
|
|
|
|
define void @icmp_slt_sge_or(i32 %Ax, i32 %Bx) {
|
|
|
|
|
; 'p' for positive, 'n' for negative, 'x' for potentially either.
|
|
|
|
|
; %D is 'icmp slt (or A, B), A'
|
|
|
|
|
; %E is 'icmp sge (or A, B), A' making it the not of %D
|
|
|
|
|
; %F is 'icmp sgt A, (or A, B)' making it the same as %D
|
|
|
|
|
; %G is 'icmp sle A, (or A, B)' making it the not of %D
|
|
|
|
|
%Aneg = or i32 %Ax, 2147483648
|
|
|
|
|
%Apos = and i32 %Ax, 2147483647
|
|
|
|
|
%Bneg = or i32 %Bx, 2147483648
|
|
|
|
|
%Bpos = and i32 %Bx, 2147483647
|
|
|
|
|
|
|
|
|
|
%Cpp = or i32 %Apos, %Bpos
|
|
|
|
|
%Dpp = icmp slt i32 %Cpp, %Apos
|
|
|
|
|
%Epp = icmp sge i32 %Cpp, %Apos
|
|
|
|
|
%Fpp = icmp sgt i32 %Apos, %Cpp
|
|
|
|
|
%Gpp = icmp sle i32 %Apos, %Cpp
|
|
|
|
|
%Cpx = or i32 %Apos, %Bx
|
|
|
|
|
%Dpx = icmp slt i32 %Cpx, %Apos
|
|
|
|
|
%Epx = icmp sge i32 %Cpx, %Apos
|
|
|
|
|
%Fpx = icmp sgt i32 %Apos, %Cpx
|
|
|
|
|
%Gpx = icmp sle i32 %Apos, %Cpx
|
|
|
|
|
%Cpn = or i32 %Apos, %Bneg
|
|
|
|
|
%Dpn = icmp slt i32 %Cpn, %Apos
|
|
|
|
|
%Epn = icmp sge i32 %Cpn, %Apos
|
|
|
|
|
%Fpn = icmp sgt i32 %Apos, %Cpn
|
|
|
|
|
%Gpn = icmp sle i32 %Apos, %Cpn
|
|
|
|
|
|
|
|
|
|
%Cxp = or i32 %Ax, %Bpos
|
|
|
|
|
%Dxp = icmp slt i32 %Cxp, %Ax
|
|
|
|
|
%Exp = icmp sge i32 %Cxp, %Ax
|
|
|
|
|
%Fxp = icmp sgt i32 %Ax, %Cxp
|
|
|
|
|
%Gxp = icmp sle i32 %Ax, %Cxp
|
|
|
|
|
%Cxx = or i32 %Ax, %Bx
|
|
|
|
|
%Dxx = icmp slt i32 %Cxx, %Ax
|
|
|
|
|
%Exx = icmp sge i32 %Cxx, %Ax
|
|
|
|
|
%Fxx = icmp sgt i32 %Ax, %Cxx
|
|
|
|
|
%Gxx = icmp sle i32 %Ax, %Cxx
|
|
|
|
|
%Cxn = or i32 %Ax, %Bneg
|
|
|
|
|
%Dxn = icmp slt i32 %Cxn, %Ax
|
|
|
|
|
%Exn = icmp sge i32 %Cxn, %Ax
|
|
|
|
|
%Fxn = icmp sgt i32 %Ax, %Cxn
|
|
|
|
|
%Gxn = icmp sle i32 %Ax, %Cxn
|
|
|
|
|
|
|
|
|
|
%Cnp = or i32 %Aneg, %Bpos
|
|
|
|
|
%Dnp = icmp slt i32 %Cnp, %Aneg
|
|
|
|
|
%Enp = icmp sge i32 %Cnp, %Aneg
|
|
|
|
|
%Fnp = icmp sgt i32 %Aneg, %Cnp
|
|
|
|
|
%Gnp = icmp sle i32 %Aneg, %Cnp
|
|
|
|
|
%Cnx = or i32 %Aneg, %Bx
|
|
|
|
|
%Dnx = icmp slt i32 %Cnx, %Aneg
|
|
|
|
|
%Enx = icmp sge i32 %Cnx, %Aneg
|
|
|
|
|
%Fnx = icmp sgt i32 %Aneg, %Cnx
|
|
|
|
|
%Gnx = icmp sle i32 %Aneg, %Cnx
|
|
|
|
|
%Cnn = or i32 %Aneg, %Bneg
|
|
|
|
|
%Dnn = icmp slt i32 %Cnn, %Aneg
|
|
|
|
|
%Enn = icmp sge i32 %Cnn, %Aneg
|
|
|
|
|
%Fnn = icmp sgt i32 %Aneg, %Cnn
|
|
|
|
|
%Gnn = icmp sle i32 %Aneg, %Cnn
|
|
|
|
|
|
|
|
|
|
call void @helper_i1(i1 %Dpp)
|
|
|
|
|
call void @helper_i1(i1 %Epp)
|
|
|
|
|
call void @helper_i1(i1 %Fpp)
|
|
|
|
|
call void @helper_i1(i1 %Gpp)
|
|
|
|
|
call void @helper_i1(i1 %Dpx)
|
|
|
|
|
call void @helper_i1(i1 %Epx)
|
|
|
|
|
call void @helper_i1(i1 %Fpx)
|
|
|
|
|
call void @helper_i1(i1 %Gpx)
|
|
|
|
|
call void @helper_i1(i1 %Dpn)
|
|
|
|
|
call void @helper_i1(i1 %Epn)
|
|
|
|
|
call void @helper_i1(i1 %Fpn)
|
|
|
|
|
call void @helper_i1(i1 %Gpn)
|
|
|
|
|
call void @helper_i1(i1 %Dxp)
|
|
|
|
|
call void @helper_i1(i1 %Exp)
|
|
|
|
|
call void @helper_i1(i1 %Fxp)
|
|
|
|
|
call void @helper_i1(i1 %Gxp)
|
|
|
|
|
call void @helper_i1(i1 %Dxx)
|
|
|
|
|
call void @helper_i1(i1 %Exx)
|
|
|
|
|
call void @helper_i1(i1 %Fxx)
|
|
|
|
|
call void @helper_i1(i1 %Gxx)
|
|
|
|
|
call void @helper_i1(i1 %Dxn)
|
|
|
|
|
call void @helper_i1(i1 %Exn)
|
|
|
|
|
call void @helper_i1(i1 %Fxn)
|
|
|
|
|
call void @helper_i1(i1 %Gxn)
|
|
|
|
|
call void @helper_i1(i1 %Dnp)
|
|
|
|
|
call void @helper_i1(i1 %Enp)
|
|
|
|
|
call void @helper_i1(i1 %Fnp)
|
|
|
|
|
call void @helper_i1(i1 %Gnp)
|
|
|
|
|
call void @helper_i1(i1 %Dnx)
|
|
|
|
|
call void @helper_i1(i1 %Enx)
|
|
|
|
|
call void @helper_i1(i1 %Fnx)
|
|
|
|
|
call void @helper_i1(i1 %Gnx)
|
|
|
|
|
call void @helper_i1(i1 %Dnn)
|
|
|
|
|
call void @helper_i1(i1 %Enn)
|
|
|
|
|
call void @helper_i1(i1 %Fnn)
|
|
|
|
|
call void @helper_i1(i1 %Gnn)
|
|
|
|
|
; CHECK-LABEL: @icmp_slt_sge_or
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Dpx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Epx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Fpx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Gpx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Dxx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Exx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Fxx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Gxx)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Dxn)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Exn)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Fxn)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 %Gxn)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 false)
|
|
|
|
|
; CHECK: call void @helper_i1(i1 true)
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2017-06-02 05:20:07 +08:00
|
|
|
|
|
|
|
|
define i1 @constant_fold_inttoptr_null() {
|
|
|
|
|
; CHECK-LABEL: @constant_fold_inttoptr_null(
|
|
|
|
|
; CHECK-NEXT: ret i1 false
|
|
|
|
|
;
|
|
|
|
|
%x = icmp eq i32* inttoptr (i64 32 to i32*), null
|
|
|
|
|
ret i1 %x
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
define i1 @constant_fold_null_inttoptr() {
|
|
|
|
|
; CHECK-LABEL: @constant_fold_null_inttoptr(
|
2017-06-03 00:17:32 +08:00
|
|
|
; CHECK-NEXT: ret i1 false
|
2017-06-02 05:20:07 +08:00
|
|
|
;
|
|
|
|
|
%x = icmp eq i32* null, inttoptr (i64 32 to i32*)
|
|
|
|
|
ret i1 %x
|
|
|
|
|
}
|