RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-21 03:53:04 +02:00
Code Issues Projects Releases Wiki Activity
150,763 Commits 4 Branches 5 Tags 704 MiB
0d933d6021
Commit Graph

4 Commits

Author SHA1 Message Date
Elena Demikhovsky
b25a8b4b1a Reverted patch 273864 
llvm-svn: 274115
 2016-06-29 10:01:06 +00:00
Elena Demikhovsky
a0f36bf897 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

llvm-svn: 273864
 2016-06-27 11:19:23 +00:00
Chad Rosier
e82e555425 Add newline to test. NFC. 
llvm-svn: 246653
 2015-09-02 14:06:16 +00:00
James Molloy
fe6bb5c6e4 [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.

llvm-svn: 246631
 2015-09-02 10:15:05 +00:00