RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-05-17 19:06:09 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
158,866 Commits 39 Branches 10 Tags
Commit Graph

4 Commits

Author SHA1 Message Date
Elena Demikhovsky
f7282f8ee5 Reverted patch 273864 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@274115 91177308-0d34-0410-b5e6-96231b3b80d8
 2016-06-29 10:01:06 +00:00
Elena Demikhovsky
1abadbff39 Fixed consecutive memory access detection in Loop Vectorizer. 
It did not handle correctly cases without GEP.

The following loop wasn't vectorized:

for (int i=0; i<len; i++)

  *to++ = *from++;

I use getPtrStride() to find Stride for memory access and return 0 is the Stride is not 1 or -1.

Re-commit rL273257 - revision: http://reviews.llvm.org/D20789



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@273864 91177308-0d34-0410-b5e6-96231b3b80d8
 2016-06-27 11:19:23 +00:00
Chad Rosier
f8f78cdf6d Add newline to test. NFC. 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@246653 91177308-0d34-0410-b5e6-96231b3b80d8
 2015-09-02 14:06:16 +00:00
James Molloy
fe89784bf1 [LV] Never widen an induction variable. 
There's no need to widen canonical induction variables. It's just as efficient to create a *new*, wide, induction variable.

Consider, if we widen an indvar, then we'll have to truncate it before its uses anyway (1 trunc). If we create a new indvar instead, we'll have to truncate that instead (1 trunc) [besides which IndVars should go and clean up our mess after us anyway on principle].

This lets us remove a ton of special-casing code.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@246631 91177308-0d34-0410-b5e6-96231b3b80d8
 2015-09-02 10:15:05 +00:00