| commit | 319d594e22c3db55114f233ca398f9760e3f6ed9 | [log] [tgz] |
|---|---|---|
| author | Nadav Rotem <nrotem@apple.com> | Tue Dec 04 06:15:11 2012 +0000 |
| committer | Nadav Rotem <nrotem@apple.com> | Tue Dec 04 06:15:11 2012 +0000 |
| tree | f388bd59d3d495e88504891426aa7bb62f23c1b6 | |
| parent | 6c55412ea4b39103a3a5764d49ddfdf50e066d56 [diff] |
Add the last part that is needed for vectorization of if-converted code.
Added the code that actually performs the if-conversion during vectorization.
We can now vectorize this code:
for (int i=0; i<n; ++i) {
unsigned k = 0;
if (a[i] > b[i]) <------ IF inside the loop.
k = k * 5 + 3;
a[i] = k; <---- K is a phi node that becomes vector-select.
}
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169217 91177308-0d34-0410-b5e6-96231b3b80d8