mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-28 19:31:58 +00:00
7b61a70193
indirect branches correctly. Under some circumstances, this led to the deletion of basic blocks that were the destination of indirect branches. In that case it left indirect branches to nowhere in the code. This patch replaces, and is more general than either of the previous fixes for indirect-branch-analysis issues, r181161 and r186461. For other branches (not indirect) this refactor should have *almost* identical behavior to the previous version. There are some corner cases where this refactor is able to analyze blocks that the previous version could not (e.g. this necessitated the update to thumb2-ifcvt2.ll). <rdar://problem/14464830> git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@186735 91177308-0d34-0410-b5e6-96231b3b80d8
95 lines
2.6 KiB
LLVM
95 lines
2.6 KiB
LLVM
; RUN: llc < %s -mtriple=thumbv7-apple-ios | FileCheck %s
|
|
|
|
define void @foo(i32 %X, i32 %Y) {
|
|
entry:
|
|
; CHECK-LABEL: foo:
|
|
; CHECK: it ne
|
|
; CHECK: cmpne
|
|
; CHECK: it hi
|
|
; CHECK: pophi {r7, pc}
|
|
%tmp1 = icmp ult i32 %X, 4 ; <i1> [#uses=1]
|
|
%tmp4 = icmp eq i32 %Y, 0 ; <i1> [#uses=1]
|
|
%tmp7 = or i1 %tmp4, %tmp1 ; <i1> [#uses=1]
|
|
br i1 %tmp7, label %cond_true, label %UnifiedReturnBlock
|
|
|
|
cond_true: ; preds = %entry
|
|
%tmp10 = call i32 (...)* @bar( ) ; <i32> [#uses=0]
|
|
ret void
|
|
|
|
UnifiedReturnBlock: ; preds = %entry
|
|
ret void
|
|
}
|
|
|
|
declare i32 @bar(...)
|
|
|
|
; FIXME: Need post-ifcvt branch folding to get rid of the extra br at end of BB1.
|
|
|
|
%struct.quad_struct = type { i32, i32, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct*, %struct.quad_struct* }
|
|
|
|
define fastcc i32 @CountTree(%struct.quad_struct* %tree) {
|
|
entry:
|
|
; CHECK-LABEL: CountTree:
|
|
; CHECK: bne
|
|
; CHECK: cmp
|
|
; CHECK: it eq
|
|
; CHECK: cmpeq
|
|
; CHECK: itt eq
|
|
; CHECK: moveq
|
|
; CHECK: popeq
|
|
br label %tailrecurse
|
|
|
|
tailrecurse: ; preds = %bb, %entry
|
|
%tmp6 = load %struct.quad_struct** null ; <%struct.quad_struct*> [#uses=1]
|
|
%tmp9 = load %struct.quad_struct** null ; <%struct.quad_struct*> [#uses=2]
|
|
%tmp12 = load %struct.quad_struct** null ; <%struct.quad_struct*> [#uses=1]
|
|
%tmp14 = icmp eq %struct.quad_struct* null, null ; <i1> [#uses=1]
|
|
%tmp17 = icmp eq %struct.quad_struct* %tmp6, null ; <i1> [#uses=1]
|
|
%tmp23 = icmp eq %struct.quad_struct* %tmp9, null ; <i1> [#uses=1]
|
|
%tmp29 = icmp eq %struct.quad_struct* %tmp12, null ; <i1> [#uses=1]
|
|
%bothcond = and i1 %tmp17, %tmp14 ; <i1> [#uses=1]
|
|
%bothcond1 = and i1 %bothcond, %tmp23 ; <i1> [#uses=1]
|
|
%bothcond2 = and i1 %bothcond1, %tmp29 ; <i1> [#uses=1]
|
|
br i1 %bothcond2, label %return, label %bb
|
|
|
|
bb: ; preds = %tailrecurse
|
|
%tmp41 = tail call fastcc i32 @CountTree( %struct.quad_struct* %tmp9 ) ; <i32> [#uses=0]
|
|
br label %tailrecurse
|
|
|
|
return: ; preds = %tailrecurse
|
|
ret i32 0
|
|
}
|
|
|
|
%struct.SString = type { i8*, i32, i32 }
|
|
|
|
declare void @abort()
|
|
|
|
define fastcc void @t1(%struct.SString* %word, i8 signext %c) {
|
|
entry:
|
|
; CHECK-LABEL: t1:
|
|
; CHECK: it ne
|
|
; CHECK: popne {r7, pc}
|
|
%tmp1 = icmp eq %struct.SString* %word, null ; <i1> [#uses=1]
|
|
br i1 %tmp1, label %cond_true, label %cond_false
|
|
|
|
cond_true: ; preds = %entry
|
|
tail call void @abort( )
|
|
unreachable
|
|
|
|
cond_false: ; preds = %entry
|
|
ret void
|
|
}
|
|
|
|
define fastcc void @t2() nounwind {
|
|
entry:
|
|
; CHECK-LABEL: t2:
|
|
; CHECK: cmp r0, #0
|
|
; CHECK: %growMapping.exit
|
|
br i1 undef, label %bb.i.i3, label %growMapping.exit
|
|
|
|
bb.i.i3: ; preds = %entry
|
|
unreachable
|
|
|
|
growMapping.exit: ; preds = %entry
|
|
unreachable
|
|
}
|