| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Remove support for parsing the "type i32" syntax for defining a numbered | Chris Lattner | 2011-06-19 | 2 | -28/+28 |
| * | rip out a ton of intrinsic modernization logic from AutoUpgrade.cpp, which is | Chris Lattner | 2011-06-18 | 2 | -50/+49 |
| * | Remove support for using "foo" as symbols instead of %"foo". This is ancient | Chris Lattner | 2011-06-17 | 3 | -3/+1 |
| * | Test case and comment for PR9633. | Andrew Trick | 2011-04-27 | 1 | -0/+33 |
| * | Propagate SCEV no-wrap flags whenever possible. | Andrew Trick | 2011-03-15 | 3 | -14/+21 |
| * | When SCEV can determine the loop test is X < X, set ExactBECount=0. | Andrew Trick | 2011-03-09 | 1 | -0/+34 |
| * | teach SCEV that the scale and addition of an inbounds gep don't NSW. | Chris Lattner | 2011-02-13 | 2 | -4/+31 |
| * | Per discussion with Dan G, inbounds geps *certainly* can have | Chris Lattner | 2011-02-11 | 1 | -2/+2 |
| * | Simplify some code with no functionality change. Make the test a lot more | Nick Lewycky | 2011-01-23 | 1 | -15/+19 |
| * | Use value ranges to fold ext(trunc) in SCEV when possible. | Nick Lewycky | 2011-01-23 | 1 | -0/+34 |
| * | Implement requiredTransitive | Tobias Grosser | 2011-01-20 | 1 | -0/+24 |
| * | Similarly, analyze truncate through multiply. | Nick Lewycky | 2011-01-19 | 1 | -0/+8 |
| * | Add a missed SCEV fold that is required to continue analyzing the IR produced | Nick Lewycky | 2011-01-19 | 1 | -1/+9 |
| * | Add a missing SCEV simplification sext(zext x) --> zext x. | Nick Lewycky | 2011-01-19 | 1 | -0/+8 |
| * | Revert the testcase from the previous reverted commit. | Eric Christopher | 2011-01-11 | 1 | -2/+0 |
| * | add a testcase I missed in previous commit. | Chris Lattner | 2011-01-09 | 1 | -0/+2 |
| * | teach SCEV analysis of PHI nodes that PHI recurences formed | Chris Lattner | 2011-01-09 | 1 | -2/+40 |
| * | reduce indentation. Print <nuw> and <nsw> when dumping SCEV AddRec's | Chris Lattner | 2011-01-09 | 1 | -1/+1 |
| * | remove some noise from tests. | Chris Lattner | 2010-09-02 | 1 | -1/+1 |
| * | When analyzing loop exit conditions combined with and and or, don't | Dan Gohman | 2010-08-11 | 1 | -2/+40 |
| * | Revert the part of r107257 which introduced new logic for using | Dan Gohman | 2010-06-30 | 1 | -3/+4 |
| * | Add a testcase for scev-aa's new capability. | Dan Gohman | 2010-06-30 | 1 | -3/+24 |
| * | Allow "exhaustive" trip count evaluation on phi nodes with all | Dan Gohman | 2010-06-22 | 1 | -0/+19 |
| * | Fix ScalarEvolution's "exhaustive" trip count evaluation code to avoid | Dan Gohman | 2010-06-19 | 1 | -0/+31 |
| * | Revert r106304 (105548 and friends), which are the SCEVComplexityCompare | Dan Gohman | 2010-06-18 | 1 | -1/+1 |
| * | Reapply 105540, 105542, and 105548, and revert r105732. | Dan Gohman | 2010-06-18 | 1 | -1/+1 |
| * | Workaround SCEV non-determinism on this test, for now, to get buildbots back to | Daniel Dunbar | 2010-06-09 | 1 | -1/+1 |
| * | Optimize ScalarEvolution's SCEVComplexityCompare predicate: don't go | Dan Gohman | 2010-06-07 | 1 | -1/+1 |
| * | Add a comment to this test. | Dan Gohman | 2010-04-26 | 1 | -0/+3 |
| * | ScalarEvolution support for <= and >= loops. | Dan Gohman | 2010-04-24 | 4 | -4/+31 |
| * | Don't attempt to analyze values which are obviously undef. This fixes some | Dan Gohman | 2010-04-22 | 1 | -0/+39 |
| * | 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 |
