diff options
| author | Chris Lattner <sabre@nondot.org> | 2009-11-10 01:57:31 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2009-11-10 01:57:31 +0000 |
| commit | 38c44ea6b03fa861b23e72961781434cdea28d1f (patch) | |
| tree | edb051946e886fbda306d664a172c295af5801a7 /llvm/test/Transforms/JumpThreading | |
| parent | ee89d5a4d0dd5c0e2ad7cb282c394fde63893d8f (diff) | |
| download | bcm5719-llvm-38c44ea6b03fa861b23e72961781434cdea28d1f.tar.gz bcm5719-llvm-38c44ea6b03fa861b23e72961781434cdea28d1f.zip | |
make jump threading recursively simplify expressions instead of doing it
just one level deep. On the testcase we go from getting this:
F1: ; preds = %T2
%F = and i1 true, %cond ; <i1> [#uses=1]
br i1 %F, label %X, label %Y
to a fully threaded:
F1: ; preds = %T2
br label %Y
This changes gets us to the point where we're forming (too many) switch
instructions on doug's strswitch testcase.
llvm-svn: 86646
Diffstat (limited to 'llvm/test/Transforms/JumpThreading')
| -rw-r--r-- | llvm/test/Transforms/JumpThreading/basic.ll | 32 |
1 files changed, 32 insertions, 0 deletions
diff --git a/llvm/test/Transforms/JumpThreading/basic.ll b/llvm/test/Transforms/JumpThreading/basic.ll index 7b444ad0a91..1be086b645d 100644 --- a/llvm/test/Transforms/JumpThreading/basic.ll +++ b/llvm/test/Transforms/JumpThreading/basic.ll @@ -203,3 +203,35 @@ F2: ; CHECK-NEXT: phi i32 } + +declare i1 @test8a() + +define i32 @test8b(i1 %cond, i1 %cond2) { +; CHECK: @test8b +T0: + %A = call i1 @test8a() + br i1 %A, label %T1, label %F1 +T1: + %B = call i1 @test8a() + br i1 %B, label %T2, label %F1 +T2: + %C = call i1 @test8a() + br i1 %cond, label %T3, label %F1 +T3: + ret i32 0 + +F1: +; TODO: F1 uncond branch block should be removed, T2 should jump directly to Y. +; CHECK: F1: +; CHECK-NEXT br label %Y + %D = phi i32 [0, %T0], [0, %T1], [1, %T2] + %E = icmp eq i32 %D, 1 + %F = and i1 %E, %cond + br i1 %F, label %X, label %Y +X: + call i1 @test8a() + ret i32 1 +Y: + ret i32 2 +} + |
