| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | 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 |
| * | Implement constant folding of bit_convert of arbitrary constant vbuild_vector... | Chris Lattner | 2006-04-02 | 1 | -2/+139 |
| * | Delete identity shuffles, implementing CodeGen/Generic/vector-identity-shuffl... | Chris Lattner | 2006-03-31 | 1 | -2/+56 |
| * | Remove dead *extloads. This allows us to codegen vector.ll:test_extract_elt | Chris Lattner | 2006-03-31 | 1 | -0/+19 |
| * | Delete dead loads in the dag. This allows us to compile | Chris Lattner | 2006-03-31 | 1 | -0/+5 |
| * | When building a VVECTOR_SHUFFLE node from extract_element operations, make | Chris Lattner | 2006-03-28 | 1 | -1/+11 |
| * | Canonicalize VECTOR_SHUFFLE(X, X, Y) -> VECTOR_SHUFFLE(X,undef,Y') | Chris Lattner | 2006-03-28 | 1 | -0/+30 |
| * | Turn a series of extract_element's feeding a build_vector into a | Chris Lattner | 2006-03-28 | 1 | -0/+86 |
| * | Don't crash on X^X if X is a vector. Instead, produce a vector of zeros. | Chris Lattner | 2006-03-28 | 1 | -2/+10 |
| * | Don't call SimplifyDemandedBits on vectors | Chris Lattner | 2006-03-25 | 1 | -1/+2 |
| * | fold insertelement(buildvector) -> buildvector if the inserted element # is | Chris Lattner | 2006-03-19 | 1 | -0/+42 |
| * | Remove BRTWOWAY* | Nate Begeman | 2006-03-17 | 1 | -68/+0 |
| * | make sure dead token factor nodes are removed by the dag combiner. | Chris Lattner | 2006-03-13 | 1 | -0/+1 |
| * | Fold X+Y -> X|Y when safe. This implements: | Chris Lattner | 2006-03-13 | 1 | -1/+19 |
| * | add a couple of missing folds | Chris Lattner | 2006-03-13 | 1 | -0/+12 |
| * | Reinstate this now that the offending opposite xform has been removed. | Chris Lattner | 2006-03-05 | 1 | -0/+7 |
| * | Back out fold (shl (add x, c1), c2) -> (add (shl x, c2), c1<<c2) for now. | Evan Cheng | 2006-03-05 | 1 | -7/+0 |
| * | Add some simple copysign folds | Chris Lattner | 2006-03-05 | 1 | -7/+59 |
| * | fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2) | Chris Lattner | 2006-03-04 | 1 | -1/+14 |
| * | Fix CodeGen/Generic/2006-03-01-dagcombineinfloop.ll, an infinite loop | Chris Lattner | 2006-03-01 | 1 | -4/+9 |
| * | Fix a typo evan noticed | Chris Lattner | 2006-03-01 | 1 | -1/+1 |
| * | Add support for target-specific dag combines | Chris Lattner | 2006-03-01 | 1 | -13/+58 |
| * | Add a new AddToWorkList method, start using it | Chris Lattner | 2006-03-01 | 1 | -57/+63 |
| * | Pull shifts by a constant through multiplies (a form of reassociation), | Chris Lattner | 2006-03-01 | 1 | -0/+27 |
| * | Vector ops lowering. | Evan Cheng | 2006-03-01 | 1 | -1/+1 |
| * | Compile: | Chris Lattner | 2006-02-28 | 1 | -10/+17 |
| * | Fold "and (LOAD P), 255" -> zextload. This allows us to compile: | Chris Lattner | 2006-02-28 | 1 | -0/+33 |
| * | fold (sra (sra x, c1), c2) -> (sra x, c1+c2) | Chris Lattner | 2006-02-28 | 1 | -3/+11 |
| * | remove some completed notes | Chris Lattner | 2006-02-27 | 1 | -4/+0 |
| * | Fix a problem Nate and Duraid reported where simplifying nodes can cause | Chris Lattner | 2006-02-20 | 1 | -4/+8 |
| * | Add checks to make sure we don't create bogus extend nodes, and fix a bug | Nate Begeman | 2006-02-18 | 1 | -4/+10 |
| * | Fix a tricky issue in the SimplifyDemandedBits code where CombineTo wasn't | Chris Lattner | 2006-02-17 | 1 | -9/+34 |
| * | Clean up DemandedBitsAreZero interface | Nate Begeman | 2006-02-17 | 1 | -22/+26 |
| * | Don't expand sdiv by power of two before legalize, since it will likely | Nate Begeman | 2006-02-17 | 1 | -2/+2 |
| * | kill ADD_PARTS & SUB_PARTS and replace them with fancy new ADDC, ADDE, SUBC | Nate Begeman | 2006-02-17 | 1 | -46/+0 |
| * | Rework the SelectionDAG-based implementations of SimplifyDemandedBits | Nate Begeman | 2006-02-16 | 1 | -35/+17 |
| * | Lowering of sdiv X, pow2 was broken, this fixes it. This patch is written | Chris Lattner | 2006-02-16 | 1 | -6/+12 |
| * | Should not combine ISD::LOCATIONs until we have scheme to remove from | Jim Laskey | 2006-02-15 | 1 | -34/+0 |
| * | Compile this: | Chris Lattner | 2006-02-08 | 1 | -0/+26 |
