| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Reverted patch 273864 | Elena Demikhovsky | 2016-06-29 | 1 | -1/+0 |
| | | | | | llvm-svn: 274115 | ||||
| * | Fixed consecutive memory access detection in Loop Vectorizer. | Elena Demikhovsky | 2016-06-27 | 1 | -0/+1 |
| | | | | | | | | | | | | | | | | | 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 | ||||
| * | Add newline to test. NFC. | Chad Rosier | 2015-09-02 | 1 | -1/+1 |
| | | | | | llvm-svn: 246653 | ||||
| * | [LV] Never widen an induction variable. | James Molloy | 2015-09-02 | 1 | -0/+34 |
| 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 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|