RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-13 14:46:53 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

add test for this:

Browse Source 
(1) Allow loop invariant expressions to come before the induction variable (instead of just
constants):

   int x;
   for (i)
    ...a[x][i]


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20499 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-03-06 22:04:27 +00:00
parent 3a334cb868
commit 7fe11f8711
1 changed files with 21 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
test/Transforms/LoopStrengthReduce/invariant_value_first.ll Normal file
View File

@ -0,0 +1,21 @@
; Check that the index of 'P[outer]' is pulled out of the loop.
; RUN: llvm-as < %s | opt -loop-reduce | llvm-dis | not grep 'getelementptr.*%outer.*%INDVAR'
declare bool %pred()
declare int %foo()
void %test([10000 x int]* %P) {
%outer = call int %foo()
br label %Loop
Loop:
%INDVAR = phi int [0, %0], [%INDVAR2, %Loop]
%STRRED = getelementptr [10000 x int]* %P, int %outer, int %INDVAR
store int 0, int* %STRRED
%INDVAR2 = add int %INDVAR, 1
%cond = call bool %pred()
br bool %cond, label %Loop, label %Out
Out:
ret void
}