Commit Graph

68 Commits

Author SHA1 Message Date
Chris Lattner
bf9af65a93 This is now implemented
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22723 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-09 00:19:44 +00:00
Chris Lattner
0bc6bde317 A testcase I don't want to break in the future
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22718 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08 22:13:49 +00:00
Chris Lattner
ca60967eea new testcase, not implemented yet
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22703 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08 06:23:47 +00:00
Chris Lattner
8e2dbb6646 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.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22701 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08 05:46:51 +00:00
Chris Lattner
8cb014fd01 These are both implemented by a recent LSR patch
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22700 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08 05:29:51 +00:00
Chris Lattner
0ef10c935a two simple testcases loopreduce should handle but does not yet currently
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22682 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-05 19:47:39 +00:00
Chris Lattner
341bef6ed5 This testcase now passes
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22651 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-04 19:08:07 +00:00
Chris Lattner
89fe67f19f this is not implemented by lsr yet
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22642 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-04 01:18:48 +00:00
Chris Lattner
6bc89e2159 this now passes
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22636 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-03 22:51:40 +00:00
Chris Lattner
88aad145a5 temporarily fail these two tests until LSR evolves to support them
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22567 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-01 17:10:50 +00:00
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