| Commit message (Expand) | Author | Age |
|---|
| ... | |
| * | Teach instsimplify to simplify calls to undef. | Dan Gohman | 2011-11-04 |
| * | Reapply commit 143214 with a fix: m_ICmp doesn't match conditions | Duncan Sands | 2011-10-30 |
| * | Revert r143214; it's breaking a bunch of stuff. | Eli Friedman | 2011-10-29 |
| * | The expression icmp eq (select (icmp eq x, 0), 1, x), 0 folds to false. | Duncan Sands | 2011-10-28 |
| * | A shift of a power of two is a power of two or zero. | Duncan Sands | 2011-10-28 |
| * | Fold icmp ugt (udiv X, Y), X to false. Spotted by my super-optimizer | Duncan Sands | 2011-10-28 |
| * | Reapply commit 143028 with a fix: the problem was casting a ConstantExpr Mul | Duncan Sands | 2011-10-27 |
| * | Revert Duncan's r143028 expression folding which appears to be the culprit | Bob Wilson | 2011-10-27 |
| * | The maximum power of 2 dividing a power of 2 is itself. This occurs | Duncan Sands | 2011-10-26 |
| * | My super-optimizer noticed that we weren't folding this expression to | Duncan Sands | 2011-10-26 |
| * | InstSimplify: Don't try to replace an extractvalue/insertvalue pair with the ... | Benjamin Kramer | 2011-09-05 |
| * | Add some simple insertvalue simplifications, for the purpose of cleaning | Duncan Sands | 2011-09-05 |
| * | Remove bogus test: for all possible inputs of %X, the 'sub nsw' is guaranteed | Nick Lewycky | 2011-07-19 |
| * | Improve constant folding of undef for cmp and select operators. | Dan Gohman | 2011-07-01 |
| * | Improve constant folding of undef for binary operators. | Dan Gohman | 2011-07-01 |
| * | The comparision "max(x,y)==x" is equivalent to "x>=y". Since the max is | Duncan Sands | 2011-05-07 |
| * | Add variations on: max(x,y) >= min(x,z) folds to true. This isn't that common, | Duncan Sands | 2011-05-04 |
| * | Implement some basic simplifications involving min/max, for example | Duncan Sands | 2011-05-03 |
| * | Move some rem transforms out of instcombine and into instsimplify. | Duncan Sands | 2011-05-02 |
| * | Teach ComputeMaskedBits about sub nsw. | Benjamin Kramer | 2011-03-12 |
| * | Teach ComputeMaskedBits about nsw on add. I don't think there's anything we can | Nick Lewycky | 2011-03-11 |
| * | Fix mistyped CHECK lines. | Benjamin Kramer | 2011-03-09 |
| * | Add another micro-optimization. Apologies for the lack of refactoring, but I | Nick Lewycky | 2011-03-09 |
| * | Thread comparisons over udiv/sdiv/ashr/lshr exact and lshr nuw/nsw whenever | Nick Lewycky | 2011-03-05 |
| * | Revert broken srem logic from r126991. | Nick Lewycky | 2011-03-04 |
| * | Fold "icmp pred (srem X, Y), Y" like we do for urem. Handle signed comparisons | Nick Lewycky | 2011-03-04 |
| * | Teach instruction simplify to use constant ranges to solve problems of the form | Nick Lewycky | 2011-03-04 |
| * | Optimize "icmp pred (urem X, Y), Y" --> true/false depending on pred. There's | Nick Lewycky | 2011-03-01 |
| * | Teach instsimplify that X+Y>=X+Z is the same as Y>=Z if neither side overflows, | Duncan Sands | 2011-02-13 |
| * | Teach instsimplify some tricks about exact/nuw/nsw shifts. | Chris Lattner | 2011-02-09 |
| * | teach instsimplify to transform (X / Y) * Y to X | Chris Lattner | 2011-02-06 |
| * | rename test. | Chris Lattner | 2011-02-06 |
| * | Improve threading of comparisons over select instructions (spotted by my | Duncan Sands | 2011-02-03 |
| * | Reenable the transform "(X*Y)/Y->X" when the multiplication is known not to | Duncan Sands | 2011-02-02 |
| * | Have m_One also match constant vectors for which every element is 1. | Duncan Sands | 2011-02-01 |
| * | Commit 124487 broke 254.gap. See if disabling the part that might be triggered | Duncan Sands | 2011-01-30 |
| * | Transform (X/Y)*Y into X if the division is exact. Instcombine already knows... | Duncan Sands | 2011-01-30 |
| * | Move InstCombine's knowledge of fdiv to SimplifyInstruction(). | Frits van Bommel | 2011-01-29 |
| * | Fix typo: should have been testing that X was odd, not V. | Duncan Sands | 2011-01-29 |
| * | My auto-simplifier noticed that ((X/Y)*Y)/Y occurs several times in SPEC | Duncan Sands | 2011-01-28 |
| * | In which I discover that zero+zero is zero, d'oh! | Duncan Sands | 2011-01-25 |
| * | Turn off this test - the corresponding instsimplify logic has been | Duncan Sands | 2011-01-25 |
| * | According to my auto-simplifier the most common missed simplifications in | Duncan Sands | 2011-01-25 |
| * | At -O123 the early-cse pass is run before instcombine has run. According to my | Duncan Sands | 2011-01-20 |
| * | For completeness, generalize the (X + Y) - Y -> X transform and add X - (X + ... | Duncan Sands | 2011-01-18 |
| * | Simplify (X<<1)-X into X. According to my auto-simplier this is the most com... | Duncan Sands | 2011-01-18 |
| * | Turn X-(X-Y) into Y. According to my auto-simplifier this is the most common | Duncan Sands | 2011-01-14 |
| * | Factorize common code out of the InstructionSimplify shift logic. Add in | Duncan Sands | 2011-01-14 |
| * | Rename this test. | Duncan Sands | 2011-01-14 |
| * | The most common simplification missed by instsimplify in unoptimized bitcode | Duncan Sands | 2011-01-13 |
