| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Generalize ScalarEvolution's PHI analysis to handle loops that don't | Dan Gohman | 2010-04-12 | 1 | -0/+29 |
| * | Avoid analyzing instructions in blocks not reachable from the entry block. | Dan Gohman | 2010-03-09 | 1 | -0/+13 |
| * | Teach ScalarEvolution how to compute a tripcount for a loop with | Dan Gohman | 2010-02-19 | 1 | -0/+76 |
| * | -disable-output is no longer needed with -analyze. | Dan Gohman | 2010-01-26 | 53 | -54/+54 |
| * | Fix the the ceiling-division used in computing the MaxBECount so that it doesn't | Dan Gohman | 2010-01-26 | 2 | -2/+411 |
| * | Use WriteAsOperand instead of getName() to print loop header names, | Dan Gohman | 2010-01-09 | 18 | -27/+27 |
| * | Add a comment about A[i+(j+1)]. | Dan Gohman | 2009-12-01 | 1 | -1/+1 |
| * | update status of this. basicaa is much improved now, | Chris Lattner | 2009-11-26 | 1 | -2/+2 |
| * | Make opt default to not adding a target data string and update tests that dep... | Kenneth Uildriks | 2009-11-03 | 1 | -0/+1 |
| * | Convert Analysis tests to FileCheck in regards to PR5307. | Edward O'Callaghan | 2009-10-27 | 5 | -7/+17 |
| * | Teach ScalarEvolution how to reason about no-wrap flags on loops | Dan Gohman | 2009-09-17 | 1 | -0/+76 |
| * | Change tests from "opt %s" to "opt < %s" so that opt doesn't see the | Dan Gohman | 2009-09-11 | 60 | -61/+61 |
| * | 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 |
