Chris Lattner
2d9005d61f
cleanup the test
...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20504 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:24:45 +00:00
Chris Lattner
57f74708d7
check that we only insert one phi node per loop
...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20503 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:23:31 +00:00
Chris Lattner
7abfec8734
Add testcase for this:
...
(3) Do not reduce element sizes of small power of two:
char s[10];
for (i)
...s[i] ...
when the indvar is not eliminable.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20502 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:15:24 +00:00
Chris Lattner
a0bfe0f9d3
testcase for A[invariant][indvar] where invariant is an instruction.
...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20500 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:06:09 +00:00
Chris Lattner
7fe11f8711
add test for this:
...
(1) Allow loop invariant expressions to come before the induction variable (instead of just
constants):
int x;
for (i)
...a[x][i]
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20499 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:04:27 +00:00
Chris Lattner
3a334cb868
Add test for this:
...
Allow operands after the induction variable (no restrictions):
int x;
for (i)
j = .....
a[i][x][j]
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20498 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 22:01:42 +00:00
Chris Lattner
bc99f12dd2
a regtest
...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20496 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 21:47:40 +00:00
Chris Lattner
c1ca766e01
new directory
...
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20495 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06 21:42:59 +00:00
