| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | InstCombine: variations on 0xffffffff - x >= 4 | David Majnemer | 2013-07-09 | 1 | -0/+18 |
| * | InstCombine: X & -C != -C -> X <= u ~C | David Majnemer | 2013-07-09 | 1 | -40/+0 |
| * | Commit r185909 was a misapplied patch, fix it | David Majnemer | 2013-07-09 | 1 | -0/+58 |
| * | InstCombine: add more transforms | David Majnemer | 2013-07-09 | 1 | -0/+40 |
| * | InstCombine: Fold X-C1 <u 2 -> (X & -2) == C1 | David Majnemer | 2013-07-08 | 1 | -0/+10 |
| * | InstCombine: typo in or_icmp_eq_B_0_icmp_ult_A_B test | David Majnemer | 2013-07-06 | 1 | -2/+2 |
| * | InstCombine: (icmp eq B, 0) | (icmp ult A, B) -> (icmp ule A, B-1) | David Majnemer | 2013-07-05 | 1 | -0/+11 |
| * | InstCombine: Optimize (1 << X) Pred CstP2 to X Pred Log2(CstP2) | David Majnemer | 2013-06-28 | 1 | -0/+104 |
| * | Add a testcase from pr16244. | Rafael Espindola | 2013-06-06 | 1 | -0/+10 |
| * | InstCombine: Don't just copy known bits from the first operand of an srem. | Benjamin Kramer | 2013-05-09 | 1 | -0/+12 |
| * | Reorders two transforms that collide with each other | David Majnemer | 2013-04-14 | 1 | -0/+12 |
| * | Simplify (A & ~B) in icmp if A is a power of 2 | David Majnemer | 2013-04-12 | 1 | -0/+26 |
| * | Optimize icmp involving addition better | David Majnemer | 2013-04-11 | 1 | -0/+52 |
| * | Address issues found by Duncan during post-commit review of r177856. | Arnaud A. de Grandmaison | 2013-03-25 | 1 | -2/+2 |
| * | InstCombine: simplify comparisons to zero of (shl %x, Cst) or (mul %x, Cst) | Arnaud A. de Grandmaison | 2013-03-25 | 1 | -0/+142 |
| * | Teach InstCombine to work with smaller legal types in icmp (shl %v, C1), C2 | Arnaud A. de Grandmaison | 2013-02-15 | 1 | -0/+38 |
| * | Add extra CHECK to make sure that 'or' instruction was replaced. | Jakub Staszak | 2012-12-31 | 1 | -0/+1 |
| * | Transform (A == C1 || A == C2) into (A & ~(C1 ^ C2)) == C1 | Jakub Staszak | 2012-12-31 | 1 | -0/+11 |
| * | Transform (x&C)>V into (x&C)!=0 where possible | Paul Redmond | 2012-12-19 | 1 | -0/+17 |
| * | Revert r170020, "Simplify negated bit test", for now. | NAKAMURA Takumi | 2012-12-13 | 1 | -26/+0 |
| * | Simplify negated bit test | David Majnemer | 2012-12-12 | 1 | -0/+26 |
| * | Fix PR14361: wrong simplification of A+B==B+A. You may think that the old logic | Duncan Sands | 2012-11-16 | 1 | -0/+18 |
| * | InstCombine: Turn (zext A) == (B & (1<<X)-1) into A == (trunc B), narrowing t... | Benjamin Kramer | 2012-06-10 | 1 | -0/+22 |
| * | Reinstate the optimization from r151449 with a fix to not turn 'gep %x' into | Nick Lewycky | 2012-02-26 | 1 | -3/+1 |
| * | Roll these back to r151448 until I figure out how they're breaking | Nick Lewycky | 2012-02-25 | 1 | -1/+3 |
| * | Teach instsimplify to be more aggressive when analyzing comparisons of pointers | Nick Lewycky | 2012-02-25 | 1 | -3/+1 |
| * | InstCombine: Don't transform a signed icmp of two GEPs into a signed compare ... | Benjamin Kramer | 2012-02-21 | 1 | -0/+11 |
| * | Test case for r150978. | Benjamin Kramer | 2012-02-20 | 1 | -0/+13 |
| * | InstCombine: When comparing two GEPs that were derived from the same base poi... | Benjamin Kramer | 2012-02-20 | 1 | -0/+26 |
| * | Add r149110 back with a fix for when the vector and the int have the same | Rafael Espindola | 2012-01-27 | 1 | -6/+5 |
| * | Revert r149110 and add a testcase that was crashing since that revision. | Rafael Espindola | 2012-01-27 | 1 | -2/+12 |
| * | enhance constant folding to be able to constant fold bitcast of | Chris Lattner | 2012-01-27 | 1 | -2/+2 |
| * | FileCheck hygiene. | Benjamin Kramer | 2012-01-05 | 1 | -1/+1 |
| * | Improved fix for abs(val) != 0 to check other similar case. Also fixed style... | Pete Cooper | 2011-12-01 | 1 | -2/+12 |
| * | Removed use of grep from test and moved it to be with other icmp tests | Pete Cooper | 2011-12-01 | 1 | -0/+11 |
| * | PR10267: Don't combine an equality compare with an AND into an inequality com... | Benjamin Kramer | 2011-07-04 | 1 | -0/+12 |
| * | InstCombine: Fold A-b == C --> b == A-C if A and C are constants. | Benjamin Kramer | 2011-06-13 | 1 | -0/+16 |
| * | InstCombine: Shrink ((zext X) & C1) == C2 to fold away the cast if the "zext"... | Benjamin Kramer | 2011-06-12 | 1 | -0/+10 |
| * | PR9838: Fix transform introduced in r127064 to not trigger when only one side... | Eli Friedman | 2011-05-05 | 1 | -0/+11 |
| * | Transform: "icmp eq (trunc (lshr(X, cst1)), cst" to "icmp (and X, mask), cst" | Chris Lattner | 2011-04-26 | 1 | -0/+16 |
| * | Fix mistyped CHECK lines. | Benjamin Kramer | 2011-03-09 | 1 | -1/+1 |
| * | Tweak this test. We can analyze what happens and show that we still do the | Nick Lewycky | 2011-03-07 | 1 | -2/+2 |
| * | Add more analysis of the sign bit of an srem instruction. If the LHS is negative | Nick Lewycky | 2011-03-07 | 1 | -0/+19 |
| * | ConstantInt has some getters which return ConstantInt's or ConstantVector's of | Nick Lewycky | 2011-03-06 | 1 | -0/+10 |
| * | Thread comparisons over udiv/sdiv/ashr/lshr exact and lshr nuw/nsw whenever | Nick Lewycky | 2011-03-05 | 1 | -0/+46 |
| * | Try once again to optimize "icmp (srem X, Y), Y" by turning the comparison into | Nick Lewycky | 2011-03-05 | 1 | -0/+16 |
| * | Fold "icmp pred (srem X, Y), Y" like we do for urem. Handle signed comparisons | Nick Lewycky | 2011-03-04 | 1 | -2/+11 |
| * | srem doesn't actually have the same resulting sign as its numerator, you could | Nick Lewycky | 2011-02-28 | 1 | -15/+5 |
| * | Teach InstCombine to fold "(shr exact X, Y) == 0" --> X == 0, fixing #1 from | Nick Lewycky | 2011-02-28 | 1 | -0/+17 |
| * | The sign of an srem instruction is the sign of its dividend (the first | Nick Lewycky | 2011-02-28 | 1 | -0/+10 |
