mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-13 23:18:58 +00:00
32b845d223
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))
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@235145 91177308-0d34-0410-b5e6-96231b3b80d8
176 lines
5.5 KiB
LLVM
176 lines
5.5 KiB
LLVM
; RUN: llc < %s -x86-early-ifcvt -stress-early-ifcvt | FileCheck %s
|
|
target triple = "x86_64-apple-macosx10.8.0"
|
|
|
|
; CHECK: mm2
|
|
define i32 @mm2(i32* nocapture %p, i32 %n) nounwind uwtable readonly ssp {
|
|
entry:
|
|
br label %do.body
|
|
|
|
; CHECK: do.body
|
|
; Loop body has no branches before the backedge.
|
|
; CHECK-NOT: LBB
|
|
do.body:
|
|
%max.0 = phi i32 [ 0, %entry ], [ %max.1, %do.cond ]
|
|
%min.0 = phi i32 [ 0, %entry ], [ %min.1, %do.cond ]
|
|
%n.addr.0 = phi i32 [ %n, %entry ], [ %dec, %do.cond ]
|
|
%p.addr.0 = phi i32* [ %p, %entry ], [ %incdec.ptr, %do.cond ]
|
|
%incdec.ptr = getelementptr inbounds i32, i32* %p.addr.0, i64 1
|
|
%0 = load i32, i32* %p.addr.0, align 4
|
|
%cmp = icmp sgt i32 %0, %max.0
|
|
br i1 %cmp, label %do.cond, label %if.else
|
|
|
|
if.else:
|
|
%cmp1 = icmp slt i32 %0, %min.0
|
|
%.min.0 = select i1 %cmp1, i32 %0, i32 %min.0
|
|
br label %do.cond
|
|
|
|
do.cond:
|
|
%max.1 = phi i32 [ %0, %do.body ], [ %max.0, %if.else ]
|
|
%min.1 = phi i32 [ %min.0, %do.body ], [ %.min.0, %if.else ]
|
|
; CHECK: decl %esi
|
|
; CHECK: jne LBB
|
|
%dec = add i32 %n.addr.0, -1
|
|
%tobool = icmp eq i32 %dec, 0
|
|
br i1 %tobool, label %do.end, label %do.body
|
|
|
|
do.end:
|
|
%sub = sub nsw i32 %max.1, %min.1
|
|
ret i32 %sub
|
|
}
|
|
|
|
; CHECK: multipreds
|
|
; Deal with alternative tail predecessors
|
|
; CHECK-NOT: LBB
|
|
; CHECK: cmov
|
|
; CHECK-NOT: LBB
|
|
; CHECK: cmov
|
|
; CHECK-NOT: LBB
|
|
; CHECK: fprintf
|
|
|
|
define void @multipreds(i32 %sw) nounwind uwtable ssp {
|
|
entry:
|
|
switch i32 %sw, label %if.then29 [
|
|
i32 0, label %if.then37
|
|
i32 127, label %if.end41
|
|
]
|
|
|
|
if.then29:
|
|
br label %if.end41
|
|
|
|
if.then37:
|
|
br label %if.end41
|
|
|
|
if.end41:
|
|
%exit_status.0 = phi i32 [ 2, %if.then29 ], [ 0, %if.then37 ], [ 66, %entry ]
|
|
call void (...) @fprintf(i32 %exit_status.0) nounwind
|
|
unreachable
|
|
}
|
|
|
|
declare void @fprintf(...) nounwind
|
|
|
|
; CHECK: BZ2_decompress
|
|
; This test case contains irreducible control flow, so MachineLoopInfo doesn't
|
|
; recognize the cycle in the CFG. This would confuse MachineTraceMetrics.
|
|
define void @BZ2_decompress(i8* %s) nounwind ssp {
|
|
entry:
|
|
switch i32 undef, label %sw.default [
|
|
i32 39, label %if.end.sw.bb2050_crit_edge
|
|
i32 36, label %sw.bb1788
|
|
i32 37, label %if.end.sw.bb1855_crit_edge
|
|
i32 40, label %sw.bb2409
|
|
i32 38, label %sw.bb1983
|
|
i32 44, label %if.end.sw.bb3058_crit_edge
|
|
]
|
|
|
|
if.end.sw.bb3058_crit_edge: ; preds = %entry
|
|
br label %save_state_and_return
|
|
|
|
if.end.sw.bb1855_crit_edge: ; preds = %entry
|
|
br label %save_state_and_return
|
|
|
|
if.end.sw.bb2050_crit_edge: ; preds = %entry
|
|
br label %sw.bb2050
|
|
|
|
sw.bb1788: ; preds = %entry
|
|
br label %save_state_and_return
|
|
|
|
sw.bb1983: ; preds = %entry
|
|
br i1 undef, label %save_state_and_return, label %if.then1990
|
|
|
|
if.then1990: ; preds = %sw.bb1983
|
|
br label %while.body2038
|
|
|
|
while.body2038: ; preds = %sw.bb2050, %if.then1990
|
|
%groupPos.8 = phi i32 [ 0, %if.then1990 ], [ %groupPos.9, %sw.bb2050 ]
|
|
br i1 undef, label %save_state_and_return, label %if.end2042
|
|
|
|
if.end2042: ; preds = %while.body2038
|
|
br i1 undef, label %if.end2048, label %while.end2104
|
|
|
|
if.end2048: ; preds = %if.end2042
|
|
%bsLive2054.pre = getelementptr inbounds i8, i8* %s, i32 8
|
|
br label %sw.bb2050
|
|
|
|
sw.bb2050: ; preds = %if.end2048, %if.end.sw.bb2050_crit_edge
|
|
%groupPos.9 = phi i32 [ 0, %if.end.sw.bb2050_crit_edge ], [ %groupPos.8, %if.end2048 ]
|
|
%and2064 = and i32 undef, 1
|
|
br label %while.body2038
|
|
|
|
while.end2104: ; preds = %if.end2042
|
|
br i1 undef, label %save_state_and_return, label %if.end2117
|
|
|
|
if.end2117: ; preds = %while.end2104
|
|
br i1 undef, label %while.body2161.lr.ph, label %while.body2145.lr.ph
|
|
|
|
while.body2145.lr.ph: ; preds = %if.end2117
|
|
br label %save_state_and_return
|
|
|
|
while.body2161.lr.ph: ; preds = %if.end2117
|
|
br label %save_state_and_return
|
|
|
|
sw.bb2409: ; preds = %entry
|
|
br label %save_state_and_return
|
|
|
|
sw.default: ; preds = %entry
|
|
call void @BZ2_bz__AssertH__fail() nounwind
|
|
br label %save_state_and_return
|
|
|
|
save_state_and_return:
|
|
%groupPos.14 = phi i32 [ 0, %sw.default ], [ %groupPos.8, %while.body2038 ], [ %groupPos.8, %while.end2104 ], [ 0, %if.end.sw.bb3058_crit_edge ], [ 0, %if.end.sw.bb1855_crit_edge ], [ %groupPos.8, %while.body2161.lr.ph ], [ %groupPos.8, %while.body2145.lr.ph ], [ 0, %sw.bb2409 ], [ 0, %sw.bb1788 ], [ 0, %sw.bb1983 ]
|
|
store i32 %groupPos.14, i32* undef, align 4
|
|
ret void
|
|
}
|
|
|
|
declare void @BZ2_bz__AssertH__fail()
|
|
|
|
; Make sure we don't speculate on div/idiv instructions
|
|
; CHECK: test_idiv
|
|
; CHECK-NOT: cmov
|
|
define i32 @test_idiv(i32 %a, i32 %b) nounwind uwtable readnone ssp {
|
|
%1 = icmp eq i32 %b, 0
|
|
br i1 %1, label %4, label %2
|
|
|
|
; <label>:2 ; preds = %0
|
|
%3 = sdiv i32 %a, %b
|
|
br label %4
|
|
|
|
; <label>:4 ; preds = %0, %2
|
|
%5 = phi i32 [ %3, %2 ], [ %a, %0 ]
|
|
ret i32 %5
|
|
}
|
|
|
|
; CHECK: test_div
|
|
; CHECK-NOT: cmov
|
|
define i32 @test_div(i32 %a, i32 %b) nounwind uwtable readnone ssp {
|
|
%1 = icmp eq i32 %b, 0
|
|
br i1 %1, label %4, label %2
|
|
|
|
; <label>:2 ; preds = %0
|
|
%3 = udiv i32 %a, %b
|
|
br label %4
|
|
|
|
; <label>:4 ; preds = %0, %2
|
|
%5 = phi i32 [ %3, %2 ], [ %a, %0 ]
|
|
ret i32 %5
|
|
}
|