Age | Commit message (Expand) | Author |
2011-03-28 | Remove tabs I accidentally added. | Nick Lewycky |
2011-03-28 | Make more use of PHINode::getNumIncomingValues(). | Jay Foad |
2011-03-27 | Add some debug output when -instcombine uses RAUW. This can make debug output... | Frits van Bommel |
2011-03-27 | Teach the transformation that moves binary operators around selects to preserve | Nick Lewycky |
2011-03-27 | Use APInt's umul_ov instead of rolling our own overflow detection. | Benjamin Kramer |
2011-03-27 | Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This | Nick Lewycky |
2011-03-17 | Try to not lose variable's debug info during instcombine. | Devang Patel |
2011-03-15 | If we don't know how long a string is we can't fold an _chk version to the | Eric Christopher |
2011-03-14 | This case is solved by Scalar Replacement of Aggregates (DT) and | Jin-Gu Kang |
2011-03-13 | Add comment as following: | Jin-Gu Kang |
2011-03-12 | This patch removes some of useless instructions generated by bitfield access. | Jin-Gu Kang |
2011-03-11 | InstCombine: Fix a thinko where transform an icmp under the assumption that i... | Benjamin Kramer |
2011-03-10 | InstCombine: Turn umul_with_overflow into mul nuw if we can prove that it can... | Benjamin Kramer |
2011-03-09 | PR9346: Prevent SimplifyDemandedBits from incorrectly introducing | Eli Friedman |
2011-03-08 | llvm.dbg.declare intrinsic does not use any llvm::Values. It's magic! | Devang Patel |
2011-03-08 | Reorder comments to put them the right way around. | Nick Lewycky |
2011-03-07 | Add more analysis of the sign bit of an srem instruction. If the LHS is negative | Nick Lewycky |
2011-03-06 | ConstantInt has some getters which return ConstantInt's or ConstantVector's of | Nick Lewycky |
2011-03-05 | InstCombine: We know the number of items initially added to the worklist map,... | Benjamin Kramer |
2011-03-05 | Thread comparisons over udiv/sdiv/ashr/lshr exact and lshr nuw/nsw whenever | Nick Lewycky |
2011-03-05 | Try once again to optimize "icmp (srem X, Y), Y" by turning the comparison into | Nick Lewycky |
2011-03-01 | Make InstCombiner::FoldAndOfICmps create a ConstantRange that's the | Anders Carlsson |
2011-02-28 | srem doesn't actually have the same resulting sign as its numerator, you could | Nick Lewycky |
2011-02-28 | Teach InstCombine to fold "(shr exact X, Y) == 0" --> X == 0, fixing #1 from | Nick Lewycky |
2011-02-28 | The sign of an srem instruction is the sign of its dividend (the first | Nick Lewycky |
2011-02-24 | change instcombine to not turn a call to non-varargs bitcast of | Chris Lattner |
2011-02-20 | Move "A | ~(A & ?) -> -1" from InstCombine to InstructionSimplify. | Benjamin Kramer |
2011-02-20 | InstCombine: Add a bunch of combines of the form x | (y ^ z). | Benjamin Kramer |
2011-02-19 | PR9218: SimplifyDemandedVectorElts can return a non-null value that is not | Eli Friedman |
2011-02-18 | Add some transforms of the kind X-Y>X -> 0>Y which are valid when there is no | Duncan Sands |
2011-02-17 | have instcombine preserve nsw/nuw/exact when sinking | Chris Lattner |
2011-02-17 | fix typo | Chris Lattner |
2011-02-17 | fix instcombine merging GEPs through a PHI to only make the | Chris Lattner |
2011-02-17 | add is always integer, thanks to Frits for noticing this. | Chris Lattner |
2011-02-17 | Transform "A + B >= A + C" into "B >= C" if the adds do not wrap. Likewise f... | Duncan Sands |
2011-02-17 | preserve NUW/NSW when transforming add x,x | Chris Lattner |
2011-02-15 | Spelling fix: consequtive -> consecutive. | Duncan Sands |
2011-02-15 | Fix 9216 - Endless loop in InstCombine pass. | Nadav Rotem |
2011-02-15 | Do not forget DebugLoc! | Devang Patel |
2011-02-15 | tidy up a bit. | Chris Lattner |
2011-02-15 | convert ConstantVector::get to use ArrayRef. | Chris Lattner |
2011-02-14 | revert my ConstantVector patch, it seems to have made the llvm-gcc | Chris Lattner |
2011-02-14 | Switch ConstantVector::get to use ArrayRef instead of a pointer+size | Chris Lattner |
2011-02-13 | remove a now-unneccesary cast. | Chris Lattner |
2011-02-13 | implement instcombine folding for things like (x >> c) < 42. | Chris Lattner |
2011-02-13 | refactor some code out into a helper method. | Chris Lattner |
2011-02-11 | Also fold (A+B) == A -> B == 0 when the add is commuted. | Benjamin Kramer |
2011-02-11 | When lowering an inbounds gep, the intermediate adds can have | Chris Lattner |
2011-02-10 | implement the first part of PR8882: when lowering an inbounds | Chris Lattner |
2011-02-10 | Enhance a bunch of transformations in instcombine to start generating | Chris Lattner |