aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Target/README.txt
Commit message (Expand)AuthorAgeFilesLines
* Remove two popcount patterns which we are already able to recognize.Shuxin Yang2012-12-131-15/+0
* Move TargetData to DataLayout.Micah Villmow2012-10-081-1/+1
* Fabs folding is implemented.Benjamin Kramer2012-08-191-5/+0
* Test revert of test changes.Micah Villmow2012-07-231-1/+0
* Test commit.Micah Villmow2012-07-231-0/+1
* Add a microoptimization note.Benjamin Kramer2012-06-231-0/+6
* Remove README entry obsoleted by register masks.Benjamin Kramer2012-04-121-16/+0
* Add another note about a missed compare with nsw arithmetic instcombine.Benjamin Kramer2012-03-281-0/+7
* Add a note about a cute little fabs optimization.Benjamin Kramer2012-03-271-0/+5
* Add two missed instcombines related to compares with nsw arithmetic.Benjamin Kramer2012-03-271-0/+12
* Add two notes for correlated-expression optimizations.Benjamin Kramer2011-09-071-0/+10
* Don't emit a bit test if there is only one case the test can yield false. A s...Benjamin Kramer2011-07-141-9/+4
* InstCombine: Fold A-b == C --> b == A-C if A and C are constants.Benjamin Kramer2011-06-131-5/+0
* clarify this, apparently it is confusing :)Chris Lattner2011-05-231-1/+3
* add a note.Chris Lattner2011-05-221-0/+10
* move PR9408 here.Chris Lattner2011-05-221-0/+40
* Transform: "icmp eq (trunc (lshr(X, cst1)), cst" to "icmp (and X, mask), cst"Chris Lattner2011-04-261-46/+0
* add a missed bitfield instcombine.Chris Lattner2011-04-251-0/+47
* DAGCombine: fold "(zext x) == C" into "x == (trunc C)" if the trunc is lossless.Benjamin Kramer2011-04-221-30/+1
* add a minor missed dag combine that is blocking mid-level optimizationChris Lattner2011-04-141-0/+76
* Add a note.Benjamin Kramer2011-03-251-0/+19
* A bit more analysis of a memset-related README entry.Eli Friedman2011-03-221-4/+5
* This README entry was fixed recently.Eli Friedman2011-03-211-28/+0
* add a noteChris Lattner2011-03-011-0/+15
* Add some DAGCombines for (adde 0, 0, glue), which are useful to optimize lega...Benjamin Kramer2011-02-261-37/+0
* add a missed loop deletion case.Chris Lattner2011-02-211-0/+14
* add an idiom that loop idiom could theoretically catch.Chris Lattner2011-02-211-0/+10
* This has been implemented.Duncan Sands2011-02-171-10/+0
* add some notes on compares + binops. Remove redundant entries.Chris Lattner2011-02-171-20/+47
* Add a few missed xforms from GCC PR14753Chris Lattner2011-02-161-0/+29
* Remove outdated README entry.Eli Friedman2011-02-161-12/+0
* Remove outdated README entry.Eli Friedman2011-02-161-16/+0
* Update README entry.Eli Friedman2011-02-161-13/+6
* Remove a virtual inheritance case that clang can devirtualize fully now.Anders Carlsson2011-02-061-21/+0
* SimplifyCFG: Turn switches into sub+icmp+branch if possible.Benjamin Kramer2011-02-021-48/+0
* add a note, progress unblocked by PR8575 being fixed.Chris Lattner2011-01-311-0/+48
* Teach DAGCombine to fold fold (sra (trunc (sr x, c1)), c2) -> (trunc (sra x, ...Benjamin Kramer2011-01-301-21/+0
* this isn't a memset, we do convert dest[i] to one though :)Chris Lattner2011-01-241-8/+0
* with recent work, we now optimize this into:Chris Lattner2011-01-241-20/+0
* Add a memset loop that LoopIdiomRecognize doesn't recognize.Anders Carlsson2011-01-231-0/+8
* add a noteChris Lattner2011-01-181-0/+20
* Update README.txt to remove the DAE enhancement.Anders Carlsson2011-01-161-23/+0
* add some commentaryChris Lattner2011-01-161-1/+14
* Simplify a README.txt entry significantly to expose the core issue.Chandler Carruth2011-01-161-28/+26
* typoChris Lattner2011-01-131-1/+1
* memcpy + metadata = bliss :)Chris Lattner2011-01-131-0/+48
* Teach constant folding to perform conversions from constant floatingChandler Carruth2011-01-111-55/+0
* Fix a random missed optimization by making InstCombine more aggressive when d...Owen Anderson2011-01-111-15/+0
* +0.0 vs -0.0 differences can be handled by looking at the user of theChris Lattner2011-01-101-3/+19
* expand on a noteChris Lattner2011-01-101-4/+9