| Age | Commit message (Expand) | Author |
|---|
| 2012-12-13 | Remove two popcount patterns which we are already able to recognize. | Shuxin Yang |
| 2012-10-08 | Move TargetData to DataLayout. | Micah Villmow |
| 2012-08-19 | Fabs folding is implemented. | Benjamin Kramer |
| 2012-07-23 | Test revert of test changes. | Micah Villmow |
| 2012-07-23 | Test commit. | Micah Villmow |
| 2012-06-23 | Add a microoptimization note. | Benjamin Kramer |
| 2012-04-12 | Remove README entry obsoleted by register masks. | Benjamin Kramer |
| 2012-03-28 | Add another note about a missed compare with nsw arithmetic instcombine. | Benjamin Kramer |
| 2012-03-27 | Add a note about a cute little fabs optimization. | Benjamin Kramer |
| 2012-03-27 | Add two missed instcombines related to compares with nsw arithmetic. | Benjamin Kramer |
| 2011-09-07 | Add two notes for correlated-expression optimizations. | Benjamin Kramer |
| 2011-07-14 | Don't emit a bit test if there is only one case the test can yield false. A s... | Benjamin Kramer |
| 2011-06-13 | InstCombine: Fold A-b == C --> b == A-C if A and C are constants. | Benjamin Kramer |
| 2011-05-23 | clarify this, apparently it is confusing :) | Chris Lattner |
| 2011-05-22 | add a note. | Chris Lattner |
| 2011-05-22 | move PR9408 here. | Chris Lattner |
| 2011-04-26 | Transform: "icmp eq (trunc (lshr(X, cst1)), cst" to "icmp (and X, mask), cst" | Chris Lattner |
| 2011-04-25 | add a missed bitfield instcombine. | Chris Lattner |
| 2011-04-22 | DAGCombine: fold "(zext x) == C" into "x == (trunc C)" if the trunc is lossless. | Benjamin Kramer |
| 2011-04-14 | add a minor missed dag combine that is blocking mid-level optimization | Chris Lattner |
| 2011-03-25 | Add a note. | Benjamin Kramer |
| 2011-03-22 | A bit more analysis of a memset-related README entry. | Eli Friedman |
| 2011-03-21 | This README entry was fixed recently. | Eli Friedman |
| 2011-03-01 | add a note | Chris Lattner |
| 2011-02-26 | Add some DAGCombines for (adde 0, 0, glue), which are useful to optimize lega... | Benjamin Kramer |
| 2011-02-21 | add a missed loop deletion case. | Chris Lattner |
| 2011-02-21 | add an idiom that loop idiom could theoretically catch. | Chris Lattner |
| 2011-02-17 | This has been implemented. | Duncan Sands |
| 2011-02-17 | add some notes on compares + binops. Remove redundant entries. | Chris Lattner |
| 2011-02-16 | Add a few missed xforms from GCC PR14753 | Chris Lattner |
| 2011-02-16 | Remove outdated README entry. | Eli Friedman |
| 2011-02-16 | Remove outdated README entry. | Eli Friedman |
| 2011-02-16 | Update README entry. | Eli Friedman |
| 2011-02-06 | Remove a virtual inheritance case that clang can devirtualize fully now. | Anders Carlsson |
| 2011-02-02 | SimplifyCFG: Turn switches into sub+icmp+branch if possible. | Benjamin Kramer |
| 2011-01-31 | add a note, progress unblocked by PR8575 being fixed. | Chris Lattner |
| 2011-01-30 | Teach DAGCombine to fold fold (sra (trunc (sr x, c1)), c2) -> (trunc (sra x, ... | Benjamin Kramer |
| 2011-01-24 | this isn't a memset, we do convert dest[i] to one though :) | Chris Lattner |
| 2011-01-24 | with recent work, we now optimize this into: | Chris Lattner |
| 2011-01-23 | Add a memset loop that LoopIdiomRecognize doesn't recognize. | Anders Carlsson |
| 2011-01-18 | add a note | Chris Lattner |
| 2011-01-16 | Update README.txt to remove the DAE enhancement. | Anders Carlsson |
| 2011-01-16 | add some commentary | Chris Lattner |
| 2011-01-16 | Simplify a README.txt entry significantly to expose the core issue. | Chandler Carruth |
| 2011-01-13 | typo | Chris Lattner |
| 2011-01-13 | memcpy + metadata = bliss :) | Chris Lattner |
| 2011-01-11 | Teach constant folding to perform conversions from constant floating | Chandler Carruth |
| 2011-01-11 | Fix a random missed optimization by making InstCombine more aggressive when d... | Owen Anderson |
| 2011-01-10 | +0.0 vs -0.0 differences can be handled by looking at the user of the | Chris Lattner |
| 2011-01-10 | expand on a note | Chris Lattner |
