mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-30 16:34:03 +00:00
4e8a98519e
casted induction variables in cases where the cast isn't foldable. It ended up being a pessimization in many cases. This could be fixed, but it would require a bunch of complicated code in IVUsers' clients. The advantages of this approach aren't visible enough to justify it at this time. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@73706 91177308-0d34-0410-b5e6-96231b3b80d8
16 lines
355 B
LLVM
16 lines
355 B
LLVM
; RUN: llvm-as < %s | opt -scalar-evolution -analyze -disable-output \
|
|
; RUN: | grep {\\--> (zext i4 {-7,+,-8}<loop> to i32)}
|
|
|
|
define fastcc void @foo() nounwind {
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%i = phi i32 [ 0, %entry ], [ %t2, %loop ]
|
|
%t0 = add i32 %i, 9
|
|
%t1 = and i32 %t0, 9
|
|
store i32 %t1, i32* null
|
|
%t2 = add i32 %i, 8
|
|
br label %loop
|
|
}
|