mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-15 04:30:12 +00:00
198d8baafb
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230786 91177308-0d34-0410-b5e6-96231b3b80d8
166 lines
3.8 KiB
LLVM
166 lines
3.8 KiB
LLVM
; Test ANDs of a constant into a byte of memory.
|
|
;
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu | FileCheck %s
|
|
|
|
; Check the lowest useful constant, expressed as a signed integer.
|
|
define void @f1(i8 *%ptr) {
|
|
; CHECK-LABEL: f1:
|
|
; CHECK: ni 0(%r2), 1
|
|
; CHECK: br %r14
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, -255
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the highest useful constant, expressed as a signed integer.
|
|
define void @f2(i8 *%ptr) {
|
|
; CHECK-LABEL: f2:
|
|
; CHECK: ni 0(%r2), 254
|
|
; CHECK: br %r14
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, -2
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the lowest useful constant, expressed as an unsigned integer.
|
|
define void @f3(i8 *%ptr) {
|
|
; CHECK-LABEL: f3:
|
|
; CHECK: ni 0(%r2), 1
|
|
; CHECK: br %r14
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 1
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the highest useful constant, expressed as a unsigned integer.
|
|
define void @f4(i8 *%ptr) {
|
|
; CHECK-LABEL: f4:
|
|
; CHECK: ni 0(%r2), 254
|
|
; CHECK: br %r14
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 254
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the NI range.
|
|
define void @f5(i8 *%src) {
|
|
; CHECK-LABEL: f5:
|
|
; CHECK: ni 4095(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 4095
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next byte up, which should use NIY instead of NI.
|
|
define void @f6(i8 *%src) {
|
|
; CHECK-LABEL: f6:
|
|
; CHECK: niy 4096(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 4096
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the NIY range.
|
|
define void @f7(i8 *%src) {
|
|
; CHECK-LABEL: f7:
|
|
; CHECK: niy 524287(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 524287
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next byte up, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f8(i8 *%src) {
|
|
; CHECK-LABEL: f8:
|
|
; CHECK: agfi %r2, 524288
|
|
; CHECK: ni 0(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 524288
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the high end of the negative NIY range.
|
|
define void @f9(i8 *%src) {
|
|
; CHECK-LABEL: f9:
|
|
; CHECK: niy -1(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 -1
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the low end of the NIY range.
|
|
define void @f10(i8 *%src) {
|
|
; CHECK-LABEL: f10:
|
|
; CHECK: niy -524288(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 -524288
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check the next byte down, which needs separate address logic.
|
|
; Other sequences besides this one would be OK.
|
|
define void @f11(i8 *%src) {
|
|
; CHECK-LABEL: f11:
|
|
; CHECK: agfi %r2, -524289
|
|
; CHECK: ni 0(%r2), 127
|
|
; CHECK: br %r14
|
|
%ptr = getelementptr i8, i8 *%src, i64 -524289
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that NI does not allow an index
|
|
define void @f12(i64 %src, i64 %index) {
|
|
; CHECK-LABEL: f12:
|
|
; CHECK: agr %r2, %r3
|
|
; CHECK: ni 4095(%r2), 127
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %src, %index
|
|
%add2 = add i64 %add1, 4095
|
|
%ptr = inttoptr i64 %add2 to i8 *
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|
|
|
|
; Check that NIY does not allow an index
|
|
define void @f13(i64 %src, i64 %index) {
|
|
; CHECK-LABEL: f13:
|
|
; CHECK: agr %r2, %r3
|
|
; CHECK: niy 4096(%r2), 127
|
|
; CHECK: br %r14
|
|
%add1 = add i64 %src, %index
|
|
%add2 = add i64 %add1, 4096
|
|
%ptr = inttoptr i64 %add2 to i8 *
|
|
%val = load i8 *%ptr
|
|
%and = and i8 %val, 127
|
|
store i8 %and, i8 *%ptr
|
|
ret void
|
|
}
|