| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | INC64_32r -> LEA64_32r is better than INC64_32r -> LEA32r, but it still can | Evan Cheng | 2007-10-05 | 1 | -8/+4 |
| | | | | | | | cause performance degradation. llvm-svn: 42653 | ||||
| * | In 64-bit mode, avoid using leal with 32-bit 32-bit address size, e.g. | Evan Cheng | 2007-10-05 | 1 | -89/+98 |
| | | | | | | | leal 1(%ecx), %edi, which requires 67H prefix. llvm-svn: 42647 | ||||
| * | First round of ppc long double. call/return and | Dale Johannesen | 2007-10-05 | 7 | -42/+240 |
| | | | | | | | | | | basic arithmetic works. Rename RTLIB long double functions to distinguish different flavors of long double; the lib functions have different names, alas. llvm-svn: 42644 | ||||
| * | Add support to convert more 64-bit instructions to 3-address instructions. | Evan Cheng | 2007-10-05 | 2 | -8/+26 |
| | | | | | llvm-svn: 42642 | ||||
| * | ADC and SBB uses EFLAGS. | Evan Cheng | 2007-10-05 | 2 | -0/+8 |
| | | | | | llvm-svn: 42640 | ||||
| * | Mark count method const. | Chris Lattner | 2007-10-05 | 1 | -1/+1 |
| | | | | | llvm-svn: 42639 | ||||
| * | Change a few more spaces to tabs in assembly output. | Dan Gohman | 2007-10-05 | 1 | -3/+3 |
| | | | | | llvm-svn: 42638 | ||||
| * | Change a space to a tab in the assembly output of a .globl directive | Dan Gohman | 2007-10-05 | 1 | -1/+1 |
| | | | | | | | for consistency. llvm-svn: 42637 | ||||
| * | Legalize support for MUL_LOHI and DIVREM. | Dan Gohman | 2007-10-05 | 1 | -0/+10 |
| | | | | | llvm-svn: 42636 | ||||
| * | Fix a typo in a comment. | Dan Gohman | 2007-10-05 | 1 | -1/+1 |
| | | | | | llvm-svn: 42635 | ||||
| * | Provide names for MUL_LOHI and DIVREM operators. | Dan Gohman | 2007-10-05 | 1 | -0/+4 |
| | | | | | llvm-svn: 42634 | ||||
| * | SMUL_LOHI and UMUL_LOHI are commutative. | Dan Gohman | 2007-10-05 | 1 | -0/+2 |
| | | | | | llvm-svn: 42633 | ||||
| * | Define target-indepenent SDNode types for multiply and divide that | Dan Gohman | 2007-10-05 | 1 | -0/+9 |
| | | | | | | | produce two results. llvm-svn: 42632 | ||||
| * | Fix typo in comment. | Duncan Sands | 2007-10-05 | 1 | -1/+1 |
| | | | | | llvm-svn: 42631 | ||||
| * | Testing convertToThreeeAddress as X86 llcbeta. | Evan Cheng | 2007-10-05 | 1 | -5/+24 |
| | | | | | llvm-svn: 42630 | ||||
| * | Fix intersectWithComplement bug noticed by Curtis Dunham | Daniel Berlin | 2007-10-05 | 1 | -4/+2 |
| | | | | | | | Optimize |= case for empty RHS llvm-svn: 42629 | ||||
| * | New test case. | Evan Cheng | 2007-10-05 | 1 | -0/+20 |
| | | | | | llvm-svn: 42628 | ||||
| * | Chain producing nodes cannot be moved, not chain reading nodes. | Evan Cheng | 2007-10-05 | 1 | -5/+7 |
| | | | | | llvm-svn: 42627 | ||||
| * | Oops. Didn't mean to leave this in. | Evan Cheng | 2007-10-05 | 1 | -1/+0 |
| | | | | | llvm-svn: 42626 | ||||
| * | If a node that defines a physical register that is expensive to copy. The | Evan Cheng | 2007-10-05 | 3 | -48/+170 |
| | | | | | | | | | | scheduler will try a number of tricks in order to avoid generating the copies. This may not be possible in case the node produces a chain value that prevent movement. Try unfolding the load from the node before to allow it to be moved / cloned. llvm-svn: 42625 | ||||
| * | Added storeRegToAddr, loadRegFromAddr, and unfoldMemoryOperand's. | Evan Cheng | 2007-10-05 | 2 | -114/+331 |
| | | | | | llvm-svn: 42624 | ||||
| * | Not needed any more. | Evan Cheng | 2007-10-05 | 1 | -1/+0 |
| | | | | | llvm-svn: 42623 | ||||
| * | Forgot these. | Evan Cheng | 2007-10-05 | 2 | -0/+72 |
| | | | | | llvm-svn: 42622 | ||||
| * | - Added a few target hooks to generate load / store instructions from / to any | Evan Cheng | 2007-10-05 | 11 | -68/+488 |
| | | | | | | | | | address (not just from / to frameindexes). - Added target hooks to unfold load / store instructions / SDNodes into separate load, data processing, store instructions / SDNodes. llvm-svn: 42621 | ||||
| * | Add a variant of getTargetNode() that takes a vector of MVT::ValueType. | Evan Cheng | 2007-10-05 | 2 | -0/+9 |
| | | | | | llvm-svn: 42620 | ||||
| * | Silence a warning. | Evan Cheng | 2007-10-05 | 1 | -1/+1 |
| | | | | | llvm-svn: 42619 | ||||
| * | Fix the previous bug a slightly different way (by modifying how find_next works) | Daniel Berlin | 2007-10-04 | 1 | -9/+8 |
| | | | | | llvm-svn: 42613 | ||||
| * | Fix off by one error in iterator | Daniel Berlin | 2007-10-04 | 1 | -1/+1 |
| | | | | | llvm-svn: 42612 | ||||
| * | Support Objective C++ too. | Bill Wendling | 2007-10-04 | 1 | -0/+1 |
| | | | | | llvm-svn: 42610 | ||||
| * | Added testcase for creation of metadata with null pointers. | Bill Wendling | 2007-10-04 | 1 | -0/+7 |
| | | | | | llvm-svn: 42609 | ||||
| * | add a note. | Chris Lattner | 2007-10-04 | 1 | -0/+40 |
| | | | | | llvm-svn: 42607 | ||||
| * | un-XFAIL this test. | Bill Wendling | 2007-10-04 | 1 | -2/+0 |
| | | | | | llvm-svn: 42606 | ||||
| * | It helps a lot when you check for the end of your list before randomly | Daniel Berlin | 2007-10-04 | 1 | -1/+2 |
| | | | | | | | dereferencing things. llvm-svn: 42605 | ||||
| * | Make SparseBitVector::set actually work properly when sets are not in ↵ | Daniel Berlin | 2007-10-04 | 1 | -4/+10 |
| | | | | | | | ascending or descending order. llvm-svn: 42604 | ||||
| * | Do use the actual ocaml stdlib (not the install dir) to find the | Gordon Henriksen | 2007-10-04 | 1 | -3/+2 |
| | | | | | | | caml/*.h headers. llvm-svn: 42599 | ||||
| * | Add APFloat -> hexadecimal string conversion, as per %a and %A in C99. | Neil Booth | 2007-10-03 | 2 | -16/+267 |
| | | | | | | | Useful for diagnostics and debugging. llvm-svn: 42598 | ||||
| * | Completely merge the implementation details of DomTree and PostDomTree. | Owen Anderson | 2007-10-03 | 7 | -214/+97 |
| | | | | | | | Also, add a FIXME for a bug in PostDomTree calculation I noticed while writing this, llvm-svn: 42593 | ||||
| * | Add a GraphTraits partial specialization to make the inverse of an inverse ↵ | Owen Anderson | 2007-10-03 | 1 | -0/+20 |
| | | | | | | | be the same as the underlying graph. llvm-svn: 42592 | ||||
| * | Fix 80 col violation. | Devang Patel | 2007-10-03 | 1 | -3/+3 |
| | | | | | llvm-svn: 42591 | ||||
| * | Refactor code in a separate method. | Devang Patel | 2007-10-03 | 1 | -33/+46 |
| | | | | | llvm-svn: 42590 | ||||
| * | Add initial iterator support for folding set. | Chris Lattner | 2007-10-03 | 2 | -0/+83 |
| | | | | | llvm-svn: 42589 | ||||
| * | Clarify that shifts that are too large are undefined. | Chris Lattner | 2007-10-03 | 1 | -3/+19 |
| | | | | | llvm-svn: 42588 | ||||
| * | Simplify implementation of the FoldingSet circular list, a necessary step | Chris Lattner | 2007-10-03 | 1 | -11/+20 |
| | | | | | | | to giving it iterators. llvm-svn: 42586 | ||||
| * | Use empty() member functions when that's what's being tested for instead | Dan Gohman | 2007-10-03 | 17 | -38/+36 |
| | | | | | | | of comparing begin() and end(). llvm-svn: 42585 | ||||
| * | Fix a using namespace llvm; in a header file. | Dan Gohman | 2007-10-03 | 2 | -3/+3 |
| | | | | | llvm-svn: 42584 | ||||
| * | Temporarily XFAIL this test. | Bill Wendling | 2007-10-03 | 1 | -0/+2 |
| | | | | | llvm-svn: 42583 | ||||
| * | Tone down an overzealous optimization. | Dale Johannesen | 2007-10-03 | 1 | -3/+21 |
| | | | | | llvm-svn: 42582 | ||||
| * | remove extraneous tag | Chris Lattner | 2007-10-03 | 1 | -1/+1 |
| | | | | | llvm-svn: 42581 | ||||
| * | remove misleading documentation: LLVM has no atomic support yet. | Chris Lattner | 2007-10-03 | 1 | -302/+1 |
| | | | | | llvm-svn: 42580 | ||||
| * | add a note | Chris Lattner | 2007-10-03 | 1 | -0/+32 |
| | | | | | llvm-svn: 42579 | ||||

