2013-06-22 02:47:08 +08:00
|
|
|
; REQUIRES: asserts
|
2014-02-13 22:44:26 +08:00
|
|
|
; RUN: llc -march=x86 -no-integrated-as < %s -verify-machineinstrs -precompute-phys-liveness
|
|
|
|
; RUN: llc -march=x86-64 -no-integrated-as < %s -verify-machineinstrs -precompute-phys-liveness
|
|
|
|
|
2010-03-05 14:19:13 +08:00
|
|
|
; PR6497
|
|
|
|
|
|
|
|
; Chain and flag folding issues.
|
|
|
|
define i32 @test1() nounwind ssp {
|
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp5.i = load volatile i32, i32* undef ; <i32> [#uses=1]
|
2010-03-05 14:19:13 +08:00
|
|
|
%conv.i = zext i32 %tmp5.i to i64 ; <i64> [#uses=1]
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp12.i = load volatile i32, i32* undef ; <i32> [#uses=1]
|
2010-03-05 14:19:13 +08:00
|
|
|
%conv13.i = zext i32 %tmp12.i to i64 ; <i64> [#uses=1]
|
|
|
|
%shl.i = shl i64 %conv13.i, 32 ; <i64> [#uses=1]
|
|
|
|
%or.i = or i64 %shl.i, %conv.i ; <i64> [#uses=1]
|
|
|
|
%add16.i = add i64 %or.i, 256 ; <i64> [#uses=1]
|
|
|
|
%shr.i = lshr i64 %add16.i, 8 ; <i64> [#uses=1]
|
|
|
|
%conv19.i = trunc i64 %shr.i to i32 ; <i32> [#uses=1]
|
2011-11-27 14:54:59 +08:00
|
|
|
store volatile i32 %conv19.i, i32* undef
|
2010-03-05 14:19:13 +08:00
|
|
|
ret i32 undef
|
|
|
|
}
|
2010-03-11 07:46:44 +08:00
|
|
|
|
|
|
|
; PR6533
|
|
|
|
define void @test2(i1 %x, i32 %y) nounwind {
|
|
|
|
%land.ext = zext i1 %x to i32 ; <i32> [#uses=1]
|
|
|
|
%and = and i32 %y, 1 ; <i32> [#uses=1]
|
|
|
|
%xor = xor i32 %and, %land.ext ; <i32> [#uses=1]
|
|
|
|
%cmp = icmp eq i32 %xor, 1 ; <i1> [#uses=1]
|
|
|
|
br i1 %cmp, label %if.end, label %if.then
|
|
|
|
|
|
|
|
if.then: ; preds = %land.end
|
|
|
|
ret void
|
|
|
|
|
|
|
|
if.end: ; preds = %land.end
|
|
|
|
ret void
|
|
|
|
}
|
2010-03-12 15:15:36 +08:00
|
|
|
|
|
|
|
; PR6577
|
|
|
|
%pair = type { i64, double }
|
|
|
|
|
2010-03-15 02:44:35 +08:00
|
|
|
define void @test3() {
|
2010-03-12 15:15:36 +08:00
|
|
|
dependentGraph243.exit:
|
2015-02-28 05:17:42 +08:00
|
|
|
%subject19 = load %pair, %pair* undef ; <%1> [#uses=1]
|
2010-03-12 15:15:36 +08:00
|
|
|
%0 = extractvalue %pair %subject19, 1 ; <double> [#uses=2]
|
|
|
|
%1 = select i1 undef, double %0, double undef ; <double> [#uses=1]
|
|
|
|
%2 = select i1 undef, double %1, double %0 ; <double> [#uses=1]
|
|
|
|
%3 = insertvalue %pair undef, double %2, 1 ; <%1> [#uses=1]
|
|
|
|
store %pair %3, %pair* undef
|
|
|
|
ret void
|
|
|
|
}
|
2010-03-15 02:44:35 +08:00
|
|
|
|
|
|
|
; PR6605
|
|
|
|
define i64 @test4(i8* %P) nounwind ssp {
|
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load i8, i8* %P ; <i8> [#uses=3]
|
2010-03-15 02:44:35 +08:00
|
|
|
%tobool = icmp eq i8 %tmp1, 0 ; <i1> [#uses=1]
|
|
|
|
%tmp58 = sext i1 %tobool to i8 ; <i8> [#uses=1]
|
|
|
|
%mul.i = and i8 %tmp58, %tmp1 ; <i8> [#uses=1]
|
|
|
|
%conv6 = zext i8 %mul.i to i32 ; <i32> [#uses=1]
|
|
|
|
%cmp = icmp ne i8 %tmp1, 1 ; <i1> [#uses=1]
|
|
|
|
%conv11 = zext i1 %cmp to i32 ; <i32> [#uses=1]
|
|
|
|
%call12 = tail call i32 @safe(i32 %conv11) nounwind ; <i32> [#uses=1]
|
|
|
|
%and = and i32 %conv6, %call12 ; <i32> [#uses=1]
|
|
|
|
%tobool13 = icmp eq i32 %and, 0 ; <i1> [#uses=1]
|
|
|
|
br i1 %tobool13, label %if.else, label %return
|
|
|
|
|
|
|
|
if.else: ; preds = %entry
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
return: ; preds = %if.else, %entry
|
|
|
|
ret i64 undef
|
|
|
|
}
|
|
|
|
|
|
|
|
declare i32 @safe(i32)
|
2010-03-15 03:46:02 +08:00
|
|
|
|
|
|
|
; PR6607
|
|
|
|
define fastcc void @test5(i32 %FUNC) nounwind {
|
|
|
|
foo:
|
2015-02-28 05:17:42 +08:00
|
|
|
%0 = load i8, i8* undef, align 1 ; <i8> [#uses=3]
|
2010-03-15 03:46:02 +08:00
|
|
|
%1 = sext i8 %0 to i32 ; <i32> [#uses=2]
|
|
|
|
%2 = zext i8 %0 to i32 ; <i32> [#uses=1]
|
|
|
|
%tmp1.i5037 = urem i32 %2, 10 ; <i32> [#uses=1]
|
|
|
|
%tmp.i5038 = icmp ugt i32 %tmp1.i5037, 15 ; <i1> [#uses=1]
|
|
|
|
%3 = zext i1 %tmp.i5038 to i8 ; <i8> [#uses=1]
|
|
|
|
%4 = icmp slt i8 %0, %3 ; <i1> [#uses=1]
|
|
|
|
%5 = add nsw i32 %1, 256 ; <i32> [#uses=1]
|
|
|
|
%storemerge.i.i57 = select i1 %4, i32 %5, i32 %1 ; <i32> [#uses=1]
|
|
|
|
%6 = shl i32 %storemerge.i.i57, 16 ; <i32> [#uses=1]
|
|
|
|
%7 = sdiv i32 %6, -256 ; <i32> [#uses=1]
|
|
|
|
%8 = trunc i32 %7 to i8 ; <i8> [#uses=1]
|
|
|
|
store i8 %8, i8* undef, align 1
|
|
|
|
ret void
|
|
|
|
}
|
2010-03-16 03:09:43 +08:00
|
|
|
|
|
|
|
|
2010-04-08 02:03:19 +08:00
|
|
|
; Crash commoning identical asms.
|
2010-04-08 02:04:56 +08:00
|
|
|
; PR6803
|
2010-04-08 02:03:19 +08:00
|
|
|
define void @test6(i1 %C) nounwind optsize ssp {
|
|
|
|
entry:
|
|
|
|
br i1 %C, label %do.body55, label %do.body92
|
|
|
|
|
|
|
|
do.body55: ; preds = %if.else36
|
|
|
|
call void asm sideeffect "foo", "~{dirflag},~{fpsr},~{flags}"() nounwind, !srcloc !0
|
|
|
|
ret void
|
|
|
|
|
|
|
|
do.body92: ; preds = %if.then66
|
|
|
|
call void asm sideeffect "foo", "~{dirflag},~{fpsr},~{flags}"() nounwind, !srcloc !1
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
IR: Make metadata typeless in assembly
Now that `Metadata` is typeless, reflect that in the assembly. These
are the matching assembly changes for the metadata/value split in
r223802.
- Only use the `metadata` type when referencing metadata from a call
intrinsic -- i.e., only when it's used as a `Value`.
- Stop pretending that `ValueAsMetadata` is wrapped in an `MDNode`
when referencing it from call intrinsics.
So, assembly like this:
define @foo(i32 %v) {
call void @llvm.foo(metadata !{i32 %v}, metadata !0)
call void @llvm.foo(metadata !{i32 7}, metadata !0)
call void @llvm.foo(metadata !1, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{metadata !3}, metadata !0)
ret void, !bar !2
}
!0 = metadata !{metadata !2}
!1 = metadata !{i32* @global}
!2 = metadata !{metadata !3}
!3 = metadata !{}
turns into this:
define @foo(i32 %v) {
call void @llvm.foo(metadata i32 %v, metadata !0)
call void @llvm.foo(metadata i32 7, metadata !0)
call void @llvm.foo(metadata i32* @global, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{!3}, metadata !0)
ret void, !bar !2
}
!0 = !{!2}
!1 = !{i32* @global}
!2 = !{!3}
!3 = !{}
I wrote an upgrade script that handled almost all of the tests in llvm
and many of the tests in cfe (even handling many `CHECK` lines). I've
attached it (or will attach it in a moment if you're speedy) to PR21532
to help everyone update their out-of-tree testcases.
This is part of PR21532.
llvm-svn: 224257
2014-12-16 03:07:53 +08:00
|
|
|
!0 = !{i32 633550}
|
|
|
|
!1 = !{i32 634261}
|
2010-04-21 02:14:47 +08:00
|
|
|
|
|
|
|
|
|
|
|
; Crash during XOR optimization.
|
|
|
|
; <rdar://problem/7869290>
|
|
|
|
|
|
|
|
define void @test7() nounwind ssp {
|
|
|
|
entry:
|
|
|
|
br i1 undef, label %bb14, label %bb67
|
|
|
|
|
|
|
|
bb14:
|
|
|
|
%tmp0 = trunc i16 undef to i1
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp1 = load i8, i8* undef, align 8
|
2010-04-21 02:14:47 +08:00
|
|
|
%tmp2 = shl i8 %tmp1, 4
|
|
|
|
%tmp3 = lshr i8 %tmp2, 7
|
|
|
|
%tmp4 = trunc i8 %tmp3 to i1
|
|
|
|
%tmp5 = icmp ne i1 %tmp0, %tmp4
|
|
|
|
br i1 %tmp5, label %bb14, label %bb67
|
|
|
|
|
|
|
|
bb67:
|
|
|
|
ret void
|
|
|
|
}
|
2010-07-08 04:33:27 +08:00
|
|
|
|
|
|
|
; Crash when trying to copy AH to AL.
|
|
|
|
; PR7540
|
|
|
|
define void @copy8bitregs() nounwind {
|
|
|
|
entry:
|
|
|
|
%div.i = sdiv i32 115200, 0
|
|
|
|
%shr8.i = lshr i32 %div.i, 8
|
|
|
|
%conv4.i = trunc i32 %shr8.i to i8
|
|
|
|
call void asm sideeffect "outb $0, ${1:w}", "{ax},N{dx},~{dirflag},~{fpsr},~{flags}"(i8 %conv4.i, i32 1017) nounwind
|
|
|
|
unreachable
|
|
|
|
}
|
2011-01-16 10:56:53 +08:00
|
|
|
|
|
|
|
; Crash trying to form conditional increment with fp value.
|
|
|
|
; PR8981
|
|
|
|
define i32 @test9(double %X) ssp align 2 {
|
|
|
|
entry:
|
|
|
|
%0 = fcmp one double %X, 0.000000e+00
|
|
|
|
%cond = select i1 %0, i32 1, i32 2
|
|
|
|
ret i32 %cond
|
|
|
|
}
|
|
|
|
|
2011-01-16 16:48:11 +08:00
|
|
|
|
|
|
|
; PR8514 - Crash in match address do to "heroics" turning and-of-shift into
|
|
|
|
; shift of and.
|
|
|
|
%struct.S0 = type { i8, [2 x i8], i8 }
|
|
|
|
|
|
|
|
define void @func_59(i32 %p_63) noreturn nounwind {
|
|
|
|
entry:
|
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
for.body: ; preds = %for.inc44, %entry
|
|
|
|
%p_63.addr.1 = phi i32 [ %p_63, %entry ], [ 0, %for.inc44 ]
|
|
|
|
%l_74.0 = phi i32 [ 0, %entry ], [ %add46, %for.inc44 ]
|
|
|
|
br i1 undef, label %for.inc44, label %bb.nph81
|
|
|
|
|
|
|
|
bb.nph81: ; preds = %for.body
|
|
|
|
%tmp98 = add i32 %p_63.addr.1, 0
|
|
|
|
br label %for.body22
|
|
|
|
|
|
|
|
for.body22: ; preds = %for.body22, %bb.nph81
|
|
|
|
%l_75.077 = phi i64 [ %ins, %for.body22 ], [ undef, %bb.nph81 ]
|
|
|
|
%tmp110 = trunc i64 %l_75.077 to i32
|
|
|
|
%tmp111 = and i32 %tmp110, 65535
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx32.0 = getelementptr [9 x [5 x [2 x %struct.S0]]], [9 x [5 x [2 x %struct.S0]]]* undef, i32 0, i32 %l_74.0, i32 %tmp98, i32 %tmp111, i32 0
|
2011-01-16 16:48:11 +08:00
|
|
|
store i8 1, i8* %arrayidx32.0, align 4
|
|
|
|
%tmp106 = shl i32 %tmp110, 2
|
|
|
|
%tmp107 = and i32 %tmp106, 262140
|
|
|
|
%scevgep99.sum114 = or i32 %tmp107, 1
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx32.1.1 = getelementptr [9 x [5 x [2 x %struct.S0]]], [9 x [5 x [2 x %struct.S0]]]* undef, i32 0, i32 %l_74.0, i32 %tmp98, i32 0, i32 1, i32 %scevgep99.sum114
|
2011-01-16 16:48:11 +08:00
|
|
|
store i8 0, i8* %arrayidx32.1.1, align 1
|
|
|
|
%ins = or i64 undef, undef
|
|
|
|
br label %for.body22
|
|
|
|
|
|
|
|
for.inc44: ; preds = %for.body
|
|
|
|
%add46 = add i32 %l_74.0, 1
|
|
|
|
br label %for.body
|
|
|
|
}
|
2011-02-13 17:10:56 +08:00
|
|
|
|
|
|
|
; PR9028
|
2011-03-29 07:02:18 +08:00
|
|
|
define void @func_60(i64 %A) nounwind {
|
2011-02-13 17:10:56 +08:00
|
|
|
entry:
|
|
|
|
%0 = zext i64 %A to i160
|
|
|
|
%1 = shl i160 %0, 64
|
|
|
|
%2 = zext i160 %1 to i576
|
|
|
|
%3 = zext i96 undef to i576
|
|
|
|
%4 = or i576 %3, %2
|
|
|
|
store i576 %4, i576* undef, align 8
|
|
|
|
ret void
|
|
|
|
}
|
2011-03-29 07:02:18 +08:00
|
|
|
|
|
|
|
; <rdar://problem/9187792>
|
|
|
|
define fastcc void @func_61() nounwind sspreq {
|
|
|
|
entry:
|
2013-10-08 02:06:48 +08:00
|
|
|
%t1 = tail call i64 @llvm.objectsize.i64.p0i8(i8* undef, i1 false)
|
2011-03-29 07:02:18 +08:00
|
|
|
%t2 = icmp eq i64 %t1, -1
|
|
|
|
br i1 %t2, label %bb2, label %bb1
|
|
|
|
|
|
|
|
bb1:
|
|
|
|
ret void
|
|
|
|
|
|
|
|
bb2:
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2013-10-08 02:06:48 +08:00
|
|
|
declare i64 @llvm.objectsize.i64.p0i8(i8*, i1) nounwind readnone
|
2011-07-05 23:38:41 +08:00
|
|
|
|
|
|
|
; PR10277
|
|
|
|
; This test has dead code elimination caused by remat during spilling.
|
|
|
|
; DCE causes a live interval to break into connected components.
|
|
|
|
; One of the components is spilled.
|
|
|
|
|
|
|
|
%t2 = type { i8 }
|
|
|
|
%t9 = type { %t10 }
|
|
|
|
%t10 = type { %t11 }
|
|
|
|
%t11 = type { %t12 }
|
|
|
|
%t12 = type { %t13*, %t13*, %t13* }
|
|
|
|
%t13 = type { %t14*, %t15, %t15 }
|
|
|
|
%t14 = type opaque
|
|
|
|
%t15 = type { i8, i32, i32 }
|
|
|
|
%t16 = type { %t17, i8* }
|
|
|
|
%t17 = type { %t18 }
|
|
|
|
%t18 = type { %t19 }
|
|
|
|
%t19 = type { %t20*, %t20*, %t20* }
|
|
|
|
%t20 = type { i32, i32 }
|
|
|
|
%t21 = type { %t13* }
|
|
|
|
|
|
|
|
define void @_ZNK4llvm17MipsFrameLowering12emitPrologueERNS_15MachineFunctionE() ssp align 2 {
|
|
|
|
bb:
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp = load %t9*, %t9** undef, align 4
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%tmp2 = getelementptr inbounds %t9, %t9* %tmp, i32 0, i32 0
|
|
|
|
%tmp3 = getelementptr inbounds %t9, %t9* %tmp, i32 0, i32 0, i32 0, i32 0, i32 1
|
2011-07-05 23:38:41 +08:00
|
|
|
br label %bb4
|
|
|
|
|
|
|
|
bb4: ; preds = %bb37, %bb
|
|
|
|
%tmp5 = phi i96 [ undef, %bb ], [ %tmp38, %bb37 ]
|
|
|
|
%tmp6 = phi i96 [ undef, %bb ], [ %tmp39, %bb37 ]
|
|
|
|
br i1 undef, label %bb34, label %bb7
|
|
|
|
|
|
|
|
bb7: ; preds = %bb4
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp8 = load i32, i32* undef, align 4
|
2011-07-05 23:38:41 +08:00
|
|
|
%tmp9 = and i96 %tmp6, 4294967040
|
|
|
|
%tmp10 = zext i32 %tmp8 to i96
|
|
|
|
%tmp11 = shl nuw nsw i96 %tmp10, 32
|
|
|
|
%tmp12 = or i96 %tmp9, %tmp11
|
|
|
|
%tmp13 = or i96 %tmp12, 1
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp14 = load i32, i32* undef, align 4
|
2011-07-05 23:38:41 +08:00
|
|
|
%tmp15 = and i96 %tmp5, 4294967040
|
|
|
|
%tmp16 = zext i32 %tmp14 to i96
|
|
|
|
%tmp17 = shl nuw nsw i96 %tmp16, 32
|
|
|
|
%tmp18 = or i96 %tmp15, %tmp17
|
|
|
|
%tmp19 = or i96 %tmp18, 1
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp20 = load i8, i8* undef, align 1
|
2011-07-05 23:38:41 +08:00
|
|
|
%tmp21 = and i8 %tmp20, 1
|
|
|
|
%tmp22 = icmp ne i8 %tmp21, 0
|
|
|
|
%tmp23 = select i1 %tmp22, i96 %tmp19, i96 %tmp13
|
|
|
|
%tmp24 = select i1 %tmp22, i96 %tmp13, i96 %tmp19
|
|
|
|
store i96 %tmp24, i96* undef, align 4
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp25 = load %t13*, %t13** %tmp3, align 4
|
2011-07-05 23:38:41 +08:00
|
|
|
%tmp26 = icmp eq %t13* %tmp25, undef
|
|
|
|
br i1 %tmp26, label %bb28, label %bb27
|
|
|
|
|
|
|
|
bb27: ; preds = %bb7
|
|
|
|
br label %bb29
|
|
|
|
|
|
|
|
bb28: ; preds = %bb7
|
|
|
|
call void @_ZNSt6vectorIN4llvm11MachineMoveESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_(%t10* %tmp2, %t21* byval align 4 undef, %t13* undef)
|
|
|
|
br label %bb29
|
|
|
|
|
|
|
|
bb29: ; preds = %bb28, %bb27
|
|
|
|
store i96 %tmp23, i96* undef, align 4
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp30 = load %t13*, %t13** %tmp3, align 4
|
2011-07-05 23:38:41 +08:00
|
|
|
br i1 false, label %bb33, label %bb31
|
|
|
|
|
|
|
|
bb31: ; preds = %bb29
|
[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
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%tmp32 = getelementptr inbounds %t13, %t13* %tmp30, i32 1
|
2011-07-05 23:38:41 +08:00
|
|
|
store %t13* %tmp32, %t13** %tmp3, align 4
|
|
|
|
br label %bb37
|
|
|
|
|
|
|
|
bb33: ; preds = %bb29
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb34: ; preds = %bb4
|
|
|
|
br i1 undef, label %bb36, label %bb35
|
|
|
|
|
|
|
|
bb35: ; preds = %bb34
|
|
|
|
store %t13* null, %t13** %tmp3, align 4
|
|
|
|
br label %bb37
|
|
|
|
|
|
|
|
bb36: ; preds = %bb34
|
|
|
|
call void @_ZNSt6vectorIN4llvm11MachineMoveESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_(%t10* %tmp2, %t21* byval align 4 undef, %t13* undef)
|
|
|
|
br label %bb37
|
|
|
|
|
|
|
|
bb37: ; preds = %bb36, %bb35, %bb31
|
|
|
|
%tmp38 = phi i96 [ %tmp23, %bb31 ], [ %tmp5, %bb35 ], [ %tmp5, %bb36 ]
|
|
|
|
%tmp39 = phi i96 [ %tmp24, %bb31 ], [ %tmp6, %bb35 ], [ %tmp6, %bb36 ]
|
|
|
|
%tmp40 = add i32 undef, 1
|
|
|
|
br label %bb4
|
|
|
|
}
|
|
|
|
|
|
|
|
declare %t14* @_ZN4llvm9MCContext16CreateTempSymbolEv(%t2*)
|
|
|
|
|
|
|
|
declare void @_ZNSt6vectorIN4llvm11MachineMoveESaIS1_EE13_M_insert_auxEN9__gnu_cxx17__normal_iteratorIPS1_S3_EERKS1_(%t10*, %t21* byval align 4, %t13*)
|
|
|
|
|
|
|
|
declare void @llvm.lifetime.start(i64, i8* nocapture) nounwind
|
|
|
|
|
|
|
|
declare void @llvm.lifetime.end(i64, i8* nocapture) nounwind
|
2011-07-25 04:23:50 +08:00
|
|
|
|
|
|
|
; PR10463
|
|
|
|
; Spilling a virtual register with <undef> uses.
|
|
|
|
define void @autogen_239_1000() {
|
|
|
|
BB:
|
|
|
|
%Shuff = shufflevector <8 x double> undef, <8 x double> undef, <8 x i32> <i32 0, i32 2, i32 4, i32 6, i32 8, i32 10, i32 undef, i32 undef>
|
|
|
|
br label %CF
|
|
|
|
|
|
|
|
CF:
|
|
|
|
%B16 = frem <8 x double> zeroinitializer, %Shuff
|
|
|
|
%E19 = extractelement <8 x double> %Shuff, i32 5
|
|
|
|
br i1 undef, label %CF, label %CF75
|
|
|
|
|
|
|
|
CF75:
|
|
|
|
br i1 undef, label %CF75, label %CF76
|
|
|
|
|
|
|
|
CF76:
|
|
|
|
store double %E19, double* undef
|
|
|
|
br i1 undef, label %CF76, label %CF77
|
|
|
|
|
|
|
|
CF77:
|
|
|
|
%B55 = fmul <8 x double> %B16, undef
|
|
|
|
br label %CF77
|
|
|
|
}
|
|
|
|
|
2011-08-04 08:32:58 +08:00
|
|
|
; PR10527
|
|
|
|
define void @pr10527() nounwind uwtable {
|
|
|
|
entry:
|
|
|
|
br label %"4"
|
|
|
|
|
|
|
|
"3":
|
2015-02-28 05:17:42 +08:00
|
|
|
%0 = load <2 x i32>, <2 x i32>* null, align 8
|
2011-08-04 08:32:58 +08:00
|
|
|
%1 = xor <2 x i32> zeroinitializer, %0
|
|
|
|
%2 = and <2 x i32> %1, %6
|
|
|
|
%3 = or <2 x i32> undef, %2
|
|
|
|
%4 = and <2 x i32> %3, undef
|
|
|
|
store <2 x i32> %4, <2 x i32>* undef
|
2015-02-28 05:17:42 +08:00
|
|
|
%5 = load <2 x i32>, <2 x i32>* undef, align 1
|
2011-08-04 08:32:58 +08:00
|
|
|
br label %"4"
|
|
|
|
|
|
|
|
"4":
|
|
|
|
%6 = phi <2 x i32> [ %5, %"3" ], [ zeroinitializer, %entry ]
|
|
|
|
%7 = icmp ult i32 undef, undef
|
|
|
|
br i1 %7, label %"3", label %"5"
|
|
|
|
|
|
|
|
"5":
|
|
|
|
ret void
|
|
|
|
}
|
2011-10-13 07:37:40 +08:00
|
|
|
|
|
|
|
; PR11078
|
|
|
|
;
|
|
|
|
; A virtual register used by the "foo" inline asm memory operand gets
|
|
|
|
; constrained to GR32_ABCD during coalescing. This makes the inline asm
|
|
|
|
; impossible to allocate without splitting the live range and reinflating the
|
|
|
|
; register class around the inline asm.
|
|
|
|
;
|
|
|
|
; The constraint originally comes from the TEST8ri optimization of (icmp (and %t0, 1), 0).
|
|
|
|
|
|
|
|
@__force_order = external hidden global i32, align 4
|
|
|
|
define void @pr11078(i32* %pgd) nounwind {
|
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%t0 = load i32, i32* %pgd, align 4
|
2011-10-13 07:37:40 +08:00
|
|
|
%and2 = and i32 %t0, 1
|
|
|
|
%tobool = icmp eq i32 %and2, 0
|
|
|
|
br i1 %tobool, label %if.then, label %if.end
|
|
|
|
|
|
|
|
if.then:
|
|
|
|
%t1 = tail call i32 asm sideeffect "bar", "=r,=*m,~{dirflag},~{fpsr},~{flags}"(i32* @__force_order) nounwind
|
|
|
|
br label %if.end
|
|
|
|
|
|
|
|
if.end:
|
|
|
|
%t6 = inttoptr i32 %t0 to i64*
|
|
|
|
%t11 = tail call i64 asm sideeffect "foo", "=*m,=A,{bx},{cx},1,~{memory},~{dirflag},~{fpsr},~{flags}"(i64* %t6, i32 0, i32 0, i64 0) nounwind
|
|
|
|
ret void
|
|
|
|
}
|
2012-06-30 05:00:03 +08:00
|
|
|
|
|
|
|
; Avoid emitting wrong kill flags from InstrEmitter.
|
|
|
|
; InstrEmitter::EmitSubregNode() may steal virtual registers from already
|
|
|
|
; emitted blocks when isCoalescableExtInstr points out the opportunity.
|
|
|
|
; Make sure kill flags are cleared on the newly global virtual register.
|
|
|
|
define i64 @ov_read(i8* %vf, i8* nocapture %buffer, i32 %length, i32 %bigendianp, i32 %word, i32 %sgned, i32* %bitstream) nounwind uwtable ssp {
|
|
|
|
entry:
|
|
|
|
br i1 undef, label %return, label %while.body.preheader
|
|
|
|
|
|
|
|
while.body.preheader: ; preds = %entry
|
|
|
|
br i1 undef, label %if.then3, label %if.end7
|
|
|
|
|
|
|
|
if.then3: ; preds = %while.body.preheader
|
2015-02-28 05:17:42 +08:00
|
|
|
%0 = load i32, i32* undef, align 4
|
2012-06-30 05:00:03 +08:00
|
|
|
br i1 undef, label %land.lhs.true.i255, label %if.end7
|
|
|
|
|
|
|
|
land.lhs.true.i255: ; preds = %if.then3
|
|
|
|
br i1 undef, label %if.then.i256, label %if.end7
|
|
|
|
|
|
|
|
if.then.i256: ; preds = %land.lhs.true.i255
|
|
|
|
%sub.i = sub i32 0, %0
|
|
|
|
%conv = sext i32 %sub.i to i64
|
|
|
|
br i1 undef, label %if.end7, label %while.end
|
|
|
|
|
|
|
|
if.end7: ; preds = %if.then.i256, %land.lhs.true.i255, %if.then3, %while.body.preheader
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
while.end: ; preds = %if.then.i256
|
|
|
|
%cmp18 = icmp sgt i32 %sub.i, 0
|
|
|
|
%.conv = select i1 %cmp18, i64 -131, i64 %conv
|
|
|
|
ret i64 %.conv
|
|
|
|
|
|
|
|
return: ; preds = %entry
|
|
|
|
ret i64 -131
|
|
|
|
}
|
2012-07-05 03:28:31 +08:00
|
|
|
|
|
|
|
; The tail call to a varargs function sets %AL.
|
|
|
|
; uitofp expands to an FCMOV instruction which splits the basic block.
|
|
|
|
; Make sure the live range of %AL isn't split.
|
|
|
|
@.str = private unnamed_addr constant { [1 x i8], [63 x i8] } zeroinitializer, align 32
|
2013-02-26 14:58:09 +08:00
|
|
|
define void @pr13188(i64* nocapture %this) uwtable ssp sanitize_address align 2 {
|
2012-07-05 03:28:31 +08:00
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%x7 = load i64, i64* %this, align 8
|
2012-07-05 03:28:31 +08:00
|
|
|
%sub = add i64 %x7, -1
|
|
|
|
%conv = uitofp i64 %sub to float
|
|
|
|
%div = fmul float %conv, 5.000000e-01
|
|
|
|
%conv2 = fpext float %div to double
|
[opaque pointer type] Add textual IR support for explicit type parameter to the call instruction
See r230786 and r230794 for similar changes to gep and load
respectively.
Call is a bit different because it often doesn't have a single explicit
type - usually the type is deduced from the arguments, and just the
return type is explicit. In those cases there's no need to change the
IR.
When that's not the case, the IR usually contains the pointer type of
the first operand - but since typed pointers are going away, that
representation is insufficient so I'm just stripping the "pointerness"
of the explicit type away.
This does make the IR a bit weird - it /sort of/ reads like the type of
the first operand: "call void () %x(" but %x is actually of type "void
()*" and will eventually be just of type "ptr". But this seems not too
bad and I don't think it would benefit from repeating the type
("void (), void () * %x(" and then eventually "void (), ptr %x(") as has
been done with gep and load.
This also has a side benefit: since the explicit type is no longer a
pointer, there's no ambiguity between an explicit type and a function
that returns a function pointer. Previously this case needed an explicit
type (eg: a function returning a void() function was written as
"call void () () * @x(" rather than "call void () * @x(" because of the
ambiguity between a function returning a pointer to a void() function
and a function returning void).
No ambiguity means even function pointer return types can just be
written alone, without writing the whole function's type.
This leaves /only/ the varargs case where the explicit type is required.
Given the special type syntax in call instructions, the regex-fu used
for migration was a bit more involved in its own unique way (as every
one of these is) so here it is. Use it in conjunction with the apply.sh
script and associated find/xargs commands I've provided in rr230786 to
migrate your out of tree tests. Do let me know if any of this doesn't
cover your cases & we can iterate on a more general script/regexes to
help others with out of tree tests.
About 9 test cases couldn't be automatically migrated - half of those
were functions returning function pointers, where I just had to manually
delete the function argument types now that we didn't need an explicit
function type there. The other half were typedefs of function types used
in calls - just had to manually drop the * from those.
import fileinput
import sys
import re
pat = re.compile(r'((?:=|:|^|\s)call\s(?:[^@]*?))(\s*$|\s*(?:(?:\[\[[a-zA-Z0-9_]+\]\]|[@%](?:(")?[\\\?@a-zA-Z0-9_.]*?(?(3)"|)|{{.*}}))(?:\(|$)|undef|inttoptr|bitcast|null|asm).*$)')
addrspace_end = re.compile(r"addrspace\(\d+\)\s*\*$")
func_end = re.compile("(?:void.*|\)\s*)\*$")
def conv(match, line):
if not match or re.search(addrspace_end, match.group(1)) or not re.search(func_end, match.group(1)):
return line
return line[:match.start()] + match.group(1)[:match.group(1).rfind('*')].rstrip() + match.group(2) + line[match.end():]
for line in sys.stdin:
sys.stdout.write(conv(re.search(pat, line), line))
llvm-svn: 235145
2015-04-17 07:24:18 +08:00
|
|
|
tail call void (...) @_Z6PrintFz(i8* getelementptr inbounds ({ [1 x i8], [63 x i8] }, { [1 x i8], [63 x i8] }* @.str, i64 0, i32 0, i64 0), double %conv2)
|
2012-07-05 03:28:31 +08:00
|
|
|
ret void
|
|
|
|
}
|
|
|
|
declare void @_Z6PrintFz(...)
|
2012-09-28 00:34:19 +08:00
|
|
|
|
|
|
|
@a = external global i32, align 4
|
|
|
|
@fn1.g = private unnamed_addr constant [9 x i32*] [i32* null, i32* @a, i32* null, i32* null, i32* null, i32* null, i32* null, i32* null, i32* null], align 16
|
|
|
|
@e = external global i32, align 4
|
|
|
|
|
|
|
|
define void @pr13943() nounwind uwtable ssp {
|
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%srcval = load i576, i576* bitcast ([9 x i32*]* @fn1.g to i576*), align 16
|
2012-09-28 00:34:19 +08:00
|
|
|
br label %for.cond
|
|
|
|
|
|
|
|
for.cond: ; preds = %for.inc, %entry
|
|
|
|
%g.0 = phi i576 [ %srcval, %entry ], [ %ins, %for.inc ]
|
2015-02-28 05:17:42 +08:00
|
|
|
%0 = load i32, i32* @e, align 4
|
2012-09-28 00:34:19 +08:00
|
|
|
%1 = lshr i576 %g.0, 64
|
|
|
|
%2 = trunc i576 %1 to i64
|
|
|
|
%3 = inttoptr i64 %2 to i32*
|
|
|
|
%cmp = icmp eq i32* undef, %3
|
|
|
|
%conv2 = zext i1 %cmp to i32
|
|
|
|
%and = and i32 %conv2, %0
|
[opaque pointer type] Add textual IR support for explicit type parameter to the call instruction
See r230786 and r230794 for similar changes to gep and load
respectively.
Call is a bit different because it often doesn't have a single explicit
type - usually the type is deduced from the arguments, and just the
return type is explicit. In those cases there's no need to change the
IR.
When that's not the case, the IR usually contains the pointer type of
the first operand - but since typed pointers are going away, that
representation is insufficient so I'm just stripping the "pointerness"
of the explicit type away.
This does make the IR a bit weird - it /sort of/ reads like the type of
the first operand: "call void () %x(" but %x is actually of type "void
()*" and will eventually be just of type "ptr". But this seems not too
bad and I don't think it would benefit from repeating the type
("void (), void () * %x(" and then eventually "void (), ptr %x(") as has
been done with gep and load.
This also has a side benefit: since the explicit type is no longer a
pointer, there's no ambiguity between an explicit type and a function
that returns a function pointer. Previously this case needed an explicit
type (eg: a function returning a void() function was written as
"call void () () * @x(" rather than "call void () * @x(" because of the
ambiguity between a function returning a pointer to a void() function
and a function returning void).
No ambiguity means even function pointer return types can just be
written alone, without writing the whole function's type.
This leaves /only/ the varargs case where the explicit type is required.
Given the special type syntax in call instructions, the regex-fu used
for migration was a bit more involved in its own unique way (as every
one of these is) so here it is. Use it in conjunction with the apply.sh
script and associated find/xargs commands I've provided in rr230786 to
migrate your out of tree tests. Do let me know if any of this doesn't
cover your cases & we can iterate on a more general script/regexes to
help others with out of tree tests.
About 9 test cases couldn't be automatically migrated - half of those
were functions returning function pointers, where I just had to manually
delete the function argument types now that we didn't need an explicit
function type there. The other half were typedefs of function types used
in calls - just had to manually drop the * from those.
import fileinput
import sys
import re
pat = re.compile(r'((?:=|:|^|\s)call\s(?:[^@]*?))(\s*$|\s*(?:(?:\[\[[a-zA-Z0-9_]+\]\]|[@%](?:(")?[\\\?@a-zA-Z0-9_.]*?(?(3)"|)|{{.*}}))(?:\(|$)|undef|inttoptr|bitcast|null|asm).*$)')
addrspace_end = re.compile(r"addrspace\(\d+\)\s*\*$")
func_end = re.compile("(?:void.*|\)\s*)\*$")
def conv(match, line):
if not match or re.search(addrspace_end, match.group(1)) or not re.search(func_end, match.group(1)):
return line
return line[:match.start()] + match.group(1)[:match.group(1).rfind('*')].rstrip() + match.group(2) + line[match.end():]
for line in sys.stdin:
sys.stdout.write(conv(re.search(pat, line), line))
llvm-svn: 235145
2015-04-17 07:24:18 +08:00
|
|
|
tail call void (...) @fn3(i32 %and) nounwind
|
2012-09-28 00:34:19 +08:00
|
|
|
%tobool = icmp eq i32 undef, 0
|
|
|
|
br i1 %tobool, label %for.inc, label %if.then
|
|
|
|
|
|
|
|
if.then: ; preds = %for.cond
|
|
|
|
ret void
|
|
|
|
|
|
|
|
for.inc: ; preds = %for.cond
|
|
|
|
%4 = shl i576 %1, 384
|
|
|
|
%mask = and i576 %g.0, -726838724295606890509921801691610055141362320587174446476410459910173841445449629921945328942266354949348255351381262292727973638307841
|
|
|
|
%5 = and i576 %4, 726838724295606890509921801691610055141362320587174446476410459910173841445449629921945328942266354949348255351381262292727973638307840
|
|
|
|
%ins = or i576 %5, %mask
|
|
|
|
br label %for.cond
|
|
|
|
}
|
|
|
|
|
|
|
|
declare void @fn3(...)
|
2012-10-13 02:03:04 +08:00
|
|
|
|
|
|
|
; Check coalescing of IMPLICIT_DEF instructions:
|
|
|
|
;
|
|
|
|
; %vreg1 = IMPLICIT_DEF
|
|
|
|
; %vreg2 = MOV32r0
|
|
|
|
;
|
|
|
|
; When coalescing %vreg1 and %vreg2, the IMPLICIT_DEF instruction should be
|
|
|
|
; erased along with its value number.
|
|
|
|
;
|
|
|
|
define void @rdar12474033() nounwind ssp {
|
|
|
|
bb:
|
|
|
|
br i1 undef, label %bb21, label %bb1
|
|
|
|
|
|
|
|
bb1: ; preds = %bb
|
|
|
|
switch i32 undef, label %bb10 [
|
|
|
|
i32 4, label %bb2
|
|
|
|
i32 1, label %bb9
|
|
|
|
i32 5, label %bb3
|
|
|
|
i32 6, label %bb3
|
|
|
|
i32 2, label %bb9
|
|
|
|
]
|
|
|
|
|
|
|
|
bb2: ; preds = %bb1
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb3: ; preds = %bb1, %bb1
|
|
|
|
br i1 undef, label %bb4, label %bb5
|
|
|
|
|
|
|
|
bb4: ; preds = %bb3
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb5: ; preds = %bb3
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp = load <4 x float>, <4 x float>* undef, align 1
|
2012-10-13 02:03:04 +08:00
|
|
|
%tmp6 = bitcast <4 x float> %tmp to i128
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp7 = load <4 x float>, <4 x float>* undef, align 1
|
2012-10-13 02:03:04 +08:00
|
|
|
%tmp8 = bitcast <4 x float> %tmp7 to i128
|
|
|
|
br label %bb10
|
|
|
|
|
|
|
|
bb9: ; preds = %bb1, %bb1
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb10: ; preds = %bb5, %bb1
|
|
|
|
%tmp11 = phi i128 [ undef, %bb1 ], [ %tmp6, %bb5 ]
|
|
|
|
%tmp12 = phi i128 [ 0, %bb1 ], [ %tmp8, %bb5 ]
|
|
|
|
switch i32 undef, label %bb21 [
|
|
|
|
i32 2, label %bb18
|
|
|
|
i32 3, label %bb13
|
|
|
|
i32 5, label %bb16
|
|
|
|
i32 6, label %bb17
|
|
|
|
i32 1, label %bb18
|
|
|
|
]
|
|
|
|
|
|
|
|
bb13: ; preds = %bb10
|
|
|
|
br i1 undef, label %bb15, label %bb14
|
|
|
|
|
|
|
|
bb14: ; preds = %bb13
|
|
|
|
br label %bb21
|
|
|
|
|
|
|
|
bb15: ; preds = %bb13
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb16: ; preds = %bb10
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb17: ; preds = %bb10
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb18: ; preds = %bb10, %bb10
|
|
|
|
%tmp19 = bitcast i128 %tmp11 to <4 x float>
|
|
|
|
%tmp20 = bitcast i128 %tmp12 to <4 x float>
|
|
|
|
br label %bb21
|
|
|
|
|
|
|
|
bb21: ; preds = %bb18, %bb14, %bb10, %bb
|
|
|
|
%tmp22 = phi <4 x float> [ undef, %bb ], [ undef, %bb10 ], [ undef, %bb14 ], [ %tmp20, %bb18 ]
|
|
|
|
%tmp23 = phi <4 x float> [ undef, %bb ], [ undef, %bb10 ], [ undef, %bb14 ], [ %tmp19, %bb18 ]
|
|
|
|
store <4 x float> %tmp23, <4 x float>* undef, align 16
|
|
|
|
store <4 x float> %tmp22, <4 x float>* undef, align 16
|
|
|
|
switch i32 undef, label %bb29 [
|
|
|
|
i32 5, label %bb27
|
|
|
|
i32 1, label %bb24
|
|
|
|
i32 2, label %bb25
|
|
|
|
i32 14, label %bb28
|
|
|
|
i32 4, label %bb26
|
|
|
|
]
|
|
|
|
|
|
|
|
bb24: ; preds = %bb21
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb25: ; preds = %bb21
|
|
|
|
br label %bb29
|
|
|
|
|
|
|
|
bb26: ; preds = %bb21
|
|
|
|
br label %bb29
|
|
|
|
|
|
|
|
bb27: ; preds = %bb21
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
bb28: ; preds = %bb21
|
|
|
|
br label %bb29
|
|
|
|
|
|
|
|
bb29: ; preds = %bb28, %bb26, %bb25, %bb21
|
|
|
|
unreachable
|
|
|
|
}
|
2012-10-28 01:41:27 +08:00
|
|
|
|
|
|
|
define void @pr14194() nounwind uwtable {
|
2015-02-28 05:17:42 +08:00
|
|
|
%tmp = load i64, i64* undef, align 16
|
2012-10-28 01:41:27 +08:00
|
|
|
%tmp1 = trunc i64 %tmp to i32
|
|
|
|
%tmp2 = lshr i64 %tmp, 32
|
|
|
|
%tmp3 = trunc i64 %tmp2 to i32
|
|
|
|
%tmp4 = call { i32, i32 } asm sideeffect "", "=&r,=&r,r,r,0,1,~{dirflag},~{fpsr},~{flags}"(i32 %tmp3, i32 undef, i32 %tmp3, i32 %tmp1) nounwind
|
|
|
|
ret void
|
|
|
|
}
|