| Commit message (Expand) | Author | Age | Files | Lines |
| * | core changes for varargs | Andrew Lenharth | 2005-06-18 | 1 | -18/+12 |
| * | Fix bug 537 test 2, which checks to make sure that we fold A+(B-A) -> B for | Nate Begeman | 2005-06-16 | 1 | -2/+7 |
| * | Add some simplifications for MULH[SU]. This allows us to compile this: | Chris Lattner | 2005-05-15 | 1 | -0/+12 |
| * | Fix construction of ioport intrinsics, fixing X86/io.llx and io-port.llx | Chris Lattner | 2005-05-14 | 1 | -4/+10 |
| * | allow token chain at start or end of node | Chris Lattner | 2005-05-14 | 1 | -0/+2 |
| * | remove special case hacks for readport/readio from the binary operator | Chris Lattner | 2005-05-14 | 2 | -13/+15 |
| * | Implement fixme's by memoizing nodes. | Chris Lattner | 2005-05-14 | 1 | -9/+21 |
| * | Turn this into a wrapper for a simpler version of getNode. | Chris Lattner | 2005-05-14 | 1 | -8/+7 |
| * | Eliminate special purpose hacks for dynamic_stack_alloc. | Chris Lattner | 2005-05-14 | 3 | -20/+15 |
| * | Use the general mechanism for creating multi-value nodes instead of using | Chris Lattner | 2005-05-14 | 2 | -56/+60 |
| * | Wrap long line, actually add node to the graph. | Chris Lattner | 2005-05-14 | 1 | -1/+3 |
| * | legalize target-specific operations | Chris Lattner | 2005-05-14 | 1 | -0/+23 |
| * | add a getNode() version that allows construction of any node type. | Chris Lattner | 2005-05-14 | 1 | -9/+33 |
| * | LowerOperation takes a dag | Chris Lattner | 2005-05-14 | 2 | -3/+3 |
| * | Allow targets to have a custom int64->fp expander if desired | Chris Lattner | 2005-05-14 | 1 | -0/+11 |
| * | Align doubles on 8-byte boundaries if possible. | Chris Lattner | 2005-05-13 | 1 | -0/+9 |
| * | Add an isTailCall flag to LowerCallTo | Chris Lattner | 2005-05-13 | 2 | -7/+11 |
| * | Handle TAILCALL node | Chris Lattner | 2005-05-13 | 2 | -3/+10 |
| * | Emit function entry code after lowering hte arguments. | Chris Lattner | 2005-05-13 | 1 | -2/+2 |
| * | Allow targets to emit code into the entry block of each function | Chris Lattner | 2005-05-13 | 1 | -0/+2 |
| * | Fix a problem that nate reduced for me. | Chris Lattner | 2005-05-13 | 1 | -1/+2 |
| * | rename variables and functions to match renamed DAG nodes. Bonus feature: | Chris Lattner | 2005-05-13 | 1 | -32/+32 |
| * | do not call expandop on the same value more than once. This fixes | Chris Lattner | 2005-05-13 | 1 | -4/+5 |
| * | fix a bad typeo | Chris Lattner | 2005-05-12 | 1 | -2/+2 |
| * | update comment | Chris Lattner | 2005-05-12 | 1 | -1/+1 |
| * | rename the ADJCALLSTACKDOWN/ADJCALLSTACKUP nodes to be CALLSEQ_START/BEGIN. | Chris Lattner | 2005-05-12 | 2 | -22/+22 |
| * | Pass calling convention to use into lower call to | Chris Lattner | 2005-05-12 | 2 | -7/+8 |
| * | fix expansion of ct[lt]z nodes | Chris Lattner | 2005-05-12 | 1 | -0/+2 |
| * | Expand 64-bit ctlz/cttz nodes for 32-bit targets | Chris Lattner | 2005-05-12 | 1 | -4/+28 |
| * | Fix uint->fp casts on PPC, allowing UnitTests/2005-05-12-Int64ToFP to | Chris Lattner | 2005-05-12 | 1 | -4/+3 |
| * | Allow something to be legalized multiple times. This can be used to reduce | Chris Lattner | 2005-05-12 | 1 | -12/+30 |
| * | Oops, don't do this after we figure out where to insert the call chains. | Chris Lattner | 2005-05-12 | 1 | -6/+6 |
| * | Make sure to expand all nodes, avoiding unintentional node duplication. | Chris Lattner | 2005-05-12 | 1 | -0/+7 |
| * | handle a common case generated by the uint64 -> FP code path better | Chris Lattner | 2005-05-12 | 1 | -1/+17 |
| * | add fixme | Chris Lattner | 2005-05-12 | 1 | -0/+1 |
| * | Fix a problem where early legalization can cause token chain problems. | Chris Lattner | 2005-05-12 | 1 | -7/+8 |
| * | Make legalize a bit more efficient, and canonicalize sub X, C -> add X, -C | Chris Lattner | 2005-05-12 | 2 | -8/+12 |
| * | Necessary changes to codegen cttz efficiently on PowerPC | Nate Begeman | 2005-05-11 | 1 | -3/+13 |
| * | Fix the last remaining bug preventing us from switching the X86 BE over | Chris Lattner | 2005-05-11 | 1 | -30/+68 |
| * | Do not memoize ADJCALLSTACKDOWN nodes, provide a method to hack on them. | Chris Lattner | 2005-05-11 | 1 | -3/+24 |
| * | wrap long line | Chris Lattner | 2005-05-11 | 1 | -1/+2 |
| * | Make sure to legalize generated ctpop nodes, convert tabs to spaces | Chris Lattner | 2005-05-11 | 1 | -18/+18 |
| * | expand count-leading/trailing-zeros; the test 2005-05-11-Popcount-ffs-fls.c | Duraid Madina | 2005-05-11 | 1 | -19/+32 |
| * | Add some notes for expanding clz/ctz | Chris Lattner | 2005-05-11 | 1 | -4/+21 |
| * | Simplify this code, use the proper shift amount | Chris Lattner | 2005-05-11 | 1 | -11/+10 |
| * | Legalize this correctly | Chris Lattner | 2005-05-11 | 1 | -1/+3 |
| * | implement expansion of ctpop nodes, implementing CodeGen/Generic/llvm-ct-intr... | Chris Lattner | 2005-05-11 | 1 | -5/+16 |
| * | Print bit count nodes correctly | Chris Lattner | 2005-05-11 | 1 | -0/+6 |
| * | Silence some VC++ warnings | Jeff Cohen | 2005-05-10 | 1 | -2/+2 |
| * | The semantics of cast X to bool are a comparison against zero, not a truncation! | Chris Lattner | 2005-05-09 | 1 | -0/+5 |