| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | 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 |
| * | Add factoring of multiplications, e.g. turning A*A+A*B into A*(A+B). | Chris Lattner | 2006-03-04 | 1 | -49/+186 |
| * | 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 |
| * | Make this work with renamed intrinsics. | Chris Lattner | 2006-03-03 | 1 | -26/+25 |
| * | 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 Regression/Transforms/LoopUnswitch/2006-02-22-UnswitchCrash.ll, which | Chris Lattner | 2006-02-22 | 1 | -1/+3 |
| * | Add some comments, simplify some code, and fix a bug that caused rewriting | Chris Lattner | 2006-02-22 | 1 | -34/+26 |
| * | improved support for branch folding, still not enabled. | Chris Lattner | 2006-02-18 | 1 | -143/+269 |
| * | Fix bugs identified by VC++. | Jeff Cohen | 2006-02-18 | 1 | -2/+2 |
| * | Implement deletion of dead blocks, currently disabled. | Chris Lattner | 2006-02-18 | 1 | -28/+75 |
| * | a previous patch completely disabled trivial unswitching, this fixees it. | Chris Lattner | 2006-02-18 | 1 | -1/+0 |
| * | initial trivial support for folding branches that have now-constant destinati... | Chris Lattner | 2006-02-18 | 1 | -3/+34 |
| * | When unswitching a loop, make sure to update loop info with exit blocks in | Chris Lattner | 2006-02-18 | 1 | -2/+4 |
| * | Fix Transforms/SimplifyCFG/2006-02-17-InfiniteUnroll.ll | Chris Lattner | 2006-02-18 | 1 | -2/+8 |
| * | Fix loops where the header has an exit, fixing a loop-unswitch crash on crafty | Chris Lattner | 2006-02-17 | 1 | -13/+15 |
| * | start of some new simplification code, not thoroughly tested, use at your own | Chris Lattner | 2006-02-17 | 1 | -14/+161 |
| * | Rework the SelectionDAG-based implementations of SimplifyDemandedBits | Nate Begeman | 2006-02-16 | 1 | -3/+3 |
| * | Change SplitBlock to increment a BasicBlock::iterator, not an Instruction*. ... | Chris Lattner | 2006-02-16 | 1 | -23/+27 |
| * | Fix VC++ warning. | Jeff Cohen | 2006-02-16 | 1 | -1/+0 |
| * | fix a bug where we unswitched the wrong way | Chris Lattner | 2006-02-16 | 1 | -2/+2 |
| * | Implement trivial unswitching for switch stmts. This allows us to trivial | Chris Lattner | 2006-02-15 | 1 | -27/+51 |
| * | make "trivial" unswitching significantly more general. It can now handle | Chris Lattner | 2006-02-15 | 1 | -47/+79 |
| * | fix a bunch of alpha regressions. see bug 709 | Andrew Lenharth | 2006-02-15 | 1 | -6/+6 |
| * | Checking the wrong value. This caused us to emit silly code like | Chris Lattner | 2006-02-15 | 1 | -1/+1 |
| * | more refactoring, no functionality change. | Chris Lattner | 2006-02-15 | 1 | -12/+11 |
| * | pull some code out into a function | Chris Lattner | 2006-02-15 | 1 | -18/+28 |
| * | Canonicalize inner loops before outer loops. Inner loop canonicalization | Chris Lattner | 2006-02-14 | 1 | -4/+5 |
| * | When splitting exit edges to canonicalize loops, make sure to put the new | Chris Lattner | 2006-02-14 | 1 | -18/+20 |
| * | Use statistics to keep track of what flavors of loops we are unswitching | Chris Lattner | 2006-02-14 | 1 | -7/+19 |
| * | 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 |
| * | Revert my last patch. It too breaks stuff | Chris Lattner | 2006-02-12 | 1 | -12/+6 |
| * | Fix for my previously reverted patch | Chris Lattner | 2006-02-11 | 1 | -6/+12 |
| * | Port the recent innovations in ComputeMaskedBits to SimplifyDemandedBits. | Chris Lattner | 2006-02-11 | 1 | -211/+425 |
| * | revert my previous change, it exposed other problems. | Chris Lattner | 2006-02-11 | 1 | -1/+1 |
