| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Improve and elimination. On PPC, for: | Chris Lattner | 2005-04-21 | 1 | -6/+26 |
| * | Fold (x & 8) != 0 and (x & 8) == 8 into (x & 8) >> 3. | Chris Lattner | 2005-04-21 | 1 | -0/+22 |
| * | Fold setcc of MVT::i1 operands into logical operations | Chris Lattner | 2005-04-18 | 1 | -0/+39 |
| * | Another minor simplification: handle setcc (zero_extend x), c -> setcc(x, c') | Chris Lattner | 2005-04-18 | 1 | -0/+45 |
| * | Another simple xform | Chris Lattner | 2005-04-18 | 1 | -0/+8 |
| * | Fold: | Chris Lattner | 2005-04-18 | 1 | -0/+11 |
| * | Make the AND elimination operation recursive and significantly more powerful, | Chris Lattner | 2005-04-18 | 1 | -26/+57 |
| * | Add a couple missing transforms in getSetCC that were triggering assertions | Nate Begeman | 2005-04-14 | 1 | -1/+8 |
| * | Disbale the broken fold of shift + sz[ext] for now | Nate Begeman | 2005-04-13 | 1 | -7/+30 |
| * | fix an infinite loop | Chris Lattner | 2005-04-13 | 1 | -1/+1 |
| * | fix some serious miscompiles on ia64, alpha, and ppc | Chris Lattner | 2005-04-13 | 1 | -1/+1 |
| * | avoid work when possible, perhaps fix the problem nate and andrew are seeing | Chris Lattner | 2005-04-13 | 1 | -0/+1 |
| * | add back the optimization that Nate added for shl X, (zext_inreg y) | Chris Lattner | 2005-04-13 | 1 | -2/+23 |
| * | Oops, remove these too. | Chris Lattner | 2005-04-13 | 1 | -6/+2 |
| * | Remove all foldings of ZERO_EXTEND_INREG, moving them to work for AND nodes | Chris Lattner | 2005-04-13 | 1 | -41/+46 |
| * | Fold shift x, [sz]ext(y) -> shift x, y | Nate Begeman | 2005-04-12 | 1 | -0/+16 |
| * | Fold shift by size larger than type size to undef | Nate Begeman | 2005-04-12 | 1 | -11/+4 |
| * | Remove some redundant checks, add a couple of new ones. This allows us to | Chris Lattner | 2005-04-12 | 1 | -7/+5 |
| * | canonicalize x <u 1 -> x == 0. On this testcase: | Chris Lattner | 2005-04-12 | 1 | -0/+9 |
| * | Don't bother sign/zext_inreg'ing the result of an and operation if we know | Chris Lattner | 2005-04-10 | 1 | -0/+19 |
| * | Fold zext_inreg(zextload), likewise for sext's | Chris Lattner | 2005-04-10 | 1 | -0/+6 |
| * | add a simple xform | Chris Lattner | 2005-04-10 | 1 | -0/+6 |
| * | Fix a thinko. If the operand is promoted, pass the promoted value into | Chris Lattner | 2005-04-10 | 1 | -0/+4 |
| * | add a little peephole optimization. This allows us to codegen: | Chris Lattner | 2005-04-09 | 1 | -0/+11 |
| * | recognize some patterns as fabs operations, so that fabs at the source level | Chris Lattner | 2005-04-09 | 1 | -0/+21 |
| * | print and fold BRCONDTWOWAY correctly | Chris Lattner | 2005-04-09 | 1 | -11/+25 |
| * | canonicalize a bunch of operations involving fneg | Chris Lattner | 2005-04-09 | 1 | -0/+21 |
| * | If a target zero or sign extends the result of its setcc, allow folding of | Chris Lattner | 2005-04-07 | 1 | -1/+13 |
| * | Remove somethign I had for testing | Chris Lattner | 2005-04-07 | 1 | -1/+1 |
| * | This patch does two things. First, it canonicalizes 'X >= C' -> 'X > C-1' | Chris Lattner | 2005-04-07 | 1 | -7/+49 |
| * | Fix a really scary bug that Nate found where we weren't deleting the right | Chris Lattner | 2005-04-07 | 1 | -1/+1 |
| * | Add MULHU and MULHS nodes for the high part of an (un)signed 32x32=64b | Nate Begeman | 2005-04-05 | 1 | -0/+2 |
| * | print fneg/fabs | Chris Lattner | 2005-04-02 | 1 | -0/+5 |
| * | fix some bugs in the implementation of SHL_PARTS and friends. | Chris Lattner | 2005-04-02 | 1 | -3/+9 |
| * | Print some new nodes | Chris Lattner | 2005-04-02 | 1 | -1/+6 |
| * | Add ISD::UNDEF node | Nate Begeman | 2005-04-01 | 1 | -0/+1 |
| * | PCMarker support for DAG and Alpha | Andrew Lenharth | 2005-03-31 | 1 | -0/+1 |
| * | Fix a bug where we would incorrectly do a sign ext instead of a zero ext | Chris Lattner | 2005-03-10 | 1 | -1/+1 |
| * | constant fold FP_ROUND_INREG, ZERO_EXTEND_INREG, and SIGN_EXTEND_INREG | Chris Lattner | 2005-03-09 | 1 | -0/+12 |
| * | Don't rely on doubles comparing identical to each other, which doesn't work | Chris Lattner | 2005-02-17 | 1 | -4/+19 |
| * | Remove the 3 HACK HACK HACKs I put in before, fixing them properly with | Chris Lattner | 2005-01-23 | 1 | -14/+27 |
| * | More bugfixes for IA64 shifts. | Chris Lattner | 2005-01-22 | 1 | -2/+2 |
| * | Add a nasty hack to fix Alpha/IA64 multiplies by a power of two. | Chris Lattner | 2005-01-22 | 1 | -4/+9 |
| * | Remove unneeded line. | Chris Lattner | 2005-01-21 | 1 | -1/+0 |
| * | test commit | Chris Lattner | 2005-01-21 | 1 | -0/+1 |
| * | Unary token factor nodes are unneeded. | Chris Lattner | 2005-01-21 | 1 | -0/+2 |
| * | implement add_parts/sub_parts. | Chris Lattner | 2005-01-20 | 1 | -3/+8 |
| * | Know some identities about tokenfactor nodes. | Chris Lattner | 2005-01-19 | 1 | -0/+11 |
| * | Know some simple identities. This improves codegen for (1LL << N). | Chris Lattner | 2005-01-19 | 1 | -0/+13 |
| * | Keep track of the retval type as well. | Chris Lattner | 2005-01-18 | 1 | -2/+5 |
