| commit | 11c6bab704a0f82f59dcb2f409f7d6ac3b1821f1 | [log] [tgz] |
|---|---|---|
| author | Chris Lattner <sabre@nondot.org> | Fri Nov 27 19:11:31 2009 +0000 |
| committer | Chris Lattner <sabre@nondot.org> | Fri Nov 27 19:11:31 2009 +0000 |
| tree | 274b2352759e9308594b6c57ff1ce1c014bab7ad | |
| parent | 9a5c22cc5e741bc3022366e85825ba99236027ed [diff] |
add support for recursive phi translation and phi
translation of add with immediate. This allows us
to optimize this function:
void test(int N, double* G) {
long j;
G[1] = 1;
for (j = 1; j < N - 1; j++)
G[j+1] = G[j] + G[j+1];
}
to only do one load every iteration of the loop.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@90013 91177308-0d34-0410-b5e6-96231b3b80d8