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 testcase for this:

Browse Source 
(3) Do not reduce element sizes of small power of two:

  char s[10];
  for (i)
    ...s[i] ...

when the indvar is not eliminable.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20502 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-03-06 22:15:24 +00:00
parent 2f9b19b4c9
commit 7abfec8734
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/dont_reduce_bytes.ll Normal file
View File

@ -0,0 +1,21 @@
; Don't reduce the byte access to P[i], at least not on targets that
; support an efficient 'mem[r1+r2]' addressing mode.
; RUN: llvm-as < %s | opt -loop-reduce | llvm-dis | grep 'getelementptr.*PTR.*INDVAR'
declare bool %pred(int)
void %test(sbyte* %PTR) {
br label %Loop
Loop:
%INDVAR = phi int [0, %0], [%INDVAR2, %Loop]
%STRRED = getelementptr sbyte* %PTR, int %INDVAR
store sbyte 0, sbyte* %STRRED
%INDVAR2 = add int %INDVAR, 1
%cond = call bool %pred(int %INDVAR2) ;; cannot eliminate indvar
br bool %cond, label %Loop, label %Out
Out:
ret void
}