2013-05-06 16:17:29 +00:00
|
|
|
; Test 128-bit addition in which the second operand is variable.
|
|
|
|
|
;
|
2013-07-19 16:37:00 +00:00
|
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z10 | FileCheck %s
|
|
|
|
|
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z196 | FileCheck %s
|
2013-05-06 16:17:29 +00:00
|
|
|
|
2013-07-03 10:10:02 +00:00
|
|
|
declare i128 *@foo()
|
|
|
|
|
|
2013-05-06 16:17:29 +00:00
|
|
|
; Test register addition.
|
|
|
|
|
define void @f1(i128 *%ptr) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f1:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: algr
|
|
|
|
|
; CHECK: alcgr
|
|
|
|
|
; CHECK: br %r14
|
2015-02-27 21:17:42 +00:00
|
|
|
%value = load i128 , i128 *%ptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %value, %value
|
|
|
|
|
store i128 %add, i128 *%ptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test memory addition with no offset. Making the load of %a volatile
|
|
|
|
|
; should force the memory operand to be %b.
|
|
|
|
|
define void @f2(i128 *%aptr, i64 %addr) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f2:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: alg {{%r[0-5]}}, 8(%r3)
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, 0(%r3)
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test the highest aligned offset that is in range of both ALG and ALCG.
|
|
|
|
|
define void @f3(i128 *%aptr, i64 %base) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f3:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: alg {{%r[0-5]}}, 524280(%r3)
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, 524272(%r3)
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%addr = add i64 %base, 524272
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test the next doubleword up, which requires separate address logic for ALG.
|
|
|
|
|
define void @f4(i128 *%aptr, i64 %base) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f4:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: lgr [[BASE:%r[1-5]]], %r3
|
|
|
|
|
; CHECK: agfi [[BASE]], 524288
|
|
|
|
|
; CHECK: alg {{%r[0-5]}}, 0([[BASE]])
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, 524280(%r3)
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%addr = add i64 %base, 524280
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test the next doubleword after that, which requires separate logic for
|
|
|
|
|
; both instructions. It would be better to create an anchor at 524288
|
|
|
|
|
; that both instructions can use, but that isn't implemented yet.
|
|
|
|
|
define void @f5(i128 *%aptr, i64 %base) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f5:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: alg {{%r[0-5]}}, 0({{%r[1-5]}})
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, 0({{%r[1-5]}})
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%addr = add i64 %base, 524288
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test the lowest displacement that is in range of both ALG and ALCG.
|
|
|
|
|
define void @f6(i128 *%aptr, i64 %base) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f6:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: alg {{%r[0-5]}}, -524280(%r3)
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, -524288(%r3)
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%addr = add i64 %base, -524288
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; Test the next doubleword down, which is out of range of the ALCG.
|
|
|
|
|
define void @f7(i128 *%aptr, i64 %base) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f7:
|
2013-05-06 16:17:29 +00:00
|
|
|
; CHECK: alg {{%r[0-5]}}, -524288(%r3)
|
|
|
|
|
; CHECK: alcg {{%r[0-5]}}, 0({{%r[1-5]}})
|
|
|
|
|
; CHECK: br %r14
|
|
|
|
|
%addr = add i64 %base, -524296
|
|
|
|
|
%bptr = inttoptr i64 %addr to i128 *
|
2015-02-27 21:17:42 +00:00
|
|
|
%a = load volatile i128 , i128 *%aptr
|
|
|
|
|
%b = load i128 , i128 *%bptr
|
2013-05-06 16:17:29 +00:00
|
|
|
%add = add i128 %a, %b
|
|
|
|
|
store i128 %add, i128 *%aptr
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2013-07-03 10:10:02 +00:00
|
|
|
; Check that additions of spilled values can use ALG and ALCG rather than
|
|
|
|
|
; ALGR and ALCGR.
|
|
|
|
|
define void @f8(i128 *%ptr0) {
|
2013-07-14 06:24:09 +00:00
|
|
|
; CHECK-LABEL: f8:
|
2013-07-03 10:10:02 +00:00
|
|
|
; CHECK: brasl %r14, foo@PLT
|
|
|
|
|
; CHECK: alg {{%r[0-9]+}}, {{[0-9]+}}(%r15)
|
|
|
|
|
; CHECK: alcg {{%r[0-9]+}}, {{[0-9]+}}(%r15)
|
|
|
|
|
; CHECK: br %r14
|
[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
|
|
|
%ptr1 = getelementptr i128, i128 *%ptr0, i128 2
|
|
|
|
|
%ptr2 = getelementptr i128, i128 *%ptr0, i128 4
|
|
|
|
|
%ptr3 = getelementptr i128, i128 *%ptr0, i128 6
|
|
|
|
|
%ptr4 = getelementptr i128, i128 *%ptr0, i128 8
|
2013-07-03 10:10:02 +00:00
|
|
|
|
2015-02-27 21:17:42 +00:00
|
|
|
%val0 = load i128 , i128 *%ptr0
|
|
|
|
|
%val1 = load i128 , i128 *%ptr1
|
|
|
|
|
%val2 = load i128 , i128 *%ptr2
|
|
|
|
|
%val3 = load i128 , i128 *%ptr3
|
|
|
|
|
%val4 = load i128 , i128 *%ptr4
|
2013-07-03 10:10:02 +00:00
|
|
|
|
|
|
|
|
%retptr = call i128 *@foo()
|
|
|
|
|
|
2015-02-27 21:17:42 +00:00
|
|
|
%ret = load i128 , i128 *%retptr
|
2013-07-03 10:10:02 +00:00
|
|
|
%add0 = add i128 %ret, %val0
|
|
|
|
|
%add1 = add i128 %add0, %val1
|
|
|
|
|
%add2 = add i128 %add1, %val2
|
|
|
|
|
%add3 = add i128 %add2, %val3
|
|
|
|
|
%add4 = add i128 %add3, %val4
|
|
|
|
|
store i128 %add4, i128 *%retptr
|
|
|
|
|
|
|
|
|
|
ret void
|
|
|
|
|
}
|
