| Age | Commit message (Expand) | Author |
|---|
| 2005-05-12 | handle a common case generated by the uint64 -> FP code path better | Chris Lattner |
| 2005-05-12 | Make legalize a bit more efficient, and canonicalize sub X, C -> add X, -C | Chris Lattner |
| 2005-05-11 | Do not memoize ADJCALLSTACKDOWN nodes, provide a method to hack on them. | Chris Lattner |
| 2005-05-11 | Print bit count nodes correctly | Chris Lattner |
| 2005-05-10 | Silence some VC++ warnings | Jeff Cohen |
| 2005-05-09 | Add support for READPORT, WRITEPORT, READIO, WRITEIO | Chris Lattner |
| 2005-05-09 | Fold shifts into subsequent SHL's. These shifts often arise due to addrses | Chris Lattner |
| 2005-05-09 | Don't use the load/store instruction as the source pointer, use the pointer | Chris Lattner |
| 2005-05-09 | memoize all nodes, even null Value* nodes. Do not add two token chain outputs | Chris Lattner |
| 2005-05-09 | Print SrcValue nodes correctly | Chris Lattner |
| 2005-05-03 | Implement count leading zeros (ctlz), count trailing zeros (cttz), and count | Andrew Lenharth |
| 2005-04-28 | Add FSQRT, FSIN, FCOS nodes, patch contributed by Morten Ofstad | Chris Lattner |
| 2005-04-27 | Implement Value* tracking for loads and stores in the selection DAG. This en... | Andrew Lenharth |
| 2005-04-26 | Fold (X > -1) | (Y > -1) --> (X&Y > -1) | Chris Lattner |
| 2005-04-25 | implement some more logical compares with constants, so that: | Chris Lattner |
| 2005-04-25 | Codegen x < 0 | y < 0 as (x|y) < 0. This allows us to compile this to: | Chris Lattner |
| 2005-04-22 | Convert tabs to spaces | Misha Brukman |
| 2005-04-21 | Remove trailing whitespace | Misha Brukman |
| 2005-04-21 | Improve and elimination. On PPC, for: | Chris Lattner |
| 2005-04-21 | Fold (x & 8) != 0 and (x & 8) == 8 into (x & 8) >> 3. | Chris Lattner |
| 2005-04-18 | Fold setcc of MVT::i1 operands into logical operations | Chris Lattner |
| 2005-04-18 | Another minor simplification: handle setcc (zero_extend x), c -> setcc(x, c') | Chris Lattner |
| 2005-04-18 | Another simple xform | Chris Lattner |
| 2005-04-18 | Fold: | Chris Lattner |
| 2005-04-18 | Make the AND elimination operation recursive and significantly more powerful, | Chris Lattner |
| 2005-04-14 | Add a couple missing transforms in getSetCC that were triggering assertions | Nate Begeman |
| 2005-04-13 | Disbale the broken fold of shift + sz[ext] for now | Nate Begeman |
| 2005-04-13 | fix an infinite loop | Chris Lattner |
| 2005-04-13 | fix some serious miscompiles on ia64, alpha, and ppc | Chris Lattner |
| 2005-04-13 | avoid work when possible, perhaps fix the problem nate and andrew are seeing | Chris Lattner |
| 2005-04-13 | add back the optimization that Nate added for shl X, (zext_inreg y) | Chris Lattner |
| 2005-04-13 | Oops, remove these too. | Chris Lattner |
| 2005-04-13 | Remove all foldings of ZERO_EXTEND_INREG, moving them to work for AND nodes | Chris Lattner |
| 2005-04-12 | Fold shift x, [sz]ext(y) -> shift x, y | Nate Begeman |
| 2005-04-12 | Fold shift by size larger than type size to undef | Nate Begeman |
| 2005-04-12 | Remove some redundant checks, add a couple of new ones. This allows us to | Chris Lattner |
| 2005-04-12 | canonicalize x <u 1 -> x == 0. On this testcase: | Chris Lattner |
| 2005-04-10 | Don't bother sign/zext_inreg'ing the result of an and operation if we know | Chris Lattner |
| 2005-04-10 | Fold zext_inreg(zextload), likewise for sext's | Chris Lattner |
| 2005-04-10 | add a simple xform | Chris Lattner |
| 2005-04-10 | Fix a thinko. If the operand is promoted, pass the promoted value into | Chris Lattner |
| 2005-04-09 | add a little peephole optimization. This allows us to codegen: | Chris Lattner |
| 2005-04-09 | recognize some patterns as fabs operations, so that fabs at the source level | Chris Lattner |
| 2005-04-09 | print and fold BRCONDTWOWAY correctly | Chris Lattner |
| 2005-04-09 | canonicalize a bunch of operations involving fneg | Chris Lattner |
| 2005-04-07 | If a target zero or sign extends the result of its setcc, allow folding of | Chris Lattner |
| 2005-04-07 | Remove somethign I had for testing | Chris Lattner |
| 2005-04-07 | This patch does two things. First, it canonicalizes 'X >= C' -> 'X > C-1' | Chris Lattner |
| 2005-04-07 | Fix a really scary bug that Nate found where we weren't deleting the right | Chris Lattner |
| 2005-04-05 | Add MULHU and MULHS nodes for the high part of an (un)signed 32x32=64b | Nate Begeman |
