mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-18 13:34:04 +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
210 lines
7.2 KiB
LLVM
210 lines
7.2 KiB
LLVM
; RUN: opt < %s -analyze -scalar-evolution | FileCheck %s
|
|
|
|
; ScalarEvolution should be able to understand the loop and eliminate the casts.
|
|
|
|
; CHECK: {%d,+,4}
|
|
|
|
define void @foo(i32* nocapture %d, i32 %n) nounwind {
|
|
entry:
|
|
%0 = icmp sgt i32 %n, 0 ; <i1> [#uses=1]
|
|
br i1 %0, label %bb.nph, label %return
|
|
|
|
bb.nph: ; preds = %entry
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb1, %bb.nph
|
|
%i.02 = phi i32 [ %5, %bb1 ], [ 0, %bb.nph ] ; <i32> [#uses=2]
|
|
%p.01 = phi i8 [ %4, %bb1 ], [ -1, %bb.nph ] ; <i8> [#uses=2]
|
|
%1 = sext i8 %p.01 to i32 ; <i32> [#uses=1]
|
|
%2 = sext i32 %i.02 to i64 ; <i64> [#uses=1]
|
|
%3 = getelementptr i32, i32* %d, i64 %2 ; <i32*> [#uses=1]
|
|
store i32 %1, i32* %3, align 4
|
|
%4 = add i8 %p.01, 1 ; <i8> [#uses=1]
|
|
%5 = add i32 %i.02, 1 ; <i32> [#uses=2]
|
|
br label %bb1
|
|
|
|
bb1: ; preds = %bb
|
|
%6 = icmp slt i32 %5, %n ; <i1> [#uses=1]
|
|
br i1 %6, label %bb, label %bb1.return_crit_edge
|
|
|
|
bb1.return_crit_edge: ; preds = %bb1
|
|
br label %return
|
|
|
|
return: ; preds = %bb1.return_crit_edge, %entry
|
|
ret void
|
|
}
|
|
|
|
; ScalarEvolution should be able to find the maximum tripcount
|
|
; of this multiple-exit loop, and if it doesn't know the exact
|
|
; count, it should say so.
|
|
|
|
; PR7845
|
|
; CHECK: Loop %for.cond: <multiple exits> Unpredictable backedge-taken count.
|
|
; CHECK: Loop %for.cond: max backedge-taken count is 5
|
|
|
|
@.str = private constant [4 x i8] c"%d\0A\00" ; <[4 x i8]*> [#uses=2]
|
|
|
|
define i32 @main() nounwind {
|
|
entry:
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.inc, %entry
|
|
%g_4.0 = phi i32 [ 0, %entry ], [ %add, %for.inc ] ; <i32> [#uses=5]
|
|
%cmp = icmp slt i32 %g_4.0, 5 ; <i1> [#uses=1]
|
|
br i1 %cmp, label %for.body, label %for.end
|
|
|
|
for.body: ; preds = %for.cond
|
|
%conv = trunc i32 %g_4.0 to i16 ; <i16> [#uses=1]
|
|
%tobool.not = icmp eq i16 %conv, 0 ; <i1> [#uses=1]
|
|
%tobool3 = icmp ne i32 %g_4.0, 0 ; <i1> [#uses=1]
|
|
%or.cond = and i1 %tobool.not, %tobool3 ; <i1> [#uses=1]
|
|
br i1 %or.cond, label %for.end, label %for.inc
|
|
|
|
for.inc: ; preds = %for.body
|
|
%add = add nsw i32 %g_4.0, 1 ; <i32> [#uses=1]
|
|
br label %for.cond
|
|
|
|
for.end: ; preds = %for.body, %for.cond
|
|
%call = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str, i64 0, i64 0), i32 %g_4.0) nounwind ; <i32> [#uses=0]
|
|
ret i32 0
|
|
}
|
|
|
|
declare i32 @printf(i8*, ...)
|
|
|
|
define void @test(i8* %a, i32 %n) nounwind {
|
|
entry:
|
|
%cmp1 = icmp sgt i32 %n, 0
|
|
br i1 %cmp1, label %for.body.lr.ph, label %for.end
|
|
|
|
for.body.lr.ph: ; preds = %entry
|
|
%tmp = zext i32 %n to i64
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body, %for.body.lr.ph
|
|
%indvar = phi i64 [ %indvar.next, %for.body ], [ 0, %for.body.lr.ph ]
|
|
%arrayidx = getelementptr i8, i8* %a, i64 %indvar
|
|
store i8 0, i8* %arrayidx, align 1
|
|
%indvar.next = add i64 %indvar, 1
|
|
%exitcond = icmp ne i64 %indvar.next, %tmp
|
|
br i1 %exitcond, label %for.body, label %for.cond.for.end_crit_edge
|
|
|
|
for.cond.for.end_crit_edge: ; preds = %for.body
|
|
br label %for.end
|
|
|
|
for.end: ; preds = %for.cond.for.end_crit_edge, %entry
|
|
ret void
|
|
}
|
|
|
|
; CHECK: Determining loop execution counts for: @test
|
|
; CHECK-NEXT: backedge-taken count is
|
|
; CHECK-NEXT: max backedge-taken count is -1
|
|
|
|
; PR19799: Indvars miscompile due to an incorrect max backedge taken count from SCEV.
|
|
; CHECK-LABEL: @pr19799
|
|
; CHECK: Loop %for.body.i: <multiple exits> Unpredictable backedge-taken count.
|
|
; CHECK: Loop %for.body.i: max backedge-taken count is 1
|
|
@a = common global i32 0, align 4
|
|
|
|
define i32 @pr19799() {
|
|
entry:
|
|
store i32 -1, i32* @a, align 4
|
|
br label %for.body.i
|
|
|
|
for.body.i: ; preds = %for.cond.i, %entry
|
|
%storemerge1.i = phi i32 [ -1, %entry ], [ %add.i.i, %for.cond.i ]
|
|
%tobool.i = icmp eq i32 %storemerge1.i, 0
|
|
%add.i.i = add nsw i32 %storemerge1.i, 2
|
|
br i1 %tobool.i, label %bar.exit, label %for.cond.i
|
|
|
|
for.cond.i: ; preds = %for.body.i
|
|
store i32 %add.i.i, i32* @a, align 4
|
|
%cmp.i = icmp slt i32 %storemerge1.i, 0
|
|
br i1 %cmp.i, label %for.body.i, label %bar.exit
|
|
|
|
bar.exit: ; preds = %for.cond.i, %for.body.i
|
|
ret i32 0
|
|
}
|
|
|
|
; PR18886: Indvars miscompile due to an incorrect max backedge taken count from SCEV.
|
|
; CHECK-LABEL: @pr18886
|
|
; CHECK: Loop %for.body: <multiple exits> Unpredictable backedge-taken count.
|
|
; CHECK: Loop %for.body: max backedge-taken count is 3
|
|
@aa = global i64 0, align 8
|
|
|
|
define i32 @pr18886() {
|
|
entry:
|
|
store i64 -21, i64* @aa, align 8
|
|
br label %for.body
|
|
|
|
for.body:
|
|
%storemerge1 = phi i64 [ -21, %entry ], [ %add, %for.cond ]
|
|
%tobool = icmp eq i64 %storemerge1, 0
|
|
%add = add nsw i64 %storemerge1, 8
|
|
br i1 %tobool, label %return, label %for.cond
|
|
|
|
for.cond:
|
|
store i64 %add, i64* @aa, align 8
|
|
%cmp = icmp slt i64 %add, 9
|
|
br i1 %cmp, label %for.body, label %return
|
|
|
|
return:
|
|
%retval.0 = phi i32 [ 1, %for.body ], [ 0, %for.cond ]
|
|
ret i32 %retval.0
|
|
}
|
|
|
|
; Here we have a must-exit loop latch that is not computable and a
|
|
; may-exit early exit that can only have one non-exiting iteration
|
|
; before the check is forever skipped.
|
|
;
|
|
; CHECK-LABEL: @cannot_compute_mustexit
|
|
; CHECK: Loop %for.body.i: <multiple exits> Unpredictable backedge-taken count.
|
|
; CHECK: Loop %for.body.i: Unpredictable max backedge-taken count.
|
|
@b = common global i32 0, align 4
|
|
|
|
define i32 @cannot_compute_mustexit() {
|
|
entry:
|
|
store i32 -1, i32* @a, align 4
|
|
br label %for.body.i
|
|
|
|
for.body.i: ; preds = %for.cond.i, %entry
|
|
%storemerge1.i = phi i32 [ -1, %entry ], [ %add.i.i, %for.cond.i ]
|
|
%tobool.i = icmp eq i32 %storemerge1.i, 0
|
|
%add.i.i = add nsw i32 %storemerge1.i, 2
|
|
br i1 %tobool.i, label %bar.exit, label %for.cond.i
|
|
|
|
for.cond.i: ; preds = %for.body.i
|
|
store i32 %add.i.i, i32* @a, align 4
|
|
%ld = load volatile i32, i32* @b
|
|
%cmp.i = icmp ne i32 %ld, 0
|
|
br i1 %cmp.i, label %for.body.i, label %bar.exit
|
|
|
|
bar.exit: ; preds = %for.cond.i, %for.body.i
|
|
ret i32 0
|
|
}
|
|
|
|
; This loop has two must-exits, both of which dominate the latch. The
|
|
; MaxBECount should be the minimum of them.
|
|
;
|
|
; CHECK-LABEL: @two_mustexit
|
|
; CHECK: Loop %for.body.i: <multiple exits> Unpredictable backedge-taken count.
|
|
; CHECK: Loop %for.body.i: max backedge-taken count is 1
|
|
define i32 @two_mustexit() {
|
|
entry:
|
|
store i32 -1, i32* @a, align 4
|
|
br label %for.body.i
|
|
|
|
for.body.i: ; preds = %for.cond.i, %entry
|
|
%storemerge1.i = phi i32 [ -1, %entry ], [ %add.i.i, %for.cond.i ]
|
|
%tobool.i = icmp sgt i32 %storemerge1.i, 0
|
|
%add.i.i = add nsw i32 %storemerge1.i, 2
|
|
br i1 %tobool.i, label %bar.exit, label %for.cond.i
|
|
|
|
for.cond.i: ; preds = %for.body.i
|
|
store i32 %add.i.i, i32* @a, align 4
|
|
%cmp.i = icmp slt i32 %storemerge1.i, 3
|
|
br i1 %cmp.i, label %for.body.i, label %bar.exit
|
|
|
|
bar.exit: ; preds = %for.cond.i, %for.body.i
|
|
ret i32 0
|
|
}
|