| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | If we have an add, do it in the pointer realm, not the int realm. This is ↵ | Andrew Lenharth | 2006-09-19 | 1 | -0/+22 |
| | | | | | | | critical in the linux kernel for pointer analysis correctness llvm-svn: 30496 | ||||
| * | Inspired by the linux kernel, the more we keep adds in the pointer realm, ↵ | Andrew Lenharth | 2006-09-19 | 1 | -0/+15 |
| | | | | | | | the better pointer analysis works. llvm-svn: 30495 | ||||
| * | Fix UnitTests/2005-05-12-Int64ToFP.c with llc-beta. In particular, do not | Chris Lattner | 2006-09-19 | 1 | -7/+10 |
| | | | | | | | allow it to go into an infinite loop, filling up the disk! llvm-svn: 30494 | ||||
| * | fix header | Rafael Espindola | 2006-09-19 | 1 | -18/+21 |
| | | | | | | | | add comments untabify llvm-svn: 30486 | ||||
| * | Implement a MachineFunctionPass to fix the mul instruction | Rafael Espindola | 2006-09-19 | 5 | -1/+89 |
| | | | | | llvm-svn: 30485 | ||||
| * | number test right | Chris Lattner | 2006-09-19 | 1 | -1/+1 |
| | | | | | llvm-svn: 30484 | ||||
| * | item done | Chris Lattner | 2006-09-19 | 1 | -11/+0 |
| | | | | | llvm-svn: 30483 | ||||
| * | implement select.ll:test19-22 | Chris Lattner | 2006-09-19 | 1 | -6/+43 |
| | | | | | llvm-svn: 30482 | ||||
| * | make this harder | Chris Lattner | 2006-09-19 | 1 | -2/+14 |
| | | | | | llvm-svn: 30481 | ||||
| * | new testcases | Chris Lattner | 2006-09-19 | 1 | -1/+14 |
| | | | | | llvm-svn: 30480 | ||||
| * | Fold the PPCISD shifts when presented with 0 inputs. This occurs for code | Chris Lattner | 2006-09-19 | 1 | -0/+20 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | like: long long test(long long X, int Y) { return 1ULL << Y; } long long test2(long long X, int Y) { return -1LL << Y; } which we used to compile to: _test: li r2, 1 subfic r3, r5, 32 li r4, 0 addi r6, r5, -32 srw r3, r2, r3 slw r4, r4, r5 slw r6, r2, r6 or r3, r4, r3 slw r4, r2, r5 or r3, r3, r6 blr _test2: li r2, -1 subfic r3, r5, 32 addi r6, r5, -32 srw r3, r2, r3 slw r4, r2, r5 slw r2, r2, r6 or r3, r4, r3 or r3, r3, r2 blr Now we produce: _test: li r2, 1 addi r3, r5, -32 subfic r4, r5, 32 slw r3, r2, r3 srw r4, r2, r4 or r3, r4, r3 slw r4, r2, r5 blr _test2: li r2, -1 subfic r3, r5, 32 addi r6, r5, -32 srw r3, r2, r3 slw r4, r2, r5 slw r2, r2, r6 or r3, r4, r3 or r3, r3, r2 blr llvm-svn: 30479 | ||||
| * | Fold extract_element(cst) to cst | Chris Lattner | 2006-09-19 | 1 | -2/+8 |
| | | | | | llvm-svn: 30478 | ||||
| * | Minor speedup for legalize by avoiding some malloc traffic | Chris Lattner | 2006-09-19 | 1 | -0/+9 |
| | | | | | llvm-svn: 30477 | ||||
| * | If multiple predicates are listed, they must all pass | Chris Lattner | 2006-09-19 | 1 | -1/+1 |
| | | | | | llvm-svn: 30476 | ||||
| * | Enable dejagnu tests for predicate simplifier. | Nick Lewycky | 2006-09-19 | 1 | -0/+3 |
| | | | | | llvm-svn: 30475 | ||||
| * | Fix a typo. | Evan Cheng | 2006-09-18 | 1 | -3/+2 |
| | | | | | llvm-svn: 30474 | ||||
| * | There! | Chris Lattner | 2006-09-18 | 1 | -2/+0 |
| | | | | | llvm-svn: 30473 | ||||
| * | Fix Regression/TableGen/2006-09-18-LargeInt.td | Chris Lattner | 2006-09-18 | 4 | -6/+8 |
| | | | | | llvm-svn: 30472 | ||||
| * | new testcase | Chris Lattner | 2006-09-18 | 1 | -0/+5 |
| | | | | | llvm-svn: 30471 | ||||
| * | Allow i32 UDIV, SDIV, UREM, SREM to be expanded into libcalls. | Evan Cheng | 2006-09-18 | 1 | -6/+30 |
| | | | | | llvm-svn: 30470 | ||||
| * | Walk down the dominator tree instead of the control flow graph. That means | Nick Lewycky | 2006-09-18 | 1 | -150/+90 |
| | | | | | | | | that we can't modify the CFG any more, at least not until it's possible to update the dominator tree (PR217). llvm-svn: 30469 | ||||
| * | Fix findCaseDest to return null when BB is both the default dest and one | Nick Lewycky | 2006-09-18 | 1 | -0/+2 |
| | | | | | | | of the numeric cases. llvm-svn: 30468 | ||||
| * | A pass to remove the worst of the replay trap offenders, and as a bonus, ↵ | Andrew Lenharth | 2006-09-18 | 3 | -0/+146 |
| | | | | | | | align basic blocks when it is free to do so llvm-svn: 30467 | ||||
| * | Add a new helper method to SwitchInst. Useful when you've got a BB from | Nick Lewycky | 2006-09-18 | 1 | -0/+13 |
| | | | | | | | | somewhere (like the dominator graph) and would like to know which case it came from. llvm-svn: 30466 | ||||
| * | Fix an infinite loop building the CFE | Chris Lattner | 2006-09-18 | 1 | -1/+2 |
| | | | | | llvm-svn: 30465 | ||||
| * | new testcase | Chris Lattner | 2006-09-18 | 1 | -0/+13 |
| | | | | | llvm-svn: 30464 | ||||
| * | Jump tables on Alpha | Andrew Lenharth | 2006-09-18 | 3 | -2/+38 |
| | | | | | llvm-svn: 30463 | ||||
| * | oops | Andrew Lenharth | 2006-09-18 | 1 | -1/+0 |
| | | | | | llvm-svn: 30462 | ||||
| * | absolute addresses must match pointer size | Andrew Lenharth | 2006-09-18 | 2 | -1/+2 |
| | | | | | llvm-svn: 30461 | ||||
| * | Sort out mangled names for globals | Jim Laskey | 2006-09-18 | 2 | -13/+26 |
| | | | | | llvm-svn: 30460 | ||||
| * | Implement a trivial optzn: of vastart is never called in a function that takes | Chris Lattner | 2006-09-18 | 1 | -2/+113 |
| | | | | | | | | | ... args, remove the '...'. This is Transforms/DeadArgElim/dead_vaargs.ll llvm-svn: 30459 | ||||
| * | new testcase | Chris Lattner | 2006-09-18 | 1 | -0/+13 |
| | | | | | llvm-svn: 30458 | ||||
| * | add a note. Our 64-bit shifts are ~30% slower than gcc's | Chris Lattner | 2006-09-18 | 1 | -1/+2 |
| | | | | | llvm-svn: 30457 | ||||
| * | Implement InstCombine/cast.ll:test31. This speeds up 462.libquantum by 26%. | Chris Lattner | 2006-09-18 | 1 | -4/+39 |
| | | | | | llvm-svn: 30456 | ||||
| * | new testcase | Chris Lattner | 2006-09-18 | 1 | -1/+6 |
| | | | | | llvm-svn: 30455 | ||||
| * | Add support for pattern matching cast operations | Chris Lattner | 2006-09-18 | 1 | -0/+33 |
| | | | | | llvm-svn: 30454 | ||||
| * | fix typo | Chris Lattner | 2006-09-18 | 1 | -1/+1 |
| | | | | | llvm-svn: 30453 | ||||
| * | add a helper method | Chris Lattner | 2006-09-18 | 2 | -0/+21 |
| | | | | | llvm-svn: 30452 | ||||
| * | This is closer to what we really want. | Chris Lattner | 2006-09-18 | 1 | -2/+3 |
| | | | | | llvm-svn: 30451 | ||||
| * | Implement Transforms/InstCombine/shift-sra.ll:test0 | Chris Lattner | 2006-09-18 | 1 | -0/+20 |
| | | | | | llvm-svn: 30450 | ||||
| * | New testcase, can be an srl instead of sra | Chris Lattner | 2006-09-18 | 1 | -0/+8 |
| | | | | | llvm-svn: 30449 | ||||
| * | Rewrite shift/and/compare sequences to promote better licm of the RHS. | Chris Lattner | 2006-09-18 | 1 | -28/+48 |
| | | | | | | | Use isLogicalShift/isArithmeticShift to simplify code. llvm-svn: 30448 | ||||
| * | Make the LLVM Publications link point to /pubs/ since this has moved to | Reid Spencer | 2006-09-17 | 1 | -1/+1 |
| | | | | | | | its own page on the LLVM web site. llvm-svn: 30447 | ||||
| * | Added some eye-candy for Subtarget type checking | Anton Korobeynikov | 2006-09-17 | 17 | -1622/+1765 |
| | | | | | | | Added X86 StdCall & FastCall calling conventions. Codegen will follow. llvm-svn: 30446 | ||||
| * | Add ShiftInst::isLogical/ArithmeticShift methods. | Chris Lattner | 2006-09-17 | 3 | -7/+28 |
| | | | | | llvm-svn: 30445 | ||||
| * | Add new SetCondInst::isRelational/isEquality methods. Rename | Chris Lattner | 2006-09-17 | 5 | -9/+20 |
| | | | | | | | Instruction::isRelational to Instruction::isComparison. llvm-svn: 30444 | ||||
| * | Explain change with a comment. | Nick Lewycky | 2006-09-17 | 1 | -2/+2 |
| | | | | | llvm-svn: 30443 | ||||
| * | Fix PR912. The input to erase() must not be a reference to the data | Nick Lewycky | 2006-09-17 | 1 | -1/+2 |
| | | | | | | | being erased. llvm-svn: 30442 | ||||
| * | Small fixes for supporting dll* linkage types | Anton Korobeynikov | 2006-09-17 | 5 | -112/+110 |
| | | | | | llvm-svn: 30441 | ||||
| * | add a note noticed through source inspection | Chris Lattner | 2006-09-16 | 1 | -3/+30 |
| | | | | | llvm-svn: 30418 | ||||

