Chris Lattner
|
9471eb53aa
|
cleanup the test
llvm-svn: 20504
|
2005-03-06 22:24:45 +00:00 |
|
Chris Lattner
|
ad1fa9275b
|
check that we only insert one phi node per loop
llvm-svn: 20503
|
2005-03-06 22:23:31 +00:00 |
|
Chris Lattner
|
0f34140f90
|
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.
llvm-svn: 20502
|
2005-03-06 22:15:24 +00:00 |
|
Chris Lattner
|
983422f2c8
|
testcase for A[invariant][indvar] where invariant is an instruction.
llvm-svn: 20500
|
2005-03-06 22:06:09 +00:00 |
|
Chris Lattner
|
482fc889e1
|
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]
llvm-svn: 20499
|
2005-03-06 22:04:27 +00:00 |
|
Chris Lattner
|
85a611063e
|
Add test for this:
Allow operands after the induction variable (no restrictions):
int x;
for (i)
j = .....
a[i][x][j]
llvm-svn: 20498
|
2005-03-06 22:01:42 +00:00 |
|
Chris Lattner
|
84be025747
|
a regtest
llvm-svn: 20496
|
2005-03-06 21:47:40 +00:00 |
|
Chris Lattner
|
de7a8d1e1c
|
new directory
llvm-svn: 20495
|
2005-03-06 21:42:59 +00:00 |
|