| Commit message (Expand) | Author | Age | Files | Lines |
| * | Fold (X & C1) | (Y & C2) -> (X|Y) & C3 when possible. | Chris Lattner | 2006-09-14 | 1 | -0/+20 |
| * | Split rotate matching code out to its own function. Make it stronger, by | Chris Lattner | 2006-09-14 | 1 | -53/+142 |
| * | DAG combiner fix for rotates. Previously the outer-most condition checks | Evan Cheng | 2006-08-31 | 1 | -27/+44 |
| * | Move isCommutativeBinOp from SelectionDAG.cpp and DAGCombiner.cpp out. Make i... | Evan Cheng | 2006-08-29 | 1 | -16/+3 |
| * | s|llvm/Support/Visibility.h|llvm/Support/Compiler.h| | Chris Lattner | 2006-08-27 | 1 | -1/+1 |
| * | change internal impl of dag combiner so that calls to CombineTo never have to | Chris Lattner | 2006-08-11 | 1 | -12/+9 |
| * | Change one ReplaceAllUsesWith method to take an array of operands to replace | Chris Lattner | 2006-08-11 | 1 | -2/+3 |
| * | Start eliminating temporary vectors used to create DAG nodes. Instead, pass | Chris Lattner | 2006-08-08 | 1 | -33/+41 |
| * | Initialize some variables the compiler warns about. | Reid Spencer | 2006-07-25 | 1 | -2/+2 |
| * | If a shuffle is a splat, check if the argument is a build_vector with all ele... | Evan Cheng | 2006-07-21 | 1 | -8/+90 |
| * | If a shuffle is unary, i.e. one of the vector argument is not needed, turn the | Evan Cheng | 2006-07-20 | 1 | -10/+56 |
| * | 80 cols | Andrew Lenharth | 2006-07-20 | 1 | -1/+2 |
| * | Reduce number of exported symbols | Andrew Lenharth | 2006-07-20 | 1 | -1/+1 |
| * | Mark these two classes as hidden, shrinking libllbmgcc.dylib by 25K | Chris Lattner | 2006-06-28 | 1 | -1/+2 |
| * | Start on my todo list | Andrew Lenharth | 2006-06-12 | 1 | -4/+4 |
| * | visitVBinOp: Can't fold divide by zero! | Evan Cheng | 2006-05-31 | 1 | -0/+8 |
| * | Fix a nasty dag combiner bug that caused nondeterminstic crashes (MY FAVORITE!): | Chris Lattner | 2006-05-27 | 1 | -4/+15 |
| * | Move this code to a common place | Andrew Lenharth | 2006-05-16 | 1 | -238/+14 |
| * | Comment out dead variables | Chris Lattner | 2006-05-12 | 1 | -2/+2 |
| * | Two simplifications for token factor nodes: simplify tf(x,x) -> x. | Chris Lattner | 2006-05-12 | 1 | -2/+6 |
| * | Debugging info | Evan Cheng | 2006-05-09 | 1 | -3/+3 |
| * | Make the case I just checked in stronger. Now we compile this: | Chris Lattner | 2006-05-08 | 1 | -5/+13 |
| * | Implement and_sext.ll:test3, generating: | Chris Lattner | 2006-05-08 | 1 | -1/+8 |
| * | Compile this: | Chris Lattner | 2006-05-08 | 1 | -0/+5 |
| * | Fix PR772 | Nate Begeman | 2006-05-08 | 1 | -9/+9 |
| * | Simplify some code, add a couple minor missed folds | Chris Lattner | 2006-05-06 | 1 | -21/+16 |
| * | remove cases handled elsewhere | Chris Lattner | 2006-05-06 | 1 | -16/+2 |
| * | Use the new TargetLowering::ComputeNumSignBits method to eliminate | Chris Lattner | 2006-05-06 | 1 | -5/+5 |
| * | Fold trunc(any_ext). This gives stuff like: | Chris Lattner | 2006-05-05 | 1 | -1/+2 |
| * | Shrink shifts when possible. | Chris Lattner | 2006-05-05 | 1 | -0/+12 |
| * | Fold (fpext (load x)) -> (extload x) | Chris Lattner | 2006-05-05 | 1 | -0/+14 |
| * | Fold some common code. | Chris Lattner | 2006-05-05 | 1 | -14/+2 |
| * | Implement: | Chris Lattner | 2006-05-05 | 1 | -5/+7 |
| * | Pull and through and/or/xor. This compiles some bitfield code to: | Chris Lattner | 2006-05-05 | 1 | -4/+6 |
| * | Implement a variety of simplifications for ANY_EXTEND. | Chris Lattner | 2006-05-05 | 1 | -0/+51 |
| * | Factor some code, add these transformations: | Chris Lattner | 2006-05-05 | 1 | -55/+66 |
| * | Remove a bogus transformation. This fixes SingleSource/UnitTests/2006-01-23-... | Chris Lattner | 2006-04-28 | 1 | -7/+0 |
| * | Fix a couple more memory issues | Chris Lattner | 2006-04-21 | 1 | -4/+4 |
| * | Fix a really subtle and obnoxious memory bug that caused issues with an | Chris Lattner | 2006-04-20 | 1 | -11/+11 |
| * | Turn a VAND into a VECTOR_SHUFFLE is applicable. | Evan Cheng | 2006-04-20 | 1 | -1/+64 |
| * | Canonicalize vvector_shuffle(x,x) -> vvector_shuffle(x,undef) to enable patterns | Chris Lattner | 2006-04-08 | 1 | -0/+36 |
| * | Codegen shufflevector as VVECTOR_SHUFFLE | Chris Lattner | 2006-04-08 | 1 | -1/+12 |
| * | 1. If both vector operands of a vector_shuffle are undef, turn it into an undef. | Evan Cheng | 2006-04-06 | 1 | -3/+6 |
| * | Do not create ZEXTLOAD's unless we are before legalize or the operation is | Chris Lattner | 2006-04-04 | 1 | -1/+2 |
| * | Add a missing check, this fixes UnitTests/Vector/sumarray.c | Chris Lattner | 2006-04-03 | 1 | -2/+2 |
| * | Add a missing check, which broke a bunch of vector tests. | Chris Lattner | 2006-04-03 | 1 | -3/+6 |
| * | back this out | Andrew Lenharth | 2006-04-03 | 1 | -25/+0 |
| * | This should be a win of every arch | Andrew Lenharth | 2006-04-02 | 1 | -1/+26 |
| * | Add a little dag combine to compile this: | Chris Lattner | 2006-04-02 | 1 | -0/+33 |
| * | Constant fold all of the vector binops. This allows us to compile this: | Chris Lattner | 2006-04-02 | 1 | -0/+49 |