6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-24 22:24:54 +00:00
Code Issues Projects Releases Wiki Activity

Rewrite code that 1) filters loops and 2) calculates new loop bounds.

Browse Source 
This fixes many bugs. I will add more test cases in a separate check-in.

Some day, the code that manipulates CFG and updates dom. info could use refactoring help.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60554 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel
2008-12-04 21:38:42 +00:00
parent 6002e993e0
commit 3831005eb1
6 changed files with 814 additions and 1354 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
test/Transforms/LoopIndexSplit/2008-10-10-OneIteration.ll
View File

@@ -1,4 +1,4 @@
; RUN: llvm-as < %s | opt -loop-index-split | llvm-dis | grep sle | count 1
; RUN: llvm-as < %s | opt -loop-index-split -stats -disable-output |& grep "1 loop-index-split"
; PR 2869
@w = external global [2 x [2 x i32]] ; <[2 x [2 x i32]]*> [#uses=5]
@@ -10,11 +10,11 @@ entry:
br label %bb1.i.outer
bb1.i.outer: ; preds = %bb5.i, %entry
%i.0.reg2mem.0.ph.i.ph = phi i32 [ 0, %entry ], [ %4, %bb5.i ] ; <i32> [#uses=3]
%i.0.reg2mem.0.ph.i.ph = phi i32 [ 0, %entry ], [ %indvar.next1, %bb5.i ] ; <i32> [#uses=3]
br label %bb1.i
bb1.i: ; preds = %bb3.i, %bb1.i.outer
%j.0.reg2mem.0.i = phi i32 [ %2, %bb3.i ], [ 0, %bb1.i.outer ] ; <i32> [#uses=3]
%j.0.reg2mem.0.i = phi i32 [ 0, %bb1.i.outer ], [ %indvar.next, %bb3.i ] ; <i32> [#uses=3]
%0 = icmp eq i32 %i.0.reg2mem.0.ph.i.ph, %j.0.reg2mem.0.i ; <i1> [#uses=1]
br i1 %0, label %bb2.i, label %bb3.i
@@ -24,34 +24,34 @@ bb2.i: ; preds = %bb1.i
br label %bb3.i
bb3.i: ; preds = %bb2.i, %bb1.i
%2 = add i32 %j.0.reg2mem.0.i, 1 ; <i32> [#uses=2]
%3 = icmp sgt i32 %2, 1 ; <i1> [#uses=1]
br i1 %3, label %bb5.i, label %bb1.i
%indvar.next = add i32 %j.0.reg2mem.0.i, 1 ; <i32> [#uses=2]
%exitcond = icmp eq i32 %indvar.next, 2 ; <i1> [#uses=1]
br i1 %exitcond, label %bb5.i, label %bb1.i
bb5.i: ; preds = %bb3.i
%4 = add i32 %i.0.reg2mem.0.ph.i.ph, 1 ; <i32> [#uses=2]
%5 = icmp sgt i32 %4, 1 ; <i1> [#uses=1]
br i1 %5, label %f.exit, label %bb1.i.outer
%indvar.next1 = add i32 %i.0.reg2mem.0.ph.i.ph, 1 ; <i32> [#uses=2]
%exitcond2 = icmp eq i32 %indvar.next1, 2 ; <i1> [#uses=1]
br i1 %exitcond2, label %f.exit, label %bb1.i.outer
f.exit: ; preds = %bb5.i
%6 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 0, i32 0), align 4 ; <i32> [#uses=1]
%7 = icmp eq i32 %6, 1 ; <i1> [#uses=1]
br i1 %7, label %bb, label %bb3
%2 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 0, i32 0), align 4 ; <i32> [#uses=1]
%3 = icmp eq i32 %2, 1 ; <i1> [#uses=1]
br i1 %3, label %bb, label %bb3
bb: ; preds = %f.exit
%8 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 1, i32 1), align 4 ; <i32> [#uses=1]
%9 = icmp eq i32 %8, 1 ; <i1> [#uses=1]
br i1 %9, label %bb1, label %bb3
%4 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 1, i32 1), align 4 ; <i32> [#uses=1]
%5 = icmp eq i32 %4, 1 ; <i1> [#uses=1]
br i1 %5, label %bb1, label %bb3
bb1: ; preds = %bb
%10 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 1, i32 0), align 4 ; <i32> [#uses=1]
%11 = icmp eq i32 %10, 0 ; <i1> [#uses=1]
br i1 %11, label %bb2, label %bb3
%6 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 1, i32 0), align 4 ; <i32> [#uses=1]
%7 = icmp eq i32 %6, 0 ; <i1> [#uses=1]
br i1 %7, label %bb2, label %bb3
bb2: ; preds = %bb1
%12 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 0, i32 1), align 4 ; <i32> [#uses=1]
%13 = icmp eq i32 %12, 0 ; <i1> [#uses=1]
br i1 %13, label %bb4, label %bb3
%8 = load i32* getelementptr ([2 x [2 x i32]]* @w, i32 0, i32 0, i32 1), align 4 ; <i32> [#uses=1]
%9 = icmp eq i32 %8, 0 ; <i1> [#uses=1]
br i1 %9, label %bb4, label %bb3
bb3: ; preds = %bb2, %bb1, %bb, %f.exit
tail call void @abort() noreturn nounwind