| Commit message (Expand) | Author | Age |
|---|
| * | Tests: rewrite 'opt ... %s' to 'opt ... < %s' so that opt does not emit a Mod... | Dmitri Gribenko | 2012-12-30 |
| * | Teach instsimplify to use the constant folder where appropriate for | Chandler Carruth | 2012-12-28 |
| * | Added a slew of SimplifyInstruction floating-point optimizations, many of whi... | Michael Ilseman | 2012-12-12 |
| * | Add support to ValueTracking for determining that a pointer is non-null | Chandler Carruth | 2012-12-07 |
| * | Fast-math test for SimplifyInstruction: fold multiply by 0 | Michael Ilseman | 2012-11-27 |
| * | InstructionSimplify should be able to simplify A+B==B+A to 'true' | Duncan Sands | 2012-11-16 |
| * | Revert r153521 as it's causing large regressions on the nightly testers. | Chad Rosier | 2012-03-28 |
| * | Reapply r153423; the original commit was fine. The failing test, distray, had | Chad Rosier | 2012-03-27 |
| * | Revert r153423 as this is causing failures on our internal nightly testers. | Chad Rosier | 2012-03-26 |
| * | Use the new range metadata in computeMaskedBits and add a new optimization to | Rafael Espindola | 2012-03-26 |
| * | Teach instsimplify how to simplify comparisons of pointers which are | Chandler Carruth | 2012-03-25 |
| * | Switch the pointer-difference simplification logic to only work with | Chandler Carruth | 2012-03-25 |
| * | Generalize the "trunc(ptrtoint(x)) - trunc(ptrtoint(y)) -> | Duncan Sands | 2012-03-13 |
| * | Teach instsimplify how to constant fold pointer differences. | Chandler Carruth | 2012-03-12 |
| * | Make sure we don't return bits outside the mask in ComputeMaskedBits. PR12189. | Eli Friedman | 2012-03-05 |
| * | Reinstate the optimization from r151449 with a fix to not turn 'gep %x' into | Nick Lewycky | 2012-02-26 |
| * | Roll these back to r151448 until I figure out how they're breaking | Nick Lewycky | 2012-02-25 |
| * | An argument and a local identified object (eg. a noalias call) could turn out | Nick Lewycky | 2012-02-25 |
| * | Teach instsimplify to be more aggressive when analyzing comparisons of pointers | Nick Lewycky | 2012-02-25 |
| * | fix PR12075, a regression in a recent transform I added. In unreachable code... | Chris Lattner | 2012-02-24 |
| * | fold comparisons of gep'd alloca points with null to false, | Chris Lattner | 2012-02-20 |
| * | Fix a rather nasty regression from r150690: LHS != RHS does not imply LHS->st... | Eli Friedman | 2012-02-18 |
| * | InstSimplify: Ignore pointer casts when constant folding compares between poi... | Benjamin Kramer | 2012-02-16 |
| * | Replace all instances of dg.exp file with lit.local.cfg, since all tests are ... | Eli Bendersky | 2012-02-16 |
| * | Fix PR11948: the result type of an icmp may be a vector of boolean - | Duncan Sands | 2012-02-10 |
| * | Revert commit 149912 (lattner) and add a testcase that shows the problem (which | Duncan Sands | 2012-02-10 |
| * | Add support for vectors of pointers. | Nadav Rotem | 2011-12-05 |
| * | Fix a crash in which a multiplication was being reported as being both negative | Duncan Sands | 2011-11-23 |
| * | Fix code to match comment. Fixes PR11340, a regression from r143209. | Eli Friedman | 2011-11-08 |
| * | Add tests for existing InstSimplify features. | Dan Gohman | 2011-11-04 |
| * | 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 |
