mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +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
88 lines
3.0 KiB
LLVM
88 lines
3.0 KiB
LLVM
; RUN: opt -instcombine -S < %s | FileCheck %s
|
|
|
|
declare void @llvm.init.trampoline(i8*, i8*, i8*)
|
|
declare i8* @llvm.adjust.trampoline(i8*)
|
|
declare i32 @f(i8 * nest, i32)
|
|
|
|
; Most common case
|
|
define i32 @test0(i32 %n) {
|
|
%alloca = alloca [10 x i8], align 16
|
|
%gep = getelementptr [10 x i8], [10 x i8]* %alloca, i32 0, i32 0
|
|
call void @llvm.init.trampoline(i8* %gep, i8* bitcast (i32 (i8*, i32)* @f to i8*),
|
|
i8* null)
|
|
%tramp = call i8* @llvm.adjust.trampoline(i8* %gep)
|
|
%function = bitcast i8* %tramp to i32(i32)*
|
|
%ret = call i32 %function(i32 %n)
|
|
ret i32 %ret
|
|
|
|
; CHECK: define i32 @test0(i32 %n) {
|
|
; CHECK: %ret = call i32 @f(i8* nest null, i32 %n)
|
|
}
|
|
|
|
define i32 @test1(i32 %n, i8* %trampmem) {
|
|
call void @llvm.init.trampoline(i8* %trampmem,
|
|
i8* bitcast (i32 (i8*, i32)* @f to i8*),
|
|
i8* null)
|
|
%tramp = call i8* @llvm.adjust.trampoline(i8* %trampmem)
|
|
%function = bitcast i8* %tramp to i32(i32)*
|
|
%ret = call i32 %function(i32 %n)
|
|
ret i32 %ret
|
|
; CHECK: define i32 @test1(i32 %n, i8* %trampmem) {
|
|
; CHECK: %ret = call i32 @f(i8* nest null, i32 %n)
|
|
}
|
|
|
|
define i32 @test2(i32 %n, i8* %trampmem) {
|
|
%tramp = call i8* @llvm.adjust.trampoline(i8* %trampmem)
|
|
%functiona = bitcast i8* %tramp to i32(i32)*
|
|
%ret = call i32 %functiona(i32 %n)
|
|
ret i32 %ret
|
|
; CHECK: define i32 @test2(i32 %n, i8* %trampmem) {
|
|
; CHECK: %ret = call i32 %functiona(i32 %n)
|
|
}
|
|
|
|
define i32 @test3(i32 %n, i8* %trampmem) {
|
|
call void @llvm.init.trampoline(i8* %trampmem,
|
|
i8* bitcast (i32 (i8*, i32)* @f to i8*),
|
|
i8* null)
|
|
|
|
; CHECK: define i32 @test3(i32 %n, i8* %trampmem) {
|
|
; CHECK: %ret0 = call i32 @f(i8* nest null, i32 %n)
|
|
%tramp0 = call i8* @llvm.adjust.trampoline(i8* %trampmem)
|
|
%function0 = bitcast i8* %tramp0 to i32(i32)*
|
|
%ret0 = call i32 %function0(i32 %n)
|
|
|
|
;; Not optimized since previous call could be writing.
|
|
%tramp1 = call i8* @llvm.adjust.trampoline(i8* %trampmem)
|
|
%function1 = bitcast i8* %tramp1 to i32(i32)*
|
|
%ret1 = call i32 %function1(i32 %n)
|
|
; CHECK: %ret1 = call i32 %function1(i32 %n)
|
|
|
|
ret i32 %ret1
|
|
}
|
|
|
|
define i32 @test4(i32 %n) {
|
|
%alloca = alloca [10 x i8], align 16
|
|
%gep = getelementptr [10 x i8], [10 x i8]* %alloca, i32 0, i32 0
|
|
call void @llvm.init.trampoline(i8* %gep, i8* bitcast (i32 (i8*, i32)* @f to i8*),
|
|
i8* null)
|
|
|
|
%tramp0 = call i8* @llvm.adjust.trampoline(i8* %gep)
|
|
%function0 = bitcast i8* %tramp0 to i32(i32)*
|
|
%ret0 = call i32 %function0(i32 %n)
|
|
|
|
%tramp1 = call i8* @llvm.adjust.trampoline(i8* %gep)
|
|
%function1 = bitcast i8* %tramp0 to i32(i32)*
|
|
%ret1 = call i32 %function1(i32 %n)
|
|
|
|
%tramp2 = call i8* @llvm.adjust.trampoline(i8* %gep)
|
|
%function2 = bitcast i8* %tramp2 to i32(i32)*
|
|
%ret2 = call i32 %function2(i32 %n)
|
|
|
|
ret i32 %ret2
|
|
|
|
; CHECK: define i32 @test4(i32 %n) {
|
|
; CHECK: %ret0 = call i32 @f(i8* nest null, i32 %n)
|
|
; CHECK: %ret1 = call i32 @f(i8* nest null, i32 %n)
|
|
; CHECK: %ret2 = call i32 @f(i8* nest null, i32 %n)
|
|
}
|