| Age | Commit message (Expand) | Author |
|---|
| 2005-08-02 | Update to use the new MathExtras.h support for log2 computation. | Chris Lattner |
| 2005-07-27 | Eliminate all remaining tabs and trailing spaces. | Jeff Cohen |
| 2005-07-10 | Change *EXTLOAD to use an VTSDNode operand instead of being an MVTSDNode. | Chris Lattner |
| 2005-07-10 | Change TRUNCSTORE to use a VTSDNode operand instead of being an MVTSTDNode | Chris Lattner |
| 2005-07-10 | Introduce a new VTSDNode class with the ultimate goal of eliminating the | Chris Lattner |
| 2005-06-29 | restore old srcValueNode behavior and try to to work around it | Andrew Lenharth |
| 2005-06-29 | tracking the instructions causing loads and stores provides more information ... | Andrew Lenharth |
| 2005-06-16 | Fix bug 537 test 2, which checks to make sure that we fold A+(B-A) -> B for | Nate Begeman |
| 2005-05-15 | Add some simplifications for MULH[SU]. This allows us to compile this: | Chris Lattner |
| 2005-05-14 | remove special case hacks for readport/readio from the binary operator | Chris Lattner |
| 2005-05-14 | Implement fixme's by memoizing nodes. | Chris Lattner |
| 2005-05-14 | Turn this into a wrapper for a simpler version of getNode. | Chris Lattner |
| 2005-05-14 | Eliminate special purpose hacks for dynamic_stack_alloc. | Chris Lattner |
| 2005-05-14 | Use the general mechanism for creating multi-value nodes instead of using | Chris Lattner |
| 2005-05-14 | Wrap long line, actually add node to the graph. | Chris Lattner |
| 2005-05-14 | add a getNode() version that allows construction of any node type. | Chris Lattner |
| 2005-05-13 | Handle TAILCALL node | Chris Lattner |
| 2005-05-12 | fix a bad typeo | Chris Lattner |
| 2005-05-12 | rename the ADJCALLSTACKDOWN/ADJCALLSTACKUP nodes to be CALLSEQ_START/BEGIN. | Chris Lattner |
| 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 |
