| Commit message (Expand) | Author | Age | Files | Lines |
| * | Two changes: | Chris Lattner | 2006-05-10 | 1 | -7/+72 |
| * | Move some code around. | Chris Lattner | 2006-05-06 | 1 | -124/+140 |
| * | Fix an infinite loop compiling oggenc last night. | Chris Lattner | 2006-05-05 | 1 | -6/+9 |
| * | Implement InstCombine/cast.ll:test29 | Chris Lattner | 2006-05-05 | 1 | -0/+40 |
| * | Fix Transforms/InstCombine/2006-05-04-DemandedBitCrash.ll | Chris Lattner | 2006-05-04 | 1 | -0/+4 |
| * | Fix InstCombine/2006-04-28-ShiftShiftLongLong.ll | Chris Lattner | 2006-04-28 | 1 | -1/+1 |
| * | Add support for inserting undef into a vector. This implements | Chris Lattner | 2006-04-27 | 1 | -3/+14 |
| * | Make code match cvs commit message :) | Andrew Lenharth | 2006-04-20 | 1 | -1/+1 |
| * | If we can convert the return pointer type into an integer that IntPtrType | Andrew Lenharth | 2006-04-20 | 1 | -2/+4 |
| * | Turn x86 unaligned load/store intrinsics into aligned load/store instructions | Chris Lattner | 2006-04-17 | 1 | -1/+16 |
| * | Fix a bug in the 'shuffle(undef,x,mask) -> shuffle(x, undef,mask')' xform | Chris Lattner | 2006-04-16 | 1 | -17/+84 |
| * | Canonicalize shuffle(undef,x,mask) -> shuffle(x, undef,mask'). | Chris Lattner | 2006-04-16 | 1 | -2/+22 |
| * | significant cleanups to code that uses insert/extractelt heavily. This builds | Chris Lattner | 2006-04-15 | 1 | -0/+126 |
| * | Turn casts into getelementptr's when possible. This enables SROA to be more | Chris Lattner | 2006-04-12 | 1 | -0/+23 |
| * | Implement vec_shuffle.ll:test3 | Chris Lattner | 2006-04-10 | 1 | -2/+17 |
| * | Implement InstCombine/vec_shuffle.ll:test[12] | Chris Lattner | 2006-04-10 | 1 | -0/+62 |
| * | Lower vperm(x,y, mask) -> shuffle(x,y,mask) if mask is constant. This allows | Chris Lattner | 2006-04-06 | 1 | -8/+58 |
| * | vector casts of casts are eliminable. Transform this: | Chris Lattner | 2006-04-02 | 1 | -0/+4 |
| * | Allow transforming this: | Chris Lattner | 2006-04-02 | 1 | -2/+4 |
| * | Turn altivec lvx/stvx intrinsics into loads and stores. This allows the | Chris Lattner | 2006-04-02 | 1 | -0/+22 |
| * | Fix InstCombine/2006-04-01-InfLoop.ll | Chris Lattner | 2006-04-01 | 1 | -1/+2 |
| * | Fold A^(B&A) -> (B&A)^A | Chris Lattner | 2006-04-01 | 1 | -7/+46 |
| * | If we can look through vector operations to find the scalar version of an | Chris Lattner | 2006-03-31 | 1 | -0/+40 |
| * | extractelement(undef,x) -> undef | Chris Lattner | 2006-03-31 | 1 | -6/+8 |
| * | Fix Transforms/InstCombine/2006-03-30-ExtractElement.ll | Chris Lattner | 2006-03-30 | 1 | -3/+7 |
| * | Don't crash on packed logical ops | Chris Lattner | 2006-03-25 | 1 | -3/+6 |
| * | Can't combine anymore - we don't have a chain through llvm.dbg intrinsics. | Jim Laskey | 2006-03-23 | 1 | -10/+0 |
| * | Teach the alignment handling code to look through constant expr casts and GEPs | Chris Lattner | 2006-03-07 | 1 | -4/+12 |
| * | Teach instcombine to increase the alignment of memset/memcpy/memmove when | Chris Lattner | 2006-03-06 | 1 | -3/+74 |
| * | Make vector narrowing more effective, implementing | Chris Lattner | 2006-03-05 | 1 | -22/+62 |
| * | Canonicalize (X+C1)*C2 -> X*C2+C1*C2 | Chris Lattner | 2006-03-04 | 1 | -0/+13 |
| * | Change this to work with renamed intrinsics. | Chris Lattner | 2006-03-03 | 1 | -1/+7 |
| * | Generalize the REM folding code to handle another case Nick Lewycky | Chris Lattner | 2006-03-02 | 1 | -13/+43 |
| * | Fix a regression in a patch from a couple of days ago. This fixes | Chris Lattner | 2006-02-28 | 1 | -1/+3 |
| * | Implement rem.ll:test[7-9] and PR712 | Chris Lattner | 2006-02-28 | 1 | -6/+22 |
| * | Simplify some code now that the RHS of a rem can't be 0 | Chris Lattner | 2006-02-28 | 1 | -8/+6 |
| * | Rearrange some code, fold "rem X, 0", implementing rem.ll:test6 | Chris Lattner | 2006-02-28 | 1 | -38/+39 |
| * | Merge two almost-identical pieces of code. | Chris Lattner | 2006-02-27 | 1 | -46/+42 |
| * | Fold (A^B) == A -> B == 0 | Chris Lattner | 2006-02-27 | 1 | -0/+26 |
| * | Fold (X|C1)^C2 -> X^(C1|C2) when possible. This implements | Chris Lattner | 2006-02-26 | 1 | -0/+14 |
| * | Fix a problem that Nate noticed that boils down to an over conservative check | Chris Lattner | 2006-02-24 | 1 | -22/+17 |
| * | Fix bugs identified by VC++. | Jeff Cohen | 2006-02-18 | 1 | -2/+2 |
| * | Rework the SelectionDAG-based implementations of SimplifyDemandedBits | Nate Begeman | 2006-02-16 | 1 | -3/+3 |
| * | Implement Instcombine/and.ll:test34 | Chris Lattner | 2006-02-13 | 1 | -0/+12 |
| * | If any of the sign extended bits are demanded, the input sign bit is demanded | Chris Lattner | 2006-02-13 | 1 | -3/+9 |
| * | Be careful not to request or look at bits shifted in from outside the size | Chris Lattner | 2006-02-13 | 1 | -3/+9 |
| * | remove some more dead special case code | Chris Lattner | 2006-02-12 | 1 | -35/+8 |
| * | Eliminate special case hacks that are superceded by general purpose hacks | Chris Lattner | 2006-02-12 | 1 | -139/+51 |
| * | Three changes: | Chris Lattner | 2006-02-12 | 1 | -6/+135 |
| * | Port the recent innovations in ComputeMaskedBits to SimplifyDemandedBits. | Chris Lattner | 2006-02-11 | 1 | -211/+425 |