mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 03:53:04 +02:00
451474da4a
trip count value when the original loop iteration condition is signed and the canonical induction variable won't undergo signed overflow. This isn't required for correctness; it just preserves more information about original loop iteration values. Add a getTruncateOrSignExtend method to ScalarEvolution, following getTruncateOrZeroExtend. llvm-svn: 64918
32 lines
886 B
LLVM
32 lines
886 B
LLVM
; RUN: llvm-as < %s | opt -indvars | llvm-dis > %t
|
|
; RUN: grep { = sext i32 %n} %t
|
|
; RUN: grep phi %t | count 1
|
|
; RUN: not grep zext %t
|
|
|
|
define void @foo(i64* nocapture %x, i32 %n) nounwind {
|
|
entry:
|
|
%tmp102 = icmp sgt i32 %n, 0 ; <i1> [#uses=1]
|
|
br i1 %tmp102, label %bb.nph, label %return
|
|
|
|
bb.nph: ; preds = %entry
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb7, %bb.nph
|
|
%i.01 = phi i32 [ %tmp6, %bb7 ], [ 0, %bb.nph ] ; <i32> [#uses=3]
|
|
%tmp1 = sext i32 %i.01 to i64 ; <i64> [#uses=1]
|
|
%tmp4 = getelementptr i64* %x, i32 %i.01 ; <i64*> [#uses=1]
|
|
store i64 %tmp1, i64* %tmp4, align 8
|
|
%tmp6 = add i32 %i.01, 1 ; <i32> [#uses=2]
|
|
br label %bb7
|
|
|
|
bb7: ; preds = %bb
|
|
%tmp10 = icmp slt i32 %tmp6, %n ; <i1> [#uses=1]
|
|
br i1 %tmp10, label %bb, label %bb7.return_crit_edge
|
|
|
|
bb7.return_crit_edge: ; preds = %bb7
|
|
br label %return
|
|
|
|
return: ; preds = %bb7.return_crit_edge, %entry
|
|
ret void
|
|
}
|