| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | 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 |
| * | Add some transforms of the kind X-Y>X -> 0>Y which are valid when there is no | Duncan Sands | 2011-02-18 | 1 | -1/+125 |
| * | Transform "A + B >= A + C" into "B >= C" if the adds do not wrap. Likewise f... | Duncan Sands | 2011-02-17 | 1 | -0/+19 |
| * | implement the first part of PR8882: when lowering an inbounds | Chris Lattner | 2011-02-10 | 1 | -0/+16 |
| * | merge two tests. | Chris Lattner | 2011-02-09 | 1 | -0/+9 |
| * | Fix a random missed optimization by making InstCombine more aggressive when d... | Owen Anderson | 2011-01-11 | 1 | -0/+17 |
| * | duncan's spider sense was right, I completely reversed the condition | Chris Lattner | 2010-11-23 | 1 | -4/+4 |
| * | optimize: | Chris Lattner | 2010-11-21 | 1 | -0/+38 |
| * | Constant fold x == undef to undef. | Dan Gohman | 2010-06-28 | 1 | -0/+23 |
| * | fix incorrect folding of icmp with undef, PR6481. | Chris Lattner | 2010-03-03 | 1 | -1/+11 |
| * | fix PR6195, a bug constant folding scalar -> vector compares. | Chris Lattner | 2010-02-01 | 1 | -0/+9 |
| * | enhance x-(-A) -> x+A to preserve NUW/NSW. | Chris Lattner | 2009-12-21 | 1 | -0/+13 |
| * | Optimize all cases of "icmp (X+Cst), X" to something simpler. This triggers | Chris Lattner | 2009-12-21 | 1 | -0/+37 |
| * | convert to filecheck | Chris Lattner | 2009-12-21 | 1 | -1/+21 |
| * | simplify a transformation by making it more general. | Chris Lattner | 2009-10-11 | 1 | -1/+9 |
| * | Use opt -S instead of piping bitcode output through llvm-dis. | Dan Gohman | 2009-09-08 | 1 | -1/+1 |
| * | Change these tests to feed the assembly files to opt directly, instead | Dan Gohman | 2009-09-08 | 1 | -1/+1 |
| * | fix PR4837, some bugs folding vector compares. These | Chris Lattner | 2009-09-02 | 1 | -0/+6 |
| * | Implement rdar://6480391, extending of equality icmp's to avoid a truncation. | Chris Lattner | 2009-01-09 | 1 | -1/+0 |
| * | For PR1319: | Reid Spencer | 2007-04-14 | 1 | -1/+1 |
| * | sext of compares. | Chris Lattner | 2007-04-11 | 1 | -0/+14 |
| * | new testcase | Chris Lattner | 2007-04-11 | 1 | -0/+17 |
