summaryrefslogtreecommitdiff
path: root/lib/Target/README.txt
AgeCommit message (Expand)AuthorFilesLines
2015-03-26InstCombine: fold (A << C) == (B << C) --> ((A^B) & (~0U >> C)) == 0Benjamin Kramer1-38/+0
2015-03-21[SimplifyLibCalls] Turn memchr(const, C, const) into a bitfield check.Benjamin Kramer1-1/+2
2014-10-16Delete -std-compile-opts.Rafael Espindola1-22/+22
2014-08-21Reassociate x + -0.1234 * y into x - 0.1234 * yErik Verbruggen1-38/+0
2014-08-15Remove testcase from README which we didn't get. We do get it now.Erik Verbruggen1-1/+1
2014-03-28Revert "InstCombine: merge constants in both operands of icmp."Erik Verbruggen1-0/+12
2014-03-27InstCombine: merge constants in both operands of icmp.Erik Verbruggen1-12/+0
2012-12-13Remove two popcount patterns which we are already able to recognize.Shuxin Yang1-15/+0
2012-10-08Move TargetData to DataLayout.Micah Villmow1-1/+1
2012-08-19Fabs folding is implemented.Benjamin Kramer1-5/+0
2012-07-23Test revert of test changes.Micah Villmow1-1/+0
2012-07-23Test commit.Micah Villmow1-0/+1
2012-06-23Add a microoptimization note.Benjamin Kramer1-0/+6
2012-04-12Remove README entry obsoleted by register masks.Benjamin Kramer1-16/+0
2012-03-28Add another note about a missed compare with nsw arithmetic instcombine.Benjamin Kramer1-0/+7
2012-03-27Add a note about a cute little fabs optimization.Benjamin Kramer1-0/+5
2012-03-27Add two missed instcombines related to compares with nsw arithmetic.Benjamin Kramer1-0/+12
2011-09-07Add two notes for correlated-expression optimizations.Benjamin Kramer1-0/+10
2011-07-14Don't emit a bit test if there is only one case the test can yield false. A s...Benjamin Kramer1-9/+4
2011-06-13InstCombine: Fold A-b == C --> b == A-C if A and C are constants.Benjamin Kramer1-5/+0
2011-05-23clarify this, apparently it is confusing :)Chris Lattner1-1/+3
2011-05-22add a note.Chris Lattner1-0/+10
2011-05-22move PR9408 here.Chris Lattner1-0/+40
2011-04-26Transform: "icmp eq (trunc (lshr(X, cst1)), cst" to "icmp (and X, mask), cst"Chris Lattner1-46/+0
2011-04-25add a missed bitfield instcombine.Chris Lattner1-0/+47
2011-04-22DAGCombine: fold "(zext x) == C" into "x == (trunc C)" if the trunc is lossless.Benjamin Kramer1-30/+1
2011-04-14add a minor missed dag combine that is blocking mid-level optimizationChris Lattner1-0/+76
2011-03-25Add a note.Benjamin Kramer1-0/+19
2011-03-22A bit more analysis of a memset-related README entry.Eli Friedman1-4/+5
2011-03-21This README entry was fixed recently.Eli Friedman1-28/+0
2011-03-01add a noteChris Lattner1-0/+15
2011-02-26Add some DAGCombines for (adde 0, 0, glue), which are useful to optimize lega...Benjamin Kramer1-37/+0
2011-02-21add a missed loop deletion case.Chris Lattner1-0/+14
2011-02-21add an idiom that loop idiom could theoretically catch.Chris Lattner1-0/+10
2011-02-17This has been implemented.Duncan Sands1-10/+0
2011-02-17add some notes on compares + binops. Remove redundant entries.Chris Lattner1-20/+47
2011-02-16Add a few missed xforms from GCC PR14753Chris Lattner1-0/+29
2011-02-16Remove outdated README entry.Eli Friedman1-12/+0
2011-02-16Remove outdated README entry.Eli Friedman1-16/+0
2011-02-16Update README entry.Eli Friedman1-13/+6
2011-02-06Remove a virtual inheritance case that clang can devirtualize fully now.Anders Carlsson1-21/+0
2011-02-02SimplifyCFG: Turn switches into sub+icmp+branch if possible.Benjamin Kramer1-48/+0
2011-01-31add a note, progress unblocked by PR8575 being fixed.Chris Lattner1-0/+48
2011-01-30Teach DAGCombine to fold fold (sra (trunc (sr x, c1)), c2) -> (trunc (sra x, ...Benjamin Kramer1-21/+0
2011-01-24this isn't a memset, we do convert dest[i] to one though :)Chris Lattner1-8/+0
2011-01-24with recent work, we now optimize this into:Chris Lattner1-20/+0
2011-01-23Add a memset loop that LoopIdiomRecognize doesn't recognize.Anders Carlsson1-0/+8
2011-01-18add a noteChris Lattner1-0/+20
2011-01-16Update README.txt to remove the DAE enhancement.Anders Carlsson1-23/+0
2011-01-16add some commentaryChris Lattner1-1/+14