2013-07-31 12:58:26 +00:00
|
|
|
; Test loop tuning.
|
|
|
|
|
;
|
|
|
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z10 | FileCheck %s
|
|
|
|
|
|
|
|
|
|
; Test that strength reduction is applied to addresses with a scale factor,
|
|
|
|
|
; but that indexed addressing can still be used.
|
|
|
|
|
define void @f1(i32 *%dest, i32 %a) {
|
2013-08-05 11:23:46 +00:00
|
|
|
; CHECK-LABEL: f1:
|
2013-07-31 12:58:26 +00:00
|
|
|
; CHECK-NOT: sllg
|
|
|
|
|
; CHECK: st %r3, 0({{%r[1-5],%r[1-5]}})
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
entry:
|
|
|
|
|
br label %loop
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
%index = phi i64 [ 0, %entry ], [ %next, %loop ]
|
[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
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230786 91177308-0d34-0410-b5e6-96231b3b80d8
2015-02-27 19:29:02 +00:00
|
|
|
%ptr = getelementptr i32, i32 *%dest, i64 %index
|
2013-07-31 12:58:26 +00:00
|
|
|
store i32 %a, i32 *%ptr
|
|
|
|
|
%next = add i64 %index, 1
|
|
|
|
|
%cmp = icmp ne i64 %next, 100
|
|
|
|
|
br i1 %cmp, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2013-08-05 11:23:46 +00:00
|
|
|
|
|
|
|
|
; Test a loop that should be converted into dbr form and then use BRCT.
|
|
|
|
|
define void @f2(i32 *%src, i32 *%dest) {
|
|
|
|
|
; CHECK-LABEL: f2:
|
|
|
|
|
; CHECK: lhi [[REG:%r[0-5]]], 100
|
|
|
|
|
; CHECK: [[LABEL:\.[^:]*]]:{{.*}} %loop
|
|
|
|
|
; CHECK: brct [[REG]], [[LABEL]]
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
entry:
|
|
|
|
|
br label %loop
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
%count = phi i32 [ 0, %entry ], [ %next, %loop.next ]
|
|
|
|
|
%next = add i32 %count, 1
|
2015-02-27 21:17:42 +00:00
|
|
|
%val = load volatile i32 , i32 *%src
|
2013-08-05 11:23:46 +00:00
|
|
|
%cmp = icmp eq i32 %val, 0
|
|
|
|
|
br i1 %cmp, label %loop.next, label %loop.store
|
|
|
|
|
|
|
|
|
|
loop.store:
|
|
|
|
|
%add = add i32 %val, 1
|
|
|
|
|
store volatile i32 %add, i32 *%dest
|
|
|
|
|
br label %loop.next
|
|
|
|
|
|
|
|
|
|
loop.next:
|
|
|
|
|
%cont = icmp ne i32 %next, 100
|
|
|
|
|
br i1 %cont, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Like f2, but for BRCTG.
|
|
|
|
|
define void @f3(i64 *%src, i64 *%dest) {
|
|
|
|
|
; CHECK-LABEL: f3:
|
|
|
|
|
; CHECK: lghi [[REG:%r[0-5]]], 100
|
|
|
|
|
; CHECK: [[LABEL:\.[^:]*]]:{{.*}} %loop
|
|
|
|
|
; CHECK: brctg [[REG]], [[LABEL]]
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
entry:
|
|
|
|
|
br label %loop
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
%count = phi i64 [ 0, %entry ], [ %next, %loop.next ]
|
|
|
|
|
%next = add i64 %count, 1
|
2015-02-27 21:17:42 +00:00
|
|
|
%val = load volatile i64 , i64 *%src
|
2013-08-05 11:23:46 +00:00
|
|
|
%cmp = icmp eq i64 %val, 0
|
|
|
|
|
br i1 %cmp, label %loop.next, label %loop.store
|
|
|
|
|
|
|
|
|
|
loop.store:
|
|
|
|
|
%add = add i64 %val, 1
|
|
|
|
|
store volatile i64 %add, i64 *%dest
|
|
|
|
|
br label %loop.next
|
|
|
|
|
|
|
|
|
|
loop.next:
|
|
|
|
|
%cont = icmp ne i64 %next, 100
|
|
|
|
|
br i1 %cont, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test a loop with a 64-bit decremented counter in which the 32-bit
|
|
|
|
|
; low part of the counter is used after the decrement. This is an example
|
|
|
|
|
; of a subregister use being the only thing that blocks a conversion to BRCTG.
|
|
|
|
|
define void @f4(i32 *%src, i32 *%dest, i64 *%dest2, i64 %count) {
|
|
|
|
|
; CHECK-LABEL: f4:
|
|
|
|
|
; CHECK: aghi [[REG:%r[0-5]]], -1
|
|
|
|
|
; CHECK: lr [[REG2:%r[0-5]]], [[REG]]
|
|
|
|
|
; CHECK: stg [[REG2]],
|
|
|
|
|
; CHECK: jne {{\..*}}
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
entry:
|
|
|
|
|
br label %loop
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
%left = phi i64 [ %count, %entry ], [ %next, %loop.next ]
|
|
|
|
|
store volatile i64 %left, i64 *%dest2
|
2015-02-27 21:17:42 +00:00
|
|
|
%val = load volatile i32 , i32 *%src
|
2013-08-05 11:23:46 +00:00
|
|
|
%cmp = icmp eq i32 %val, 0
|
|
|
|
|
br i1 %cmp, label %loop.next, label %loop.store
|
|
|
|
|
|
|
|
|
|
loop.store:
|
|
|
|
|
%add = add i32 %val, 1
|
|
|
|
|
store volatile i32 %add, i32 *%dest
|
|
|
|
|
br label %loop.next
|
|
|
|
|
|
|
|
|
|
loop.next:
|
|
|
|
|
%next = add i64 %left, -1
|
|
|
|
|
%ext = zext i32 %val to i64
|
|
|
|
|
%shl = shl i64 %ext, 32
|
|
|
|
|
%and = and i64 %next, 4294967295
|
|
|
|
|
%or = or i64 %shl, %and
|
|
|
|
|
store volatile i64 %or, i64 *%dest2
|
|
|
|
|
%cont = icmp ne i64 %next, 0
|
|
|
|
|
br i1 %cont, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
