| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | Change this code ot pass register classes into the stack slot spiller/reloader | Chris Lattner | 2005-09-30 | 4 | -11/+19 | |
| | | | | | | | | code. PrologEpilogInserter hasn't been updated yet though, so targets cannot use this info. llvm-svn: 23536 | |||||
| * | Change these methods to take RC's | Chris Lattner | 2005-09-30 | 1 | -2/+4 | |
| | | | | | llvm-svn: 23535 | |||||
| * | Use the 32-bit version for now | Chris Lattner | 2005-09-30 | 1 | -1/+1 | |
| | | | | | llvm-svn: 23534 | |||||
| * | Add a bunch of patterns for F64 FP ops, add some more integer ops | Chris Lattner | 2005-09-29 | 2 | -38/+84 | |
| | | | | | llvm-svn: 23533 | |||||
| * | Remove code for patterns that are autogenerated | Chris Lattner | 2005-09-29 | 1 | -30/+9 | |
| | | | | | llvm-svn: 23532 | |||||
| * | begining alpha subtarget support | Andrew Lenharth | 2005-09-29 | 7 | -19/+86 | |
| | | | | | llvm-svn: 23531 | |||||
| * | tblgen autogens this pattern now | Chris Lattner | 2005-09-29 | 1 | -6/+0 | |
| | | | | | llvm-svn: 23530 | |||||
| * | Teach tablegen to reassociate operators when possible. This allows it to | Chris Lattner | 2005-09-29 | 1 | -10/+96 | |
| | | | | | | | find all of teh pattern matches for EQV from one definition llvm-svn: 23529 | |||||
| * | copy and paste error | Andrew Lenharth | 2005-09-29 | 1 | -1/+1 | |
| | | | | | llvm-svn: 23528 | |||||
| * | now that tblgen is smarter, this pattern is not needed. Also, tblgen | Chris Lattner | 2005-09-29 | 1 | -3/+1 | |
| | | | | | | | now inverts commuted versions of ANDC/ORC with the current .td file. llvm-svn: 23527 | |||||
| * | Teach tblgen to build permutations of instructions, so that the target author | Chris Lattner | 2005-09-29 | 2 | -6/+193 | |
| | | | | | | | | | | | | doesn't have to specify them manually. It currently handles associativity, e.g. knowing that (X*Y)+Z also matches X+(Y*Z) and will be extended in the future. It is smart enough to not introduce duplicate patterns or patterns that can never match. llvm-svn: 23526 | |||||
| * | Insert stores after phi nodes in the normal dest. This fixes | Chris Lattner | 2005-09-29 | 1 | -2/+5 | |
| | | | | | | | LowerInvoke/2005-08-03-InvokeWithPHI.ll llvm-svn: 23525 | |||||
| * | consistency with other cases, no functionality change | Chris Lattner | 2005-09-29 | 1 | -0/+2 | |
| | | | | | llvm-svn: 23524 | |||||
| * | Make the JIT default to the DAG isel instead of the pattern isel, like LLC. | Chris Lattner | 2005-09-29 | 1 | -1/+4 | |
| | | | | | | | | | | The Pattern isel has some strange memory corruption issues going on. :( This should have been converted over anyway, but it got forgotten somehow when switching to the dag isel. llvm-svn: 23523 | |||||
| * | Fix two bugs in my patch earlier today that broke int->fp conversion on X86. | Chris Lattner | 2005-09-29 | 1 | -2/+2 | |
| | | | | | llvm-svn: 23522 | |||||
| * | Fold isascii into a simple comparison. This speeds up 197.parser by 7.4%, | Chris Lattner | 2005-09-29 | 1 | -0/+26 | |
| | | | | | | | bringing the LLC time down to the CBE time. llvm-svn: 23521 | |||||
| * | new testcase for isascii | Chris Lattner | 2005-09-29 | 1 | -2/+4 | |
| | | | | | llvm-svn: 23520 | |||||
| * | remove a bunch of unneeded stuff, or self evident comments | Chris Lattner | 2005-09-29 | 1 | -45/+6 | |
| | | | | | llvm-svn: 23519 | |||||
| * | add a new testcase | Chris Lattner | 2005-09-29 | 1 | -0/+23 | |
| | | | | | llvm-svn: 23518 | |||||
| * | Implement a couple of memcmp folds from the todo list | Chris Lattner | 2005-09-29 | 1 | -3/+121 | |
| | | | | | llvm-svn: 23517 | |||||
| * | Silence VC++ redeclaration warnings. | Jeff Cohen | 2005-09-29 | 1 | -4/+6 | |
| | | | | | llvm-svn: 23516 | |||||
| * | Never rely on ReplaceAllUsesWith when selecting, use CodeGenMap instead. | Chris Lattner | 2005-09-29 | 1 | -34/+29 | |
| | | | | | | | | ReplaceAllUsesWith does not replace scalars SDOperand floating around on the stack, permitting things to be selected multiple times. llvm-svn: 23515 | |||||
| * | Codegen ADD X, IMM -> addis/addi if needed. | Chris Lattner | 2005-09-28 | 1 | -2/+12 | |
| | | | | | | | This implements PowerPC/fold-li.ll llvm-svn: 23514 | |||||
| * | add a testcase for a feature we regressed on because noone wrote the test! :( | Chris Lattner | 2005-09-28 | 1 | -0/+14 | |
| | | | | | llvm-svn: 23513 | |||||
| * | Autogen MUL, move FP cases together | Chris Lattner | 2005-09-28 | 1 | -24/+12 | |
| | | | | | llvm-svn: 23512 | |||||
| * | disentangle FP from INT versions of div/mul | Chris Lattner | 2005-09-28 | 1 | -18/+16 | |
| | | | | | llvm-svn: 23511 | |||||
| * | Use the autogenerated matcher for ADD/SUB | Chris Lattner | 2005-09-28 | 1 | -30/+0 | |
| | | | | | llvm-svn: 23510 | |||||
| * | add a patter for SUBFIC | Chris Lattner | 2005-09-28 | 1 | -1/+1 | |
| | | | | | llvm-svn: 23509 | |||||
| * | Mark int binops as int-only, add FP binops. Mark FADD/FMUL as commutative but | Chris Lattner | 2005-09-28 | 1 | -15/+23 | |
| | | | | | | | not associative. Add [SU]REM. llvm-svn: 23508 | |||||
| * | wrap a long line | Chris Lattner | 2005-09-28 | 1 | -1/+2 | |
| | | | | | llvm-svn: 23507 | |||||
| * | Add FP versions of the binary operators, keeping the int and fp worlds seperate. | Chris Lattner | 2005-09-28 | 4 | -115/+124 | |
| | | | | | llvm-svn: 23506 | |||||
| * | Add FP versions of the binary operators, keeping the int and fp worlds seperate. | Chris Lattner | 2005-09-28 | 4 | -97/+108 | |
| | | | | | | | | | Though I have done extensive testing, it is possible that this will break things in configs I can't test. Please let me know if this causes a problem and I'll fix it ASAP. llvm-svn: 23505 | |||||
| * | Add FP versions of the binary operators, keeping the int and fp worlds seperate. | Chris Lattner | 2005-09-28 | 4 | -87/+209 | |
| | | | | | | | | | Though I have done extensive testing, it is possible that this will break things in configs I can't test. Please let me know if this causes a problem and I'll fix it ASAP. llvm-svn: 23504 | |||||
| * | Mark associative nodes as associative | Chris Lattner | 2005-09-28 | 1 | -6/+12 | |
| | | | | | llvm-svn: 23503 | |||||
| * | add support for an associative marker | Chris Lattner | 2005-09-28 | 2 | -5/+7 | |
| | | | | | llvm-svn: 23502 | |||||
| * | Emit an error if instructions or patterns are defined but can never match. | Chris Lattner | 2005-09-28 | 2 | -3/+52 | |
| | | | | | | | | | | | | | | | Currently we check that immediate values live on the RHS of commutative operators. Defining ORI like this, for example: def ORI : DForm_4<24, (ops GPRC:$dst, GPRC:$src1, u16imm:$src2), "ori $dst, $src1, $src2", [(set GPRC:$dst, (or immZExt16:$src2, GPRC:$src1))]>; results in: tblgen: In ORI: Instruction can never match: Immediate values must be on the RHS of commutative operators! llvm-svn: 23501 | |||||
| * | Nate pointed out that mulh[us] are commutative as well. Thanks! | Chris Lattner | 2005-09-28 | 1 | -2/+2 | |
| | | | | | llvm-svn: 23500 | |||||
| * | collect commutativity information | Chris Lattner | 2005-09-28 | 2 | -0/+24 | |
| | | | | | llvm-svn: 23499 | |||||
| * | expose commutativity information | Chris Lattner | 2005-09-28 | 1 | -8/+17 | |
| | | | | | llvm-svn: 23498 | |||||
| * | All (xor *) cases are autogenerated now | Chris Lattner | 2005-09-28 | 1 | -43/+0 | |
| | | | | | llvm-svn: 23497 | |||||
| * | add support for missed eqv tests | Chris Lattner | 2005-09-28 | 1 | -0/+9 | |
| | | | | | llvm-svn: 23496 | |||||
| * | add testcase for nand | Chris Lattner | 2005-09-28 | 1 | -1/+7 | |
| | | | | | llvm-svn: 23495 | |||||
| * | Implement PowerPC/eqv-andc-orc-nor.ll:EQV3 | Chris Lattner | 2005-09-28 | 1 | -1/+5 | |
| | | | | | llvm-svn: 23494 | |||||
| * | Consolidate the eqv.ll and nor.ll files together. | Chris Lattner | 2005-09-28 | 3 | -51/+58 | |
| | | | | | | | Add a missed eqv case. llvm-svn: 23493 | |||||
| * | Prefer cheaper patterns to more expensive ones. Print the costs to the ↵ | Chris Lattner | 2005-09-28 | 1 | -39/+50 | |
| | | | | | | | | | generated file llvm-svn: 23492 | |||||
| * | simple tests for nor generation | Chris Lattner | 2005-09-28 | 1 | -0/+12 | |
| | | | | | llvm-svn: 23491 | |||||
| * | learn to codegen not as NOR instead of xoris/xori | Chris Lattner | 2005-09-28 | 1 | -1/+5 | |
| | | | | | llvm-svn: 23490 | |||||
| * | These nodes are all autogenerated | Chris Lattner | 2005-09-28 | 1 | -44/+0 | |
| | | | | | llvm-svn: 23489 | |||||
| * | Select Constant nodes to TargetConstant nodes | Chris Lattner | 2005-09-28 | 1 | -5/+19 | |
| | | | | | llvm-svn: 23488 | |||||
| * | Constant fold llvm.sqrt | Chris Lattner | 2005-09-28 | 1 | -1/+9 | |
| | | | | | llvm-svn: 23487 | |||||

