aboutsummaryrefslogtreecommitdiff
path: root/test/Transforms/LoopStrengthReduce
AgeCommit message (Collapse)Author
2005-08-10new testcase we handleChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22741 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-10new testcaseChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22738 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-09This is now implementedChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22723 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08A testcase I don't want to break in the futureChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22718 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08new testcase, not implemented yetChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22703 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-08It is better to not depend on CSE to share multiplies due to IV insertion.Chris Lattner
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-08These are both implemented by a recent LSR patchChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22700 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-05two simple testcases loopreduce should handle but does not yet currentlyChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22682 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-04This testcase now passesChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22651 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-04this is not implemented by lsr yetChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22642 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-03this now passesChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22636 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-01temporarily fail these two tests until LSR evolves to support themChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22567 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06cleanup the testChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20504 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06check that we only insert one phi node per loopChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20503 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06Add testcase for this:Chris Lattner
(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-06testcase for A[invariant][indvar] where invariant is an instruction.Chris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20500 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06add test for this:Chris Lattner
(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-06Add test for this:Chris Lattner
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-06a regtestChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20496 91177308-0d34-0410-b5e6-96231b3b80d8
2005-03-06new directoryChris Lattner
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20495 91177308-0d34-0410-b5e6-96231b3b80d8
generated by cgit v1.2.3-70-g09d2 (git 2.46.0) at 2025-09-20 15:26:17 +0000