mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 18:54:02 +01:00
0d99339102
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
102 lines
2.1 KiB
LLVM
102 lines
2.1 KiB
LLVM
; Test moves of integers to 4-byte memory locations.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Check moves of zero.
|
|
define void @f1(i32 *%a) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: mvhi 0(%r2), 0
|
|
; CHECK: br %r14
|
|
store i32 0, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the signed 16-bit range.
|
|
define void @f2(i32 *%a) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: mvhi 0(%r2), 32767
|
|
; CHECK: br %r14
|
|
store i32 32767, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check the next value up, which can't use MVHI.
|
|
define void @f3(i32 *%a) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK-NOT: mvhi
|
|
; CHECK: br %r14
|
|
store i32 32768, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check moves of -1.
|
|
define void @f4(i32 *%a) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: mvhi 0(%r2), -1
|
|
; CHECK: br %r14
|
|
store i32 -1, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check the low end of the MVHI range.
|
|
define void @f5(i32 *%a) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK: mvhi 0(%r2), -32768
|
|
; CHECK: br %r14
|
|
store i32 -32768, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check the next value down, which can't use MVHI.
|
|
define void @f6(i32 *%a) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK-NOT: mvhi
|
|
; CHECK: br %r14
|
|
store i32 -32769, i32 *%a
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the MVHI range.
|
|
define void @f7(i32 *%a) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: mvhi 4092(%r2), 42
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32, i32 *%a, i64 1023
|
|
store i32 42, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next word up, which is out of range. We prefer STY in that case.
|
|
define void @f8(i32 *%a) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: lhi [[TMP:%r[0-5]]], 42
|
|
; CHECK: sty [[TMP]], 4096(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32, i32 *%a, i64 1024
|
|
store i32 42, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check negative displacements, for which we again prefer STY.
|
|
define void @f9(i32 *%a) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: lhi [[TMP:%r[0-5]]], 42
|
|
; CHECK: sty [[TMP]], -4(%r2)
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i32, i32 *%a, i64 -1
|
|
store i32 42, i32 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that MVHI does not allow an index.
|
|
define void @f10(i64 %src, i64 %index) {
|
|
; CHECK-LABEL: f10:
|
|
; CHECK: lhi [[TMP:%r[0-5]]], 42
|
|
; CHECK: st [[TMP]], 0({{%r2,%r3|%r3,%r2}})
|
|
; CHECK: br %r14
|
|
%add = add i64 %src, %index
|
|
%ptr = inttoptr i64 %add to i32 *
|
|
store i32 42, i32 *%ptr
|
|
ret void
|
|
}
|