| Commit message (Expand) | Author | Age | Files | Lines |
* | Use opt -S instead of piping bitcode output through llvm-dis. | Dan Gohman | 2009-09-08 | 3 | -3/+3 |
* | Change these tests to feed the assembly files to opt directly, instead | Dan Gohman | 2009-09-08 | 60 | -61/+61 |
* | Create a ScalarEvolution-based AliasAnalysis implementation. | Dan Gohman | 2009-08-26 | 1 | -0/+194 |
* | Loosen up the regex for this test so that it doesn't implicitly | Dan Gohman | 2009-08-19 | 1 | -1/+3 |
* | Make LLVM Assembly dramatically easier to read by aligning the comments, | Dan Gohman | 2009-08-12 | 1 | -1/+1 |
* | Change the assembly syntax for nsw, nuw, and exact, putting them | Dan Gohman | 2009-07-27 | 1 | -1/+1 |
* | When attempting to sign-extend an addrec by interpreting | Dan Gohman | 2009-07-25 | 1 | -0/+74 |
* | Teach ScalarEvolution to make use of no-overflow flags when | Dan Gohman | 2009-07-25 | 1 | -0/+40 |
* | Replace the original ad-hoc code for determining whether (v pred w) implies | Dan Gohman | 2009-07-21 | 1 | -0/+37 |
* | Add a testcase for PR4569, which is now fixed. | Dan Gohman | 2009-07-21 | 1 | -0/+24 |
* | Add testcases for PR4538, PR4537, and PR4534. | Dan Gohman | 2009-07-13 | 2 | -0/+384 |
* | When comparing constants, consider a less wide constant to be "less complex" | Nick Lewycky | 2009-07-04 | 1 | -0/+16 |
* | Add a testcase demoing some of ScalarEvolution's new trip count logic. | Dan Gohman | 2009-06-24 | 1 | -0/+37 |
* | Fix a bug in the trip-count computation with And/Or. If either of the | Dan Gohman | 2009-06-22 | 1 | -0/+150 |
* | Fix llvm::ComputeNumSignBits to handle pointer types | Dan Gohman | 2009-06-22 | 1 | -0/+220 |
* | Teach ScalarEvolution how to analyze loops with multiple exit | Dan Gohman | 2009-06-22 | 1 | -0/+48 |
* | Fix ScalarEvolution's backedge-taken count computations to check for | Dan Gohman | 2009-06-21 | 2 | -2/+11 |
* | Teach ScalarEvolution how to recognize another xor(and(x, C), C) case. | Dan Gohman | 2009-06-18 | 1 | -2/+3 |
* | Add -disable-output to a bunch of tests that don't care about the output. | Dan Gohman | 2009-06-17 | 30 | -31/+31 |
* | Fix ScalarEvolution's Xor handling to not assume that an And | Dan Gohman | 2009-06-17 | 1 | -0/+11 |
* | Split the Add, Sub, and Mul instruction opcodes into separate | Dan Gohman | 2009-06-04 | 3 | -6/+6 |
* | Teach ScalarEvolution to recognize x^-1 in the case where non-demanded | Dan Gohman | 2009-05-18 | 1 | -0/+8 |
* | Make ScalarEvolution::isLoopGuardedByCond work even when the edge | Dan Gohman | 2009-05-18 | 1 | -1/+1 |
* | Add nounwind to a few tests. | Dan Gohman | 2009-05-18 | 1 | -1/+1 |
* | Allow scalar evolution to compute iteration counts for loops with a | Eli Friedman | 2009-05-09 | 1 | -0/+27 |
* | Fix bogus overflow checks by replacing them with actual | Dan Gohman | 2009-05-08 | 1 | -0/+10 |
* | Fold trunc casts into add-recurrence expressions, allowing the | Dan Gohman | 2009-05-08 | 1 | -0/+24 |
* | When printing a SCEVUnknown with pointer type, don't print an | Dan Gohman | 2009-05-01 | 1 | -1/+1 |
* | Extend ScalarEvolution's getBackedgeTakenCount to be able to | Dan Gohman | 2009-04-30 | 3 | -1/+106 |
* | Generalize the cast-of-addrec folding to handle folding of SCEVs like | Dan Gohman | 2009-04-29 | 2 | -0/+131 |
* | Fix this test to match the new output from scalar-evolution. | Dan Gohman | 2009-04-29 | 1 | -1/+1 |
* | Include the source type in SCEV cast expression debug output, and | Dan Gohman | 2009-04-29 | 1 | -2/+3 |
* | Fix a grammaro in a comment. | Dan Gohman | 2009-04-28 | 1 | -1/+1 |
* | Simplify trunc(extend(x)) in SCEVs, just for completeness. Also fix some odd | Nick Lewycky | 2009-04-23 | 1 | -0/+37 |
* | Testcase for PR3909. | Owen Anderson | 2009-04-23 | 1 | -0/+30 |
* | When turning (ashr(shl(x, n), n)) into sext(trunc(x)), the width of the | Dan Gohman | 2009-04-21 | 1 | -0/+29 |
* | Rename ScalarEvolution's getIterationCount to getBackedgeTakenCount, | Dan Gohman | 2009-02-24 | 15 | -15/+15 |
* | Wind SCEV back in time, to Nov 18th. This 'fixes' PR3275, PR3294, PR3295, | Nick Lewycky | 2009-01-13 | 7 | -0/+7 |
* | Don't try to analyze this "backward" case. This is overly conservative | Nick Lewycky | 2009-01-02 | 1 | -0/+40 |
* | Generalize support for analyzing loops to include SLE/SGE loop exit conditions | Nick Lewycky | 2008-12-16 | 4 | -2/+41 |
* | Revert my re-instated reverted commit, fixes the bootstrap build on x86-64 li... | Nick Lewycky | 2008-12-12 | 2 | -0/+2 |
* | Sneaky, sneaky: move the -1 to the outside of the SMax. Reinstate the | Nick Lewycky | 2008-12-11 | 2 | -1/+27 |
* | xfail this for now. | Evan Cheng | 2008-12-09 | 1 | -0/+1 |
* | It's easy to handle SLE/SGE when the loop has a unit stride. | Nick Lewycky | 2008-12-09 | 1 | -0/+24 |
* | Add a utility function that detects whether a loop is guaranteed to be finite. | Nick Lewycky | 2008-11-18 | 3 | -0/+91 |
* | Don't brute-force analyze cubic or higher polynomials. | Nick Lewycky | 2008-11-16 | 1 | -0/+19 |
* | Don't crash analyzing certain quadratics (addrec of {X,+,Y,+,1}). | Nick Lewycky | 2008-11-03 | 1 | -0/+21 |
* | Finally re-apply r46959. This is made feasible by the combination | Dan Gohman | 2008-09-16 | 2 | -3/+4 |
* | Fix spacing in the grep line for this test, following the recent | Dan Gohman | 2008-09-16 | 1 | -1/+1 |
* | Teach ScalarEvolution to consider loop preheaders in the search for | Dan Gohman | 2008-09-15 | 2 | -0/+234 |