mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-01 08:23:21 +01:00
52ed61204b
which branch on undef to branch on a boolean constant for the edge exiting the loop. This helps ScalarEvolution compute trip counts for loops. Teach ScalarEvolution to recognize single-value PHIs, when safe, and ForgetSymbolicName to forget such single-value PHI nodes as apprpriate in ForgetSymbolicName. llvm-svn: 97126
16 lines
437 B
LLVM
16 lines
437 B
LLVM
; RUN: opt < %s -indvars -S | grep indvar
|
|
|
|
define i32 @test() {
|
|
; <label>:0
|
|
br i1 true, label %LoopHead, label %LoopHead
|
|
|
|
LoopHead: ; preds = %LoopHead, %0, %0
|
|
%A = phi i32 [ 7, %0 ], [ 7, %0 ], [ %B, %LoopHead ] ; <i32> [#uses=1]
|
|
%B = add i32 %A, 1 ; <i32> [#uses=2]
|
|
br i1 true, label %LoopHead, label %Out
|
|
|
|
Out: ; preds = %LoopHead
|
|
ret i32 %B
|
|
}
|
|
|