mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-25 13:35:10 +00:00
28beeeac4d
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41097 91177308-0d34-0410-b5e6-96231b3b80d8
25 lines
597 B
LLVM
25 lines
597 B
LLVM
; RUN: llvm-upgrade < %s | llvm-as | opt -loop-reduce | llvm-dis | grep phi | count 1
|
|
|
|
; This testcase should have ONE stride 18 indvar, the other use should have a
|
|
; loop invariant value (B) added to it inside of the loop, instead of having
|
|
; a whole indvar based on B for it.
|
|
|
|
declare bool %cond(uint)
|
|
|
|
void %test(uint %B) {
|
|
br label %Loop
|
|
Loop:
|
|
%IV = phi uint [0, %0], [%IVn, %Loop]
|
|
|
|
%C = mul uint %IV, 18
|
|
%D = mul uint %IV, 18
|
|
%E = add uint %D, %B
|
|
|
|
%cnd = call bool %cond(uint %E)
|
|
call bool %cond(uint %C)
|
|
%IVn = add uint %IV, 1
|
|
br bool %cnd, label %Loop, label %Out
|
|
Out:
|
|
ret void
|
|
}
|