| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Add support to tablegen for naming the nodes themselves, not just the operands, | Nate Begeman | 2009-03-19 | 1 | -1/+1 |
| * | silence warning when asserts disabled. | Chris Lattner | 2008-12-14 | 1 | -1/+1 |
| * | Add a sanity-check to tablegen to catch the case where isSimpleLoad | Dan Gohman | 2008-12-03 | 1 | -2/+6 |
| * | This shouldn't be necessary | Andrew Lenharth | 2008-11-11 | 1 | -1/+2 |
| * | Change CALLSEQ_BEGIN and CALLSEQ_END to take TargetConstant's as | Chris Lattner | 2008-10-11 | 1 | -2/+2 |
| * | Rename ConstantSDNode::getValue to getZExtValue, for consistency | Dan Gohman | 2008-09-12 | 1 | -32/+39 |
| * | Tablegen generated code already tests the opcode value, so it's not | Dan Gohman | 2008-08-20 | 1 | -5/+3 |
| * | Rename SDOperand to SDValue. | Dan Gohman | 2008-07-27 | 1 | -1/+1 |
| * | Added MemOperands to Atomic operations since Atomics touches memory. | Mon P Wang | 2008-06-25 | 1 | -4/+4 |
| * | Replace all target specific implicit def instructions with a target independe... | Evan Cheng | 2008-03-15 | 1 | -9/+0 |
| * | Final de-tabification. | Bill Wendling | 2008-02-27 | 1 | -18/+18 |
| * | Atomic op support. If any gcc test uses __sync builtins, it might start fail... | Andrew Lenharth | 2008-02-21 | 1 | -5/+29 |
| * | llvm.memory.barrier, and impl for x86 and alpha | Andrew Lenharth | 2008-02-16 | 1 | -1/+8 |
| * | rename SDTRet -> SDTNone. | Chris Lattner | 2008-01-15 | 1 | -1/+1 |
| * | get def use info more correct. | Chris Lattner | 2008-01-10 | 1 | -1/+1 |
| * | rename isLoad -> isSimpleLoad due to evan's desire to have such a predicate. | Chris Lattner | 2008-01-06 | 1 | -1/+1 |
| * | Change the 'isStore' inferrer to look for 'SDNPMayStore' | Chris Lattner | 2008-01-06 | 1 | -31/+31 |
| * | Remove attribution from file headers, per discussion on llvmdev. | Chris Lattner | 2007-12-29 | 1 | -2/+2 |
| * | Implicit def instructions, e.g. X86::IMPLICIT_DEF_GR32, are always re-materia... | Evan Cheng | 2007-12-12 | 1 | -0/+2 |
| * | something wrong with this opt | Andrew Lenharth | 2007-11-27 | 1 | -12/+14 |
| * | Unifacalize the CALLSEQ{START,END} stuff. | Bill Wendling | 2007-11-13 | 1 | -5/+5 |
| * | Unify CALLSEQ_{START,END}. They take 4 parameters: the chain, two stack | Bill Wendling | 2007-11-13 | 1 | -7/+13 |
| * | Add a flag for indirect branch instructions. | Owen Anderson | 2007-11-12 | 1 | -2/+1 |
| * | Remove (somewhat confusing) Imp<> helper, use let Defs = [], Uses = [] instead. | Evan Cheng | 2007-09-11 | 1 | -3/+3 |
| * | No more noResults. | Evan Cheng | 2007-07-21 | 1 | -6/+6 |
| * | Change instruction description to split OperandList into OutOperandList and | Evan Cheng | 2007-07-19 | 1 | -31/+39 |
| * | Use this nifty Constraints thing and fix the inverted conditional moves | Andrew Lenharth | 2007-04-17 | 1 | -10/+10 |
| * | FTOIT and ITOFT are bit converts, and if we drop 21264s, are always available | Andrew Lenharth | 2007-01-24 | 1 | -4/+2 |
| * | Be sure to grab weak functions too, and make implicit defs comments | Andrew Lenharth | 2006-12-07 | 1 | -3/+3 |
| * | silence warnings. | Chris Lattner | 2006-11-03 | 1 | -0/+1 |
| * | fix 2006-11-01-vastart.ll | Andrew Lenharth | 2006-11-02 | 1 | -2/+4 |
| * | more shotenning | Andrew Lenharth | 2006-10-31 | 1 | -113/+75 |
| * | Let us play simplify the td file (and fix a few missed sub and mul patterns). | Andrew Lenharth | 2006-10-31 | 1 | -83/+55 |
| * | Add all that branch mangling niftiness | Andrew Lenharth | 2006-10-31 | 1 | -105/+158 |
| * | Merge ISD::TRUNCSTORE to ISD::STORE. Switch to using StoreSDNode. | Evan Cheng | 2006-10-13 | 1 | -9/+9 |
| * | adjcallstack up/down clobbers the sp | Chris Lattner | 2006-10-12 | 1 | -2/+2 |
| * | Use cute tblgen tricks to make zap handling more powerful. Specifically, | Chris Lattner | 2006-10-11 | 1 | -8/+18 |
| * | Remove dead/redundant instructions. These are handled by ZAPNOTi | Chris Lattner | 2006-10-11 | 1 | -6/+1 |
| * | Reflects ISD::LOAD / ISD::LOADX / LoadSDNode changes. | Evan Cheng | 2006-10-09 | 1 | -18/+18 |
| * | catch constants more often | Andrew Lenharth | 2006-09-20 | 1 | -0/+14 |
| * | Jump tables on Alpha | Andrew Lenharth | 2006-09-18 | 1 | -1/+11 |
| * | CALLSEQ_* produces chain even if that's not needed. | Evan Cheng | 2006-08-11 | 1 | -2/+4 |
| * | Remove a duplicate pattern/ | Evan Cheng | 2006-07-31 | 1 | -3/+0 |
| * | Let the alpha breakage begin. First Formals and RET. next Calls | Andrew Lenharth | 2006-06-12 | 1 | -1/+6 |
| * | ignore ordered/unordered for now | Andrew Lenharth | 2006-06-04 | 1 | -0/+120 |
| * | support x * (c1 + c2) where c1 and c2 are pow2s. special case for c2 == 4 | Andrew Lenharth | 2006-04-03 | 1 | -9/+31 |
| * | mul by const conversion sequences. more coming soon | Andrew Lenharth | 2006-04-03 | 1 | -1/+48 |
| * | fcopysign for mixed mode | Andrew Lenharth | 2006-03-09 | 1 | -1/+20 |
| * | alpha and llvm have different oppinions on which arg is the sign bit | Andrew Lenharth | 2006-03-09 | 1 | -10/+8 |
| * | Alpha Scheduling classes | Andrew Lenharth | 2006-03-09 | 1 | -191/+191 |
