| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | Turn X-(X-Y) into Y. According to my auto-simplifier this is the most common | Duncan Sands | 2011-01-14 | 1 | -1/+15 |
| * | Factorize common code out of the InstructionSimplify shift logic. Add in | Duncan Sands | 2011-01-14 | 1 | -62/+38 |
| * | Move some shift transforms out of instcombine and into InstructionSimplify. | Duncan Sands | 2011-01-14 | 1 | -0/+142 |
| * | Remove some wrong code which fortunately was never executed (as explained in | Duncan Sands | 2011-01-13 | 1 | -6/+9 |
| * | The most common simplification missed by instsimplify in unoptimized bitcode | Duncan Sands | 2011-01-13 | 1 | -19/+70 |
| * | Revert commit 122654 at the request of Chris, who reckons that instsimplify | Duncan Sands | 2011-01-01 | 1 | -124/+52 |
| * | Fix a README item by having InstructionSimplify do a mild form of value | Duncan Sands | 2011-01-01 | 1 | -52/+124 |
| * | Cast away "comparison between signed and unsigned integer" warnings. | Benjamin Kramer | 2010-12-28 | 1 | -3/+6 |
| * | When determining whether the new instruction was already present in | Duncan Sands | 2010-12-22 | 1 | -6/+8 |
| * | Add some statistics, good for understanding how much more powerful | Duncan Sands | 2010-12-22 | 1 | -14/+48 |
| * | While I don't think any later transforms can fire, it seems cleaner to | Duncan Sands | 2010-12-21 | 1 | -3/+6 |
| * | Fix inverted condition noticed by Frits van Bommel. | Duncan Sands | 2010-12-21 | 1 | -3/+3 |
| * | Pull a few more simplifications out of instcombine (there are still | Duncan Sands | 2010-12-21 | 1 | -5/+86 |
| * | Teach InstructionSimplify about distributive laws. These transforms fire | Duncan Sands | 2010-12-21 | 1 | -11/+159 |
| * | Move checking of the recursion limit into the various Thread methods. | Duncan Sands | 2010-12-21 | 1 | -20/+36 |
| * | Add generic simplification of associative operations, generalizing | Duncan Sands | 2010-12-21 | 1 | -28/+118 |
| * | Have SimplifyBinOp dispatch Xor, Add and Sub to the corresponding methods | Duncan Sands | 2010-12-20 | 1 | -5/+27 |
| * | Move Sub simplifications and additional Add simplifications out of | Duncan Sands | 2010-12-15 | 1 | -10/+67 |
| * | If we detect that the instruction we are simplifying is unreachable, arrange for | Duncan Sands | 2010-12-15 | 1 | -3/+3 |
| * | Add some dead stores to pacify my least favorite GCC warning: may be | Chandler Carruth | 2010-11-29 | 1 | -3/+3 |
| * | Expand a little on the description of what InstructionSimplify does. | Duncan Sands | 2010-11-23 | 1 | -2/+4 |
| * | If a GEP index simply advances by multiples of a type of zero size, | Duncan Sands | 2010-11-22 | 1 | -1/+1 |
| * | Move the "gep undef" -> "undef" transform from instcombine to | Duncan Sands | 2010-11-22 | 1 | -4/+11 |
| * | Add a rather pointless InstructionSimplify transform, inspired by recent cons... | Duncan Sands | 2010-11-21 | 1 | -2/+10 |
| * | Remove threading of Xor over selects and phis, with an explanation | Duncan Sands | 2010-11-19 | 1 | -13/+18 |
| * | Move some those Xor simplifications which don't require creating new | Duncan Sands | 2010-11-17 | 1 | -30/+78 |
| * | Previously SimplifyInstruction could report that an instruction | Duncan Sands | 2010-11-17 | 1 | -15/+31 |
| * | Fix a layering violation: hasConstantValue, which is part of the PHINode | Duncan Sands | 2010-11-17 | 1 | -3/+37 |
| * | In which I discover the existence of loops. Threading an operation | Duncan Sands | 2010-11-16 | 1 | -60/+102 |
| * | Teach InstructionSimplify the trick of skipping incoming phi | Duncan Sands | 2010-11-15 | 1 | -4/+9 |
| * | If dom tree information is available, make it possible to pass | Duncan Sands | 2010-11-14 | 1 | -5/+7 |
| * | Teach InstructionSimplify about phi nodes. I chose to have it simply | Duncan Sands | 2010-11-14 | 1 | -0/+2 |
| * | Strip trailing whitespace. | Duncan Sands | 2010-11-14 | 1 | -50/+49 |
| * | Reduce the maximum recursion depth, 5 seems pointlessly too much. | Duncan Sands | 2010-11-10 | 1 | -1/+1 |
| * | Teach InstructionSimplify how to look through PHI nodes. Since PHI | Duncan Sands | 2010-11-10 | 1 | -32/+163 |
| * | Simplify binary operations where one operand is a select instruction. | Duncan Sands | 2010-11-10 | 1 | -28/+113 |
| * | Factorize code, no functionality change. | Duncan Sands | 2010-11-09 | 1 | -34/+31 |
| * | Add simplification of floating point comparisons with the result | Duncan Sands | 2010-11-07 | 1 | -0/+20 |
| * | Fix a README item: when doing a comparison with the result | Duncan Sands | 2010-11-07 | 1 | -2/+21 |
| * | Revert r114097, adding back in the assertion against replacing an Instruction... | Owen Anderson | 2010-09-16 | 1 | -24/+11 |
| * | Fix PR8161, in which an unreachable loop causes recursive instruction simplif... | Owen Anderson | 2010-09-16 | 1 | -11/+24 |
| * | Teach InstructionSimplify to fold (A & B) & A -> A & B and (A | B) | A -> A | B. | Benjamin Kramer | 2010-09-10 | 1 | -0/+20 |
| * | Fix PR7647, handling the case when 'To' ends up being | Chris Lattner | 2010-07-15 | 1 | -14/+34 |
| * | Revert r108401; it breaks bootstrap :( | Eli Friedman | 2010-07-15 | 1 | -3/+1 |
| * | Add AssertingVH which makes PR7647 break consistently. | Eli Friedman | 2010-07-15 | 1 | -1/+3 |
| * | move some select simplifications out out instcombine into | Chris Lattner | 2010-04-20 | 1 | -0/+32 |
| * | fix incorrect folding of icmp with undef, PR6481. | Chris Lattner | 2010-03-03 | 1 | -4/+3 |
| * | Constant-fold certain comparisons with infinity and negative infinity. | Dan Gohman | 2010-02-22 | 1 | -0/+26 |
| * | factor some logic out of instcombine into a new SimplifyAddInst method. | Chris Lattner | 2009-11-27 | 1 | -6/+35 |
| * | factor some instcombine simplifications for getelementptr out to a new | Chris Lattner | 2009-11-27 | 1 | -0/+32 |
