Chris Lattner
|
67315dc888
|
new testcase
llvm-svn: 24099
|
2005-10-30 05:14:02 +00:00 |
|
Chris Lattner
|
e1832ccf63
|
this passes with the change in predicate
llvm-svn: 23699
|
2005-10-11 18:42:26 +00:00 |
|
Chris Lattner
|
eb1579d308
|
lsr doesn't emit gep instructions anymore
llvm-svn: 23696
|
2005-10-11 18:28:48 +00:00 |
|
Chris Lattner
|
2ee807c70f
|
relax pattern match on name
llvm-svn: 23317
|
2005-09-12 17:09:40 +00:00 |
|
Chris Lattner
|
7efb86dc11
|
new testcase
llvm-svn: 23316
|
2005-09-12 17:08:15 +00:00 |
|
Chris Lattner
|
2bb00dda5a
|
new testcase
llvm-svn: 23312
|
2005-09-12 05:50:15 +00:00 |
|
Chris Lattner
|
0c7728e4d6
|
new testcase
llvm-svn: 23305
|
2005-09-10 01:14:37 +00:00 |
|
Chris Lattner
|
9b2efaf9c8
|
new testcase distilled from mesa
llvm-svn: 22842
|
2005-08-17 21:21:47 +00:00 |
|
Chris Lattner
|
3cf8ef170a
|
testcase that crashes lsr, distilled from 175.vpr
llvm-svn: 22796
|
2005-08-16 00:36:12 +00:00 |
|
Chris Lattner
|
08c7fd19e1
|
new testcase we handle
llvm-svn: 22741
|
2005-08-10 00:48:11 +00:00 |
|
Chris Lattner
|
832105d511
|
new testcase
llvm-svn: 22738
|
2005-08-10 00:33:01 +00:00 |
|
Chris Lattner
|
23e3fb9e83
|
This is now implemented
llvm-svn: 22723
|
2005-08-09 00:19:44 +00:00 |
|
Chris Lattner
|
319292a666
|
A testcase I don't want to break in the future
llvm-svn: 22718
|
2005-08-08 22:13:49 +00:00 |
|
Chris Lattner
|
ac86efb6a3
|
new testcase, not implemented yet
llvm-svn: 22703
|
2005-08-08 06:23:47 +00:00 |
|
Chris Lattner
|
03b6275fb8
|
It is better to not depend on CSE to share multiplies due to IV insertion.
This testcase checks that only one mul is present in the output code, as it
should be.
llvm-svn: 22701
|
2005-08-08 05:46:51 +00:00 |
|
Chris Lattner
|
7eecc6cb24
|
These are both implemented by a recent LSR patch
llvm-svn: 22700
|
2005-08-08 05:29:51 +00:00 |
|
Chris Lattner
|
8a9f9f4735
|
two simple testcases loopreduce should handle but does not yet currently
llvm-svn: 22682
|
2005-08-05 19:47:39 +00:00 |
|
Chris Lattner
|
faf17b43da
|
This testcase now passes
llvm-svn: 22651
|
2005-08-04 19:08:07 +00:00 |
|
Chris Lattner
|
9969c8613a
|
this is not implemented by lsr yet
llvm-svn: 22642
|
2005-08-04 01:18:48 +00:00 |
|
Chris Lattner
|
47b5732252
|
this now passes
llvm-svn: 22636
|
2005-08-03 22:51:40 +00:00 |
|
Chris Lattner
|
8a3d007d75
|
temporarily fail these two tests until LSR evolves to support them
llvm-svn: 22567
|
2005-08-01 17:10:50 +00:00 |
|
Chris Lattner
|
5991cf77b2
|
cleanup the test
llvm-svn: 20504
|
2005-03-06 22:24:45 +00:00 |
|
Chris Lattner
|
1173c52d82
|
check that we only insert one phi node per loop
llvm-svn: 20503
|
2005-03-06 22:23:31 +00:00 |
|
Chris Lattner
|
392a0bba42
|
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
|
656a6e37e1
|
testcase for A[invariant][indvar] where invariant is an instruction.
llvm-svn: 20500
|
2005-03-06 22:06:09 +00:00 |
|
Chris Lattner
|
ab00dc30df
|
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
|
97b8cbff7c
|
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
|
9cd727c2ee
|
a regtest
llvm-svn: 20496
|
2005-03-06 21:47:40 +00:00 |
|
Chris Lattner
|
78f166c6ab
|
new directory
llvm-svn: 20495
|
2005-03-06 21:42:59 +00:00 |
|