mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-28 14:32:51 +01:00
81169f2e1b
SGT exit condition. Essentially, the correct way to flip an inequality in 2's complement is the not operator, not the negation operator. That said, the difference only affects cases involving INT_MIN. Also, enhance the pre-test search logic to be a bit smarter about inequalities flipped with a not operator, so it can eliminate the smax from the iteration count for simple loops. llvm-svn: 54184
28 lines
786 B
LLVM
28 lines
786 B
LLVM
; RUN: llvm-as < %s | opt -analyze -scalar-evolution -disable-output \
|
|
; RUN: -scalar-evolution-max-iterations=0 | \
|
|
; RUN: grep -F "( -1 + ( -1 * %j)) iterations"
|
|
; PR2607
|
|
|
|
define i32 @_Z1aj(i32 %j) nounwind {
|
|
entry:
|
|
icmp sgt i32 0, %j ; <i1>:0 [#uses=1]
|
|
br i1 %0, label %bb.preheader, label %return
|
|
|
|
bb.preheader: ; preds = %entry
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb, %bb.preheader
|
|
%i.01 = phi i32 [ %1, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
|
|
add i32 %i.01, -1 ; <i32>:1 [#uses=3]
|
|
icmp sgt i32 %1, %j ; <i1>:2 [#uses=1]
|
|
br i1 %2, label %bb, label %return.loopexit
|
|
|
|
return.loopexit: ; preds = %bb
|
|
br label %return
|
|
|
|
return: ; preds = %return.loopexit, %entry
|
|
%i.0.lcssa = phi i32 [ 0, %entry ], [ %1, %return.loopexit ] ; <i32> [#uses=1]
|
|
ret i32 %i.0.lcssa
|
|
}
|
|
|