Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | new testcase for a bug Jim found | Chris Lattner | 2005-05-05 | 1 | -0/+23 | |
| | | | | llvm-svn: 21695 | |||||
* | new testcase | Chris Lattner | 2005-05-04 | 1 | -0/+7 | |
| | | | | llvm-svn: 21689 | |||||
* | Make sure both optimization cases get tested. | Reid Spencer | 2005-05-04 | 1 | -1/+2 | |
| | | | | llvm-svn: 21687 | |||||
* | Add a test case for the IsDigitOptimization class. | Reid Spencer | 2005-05-04 | 1 | -0/+17 | |
| | | | | llvm-svn: 21686 | |||||
* | Fix this test to succeed even if "strchr" is on a call instruction. | Reid Spencer | 2005-05-03 | 1 | -3/+5 | |
| | | | | llvm-svn: 21675 | |||||
* | Add a test case for SPrintFOptimization. | Reid Spencer | 2005-05-03 | 1 | -0/+32 | |
| | | | | llvm-svn: 21674 | |||||
* | Add a test case for StrChrOptimizer for -simplify-libcalls | Reid Spencer | 2005-05-03 | 2 | -6/+25 | |
| | | | | llvm-svn: 21668 | |||||
* | A new test case for the LLVMMemSetOptimization. | Reid Spencer | 2005-05-03 | 1 | -0/+17 | |
| | | | | llvm-svn: 21663 | |||||
* | Correct the title and the success criteria: strcmp -> strncmp | Reid Spencer | 2005-05-03 | 1 | -2/+2 | |
| | | | | llvm-svn: 21659 | |||||
* | Add a new test case for the StrNCmpOptimization. | Reid Spencer | 2005-05-03 | 1 | -0/+26 | |
| | | | | llvm-svn: 21658 | |||||
* | Add a test case for testing the FPrintFOptimization. | Reid Spencer | 2005-05-02 | 1 | -0/+28 | |
| | | | | llvm-svn: 21656 | |||||
* | new testcase | Chris Lattner | 2005-05-01 | 1 | -0/+5 | |
| | | | | llvm-svn: 21646 | |||||
* | add a new testcase | Chris Lattner | 2005-05-01 | 1 | -0/+5 | |
| | | | | llvm-svn: 21644 | |||||
* | * Fix signed/unsigned usage problem | Reid Spencer | 2005-04-30 | 1 | -9/+10 | |
| | | | | | | * Rearrange for readability. llvm-svn: 21625 | |||||
* | A new test case for the ToAsciiOptimizer. | Reid Spencer | 2005-04-30 | 1 | -0/+21 | |
| | | | | llvm-svn: 21624 | |||||
* | A new test case for the StrCmpOptimization in -simplify-libcalls. | Reid Spencer | 2005-04-30 | 1 | -0/+26 | |
| | | | | llvm-svn: 21623 | |||||
* | This is StrCpy, NOT StrCat! | Reid Spencer | 2005-04-29 | 1 | -2/+2 | |
| | | | | llvm-svn: 21622 | |||||
* | Get the name of the pass right in the documentation. | Reid Spencer | 2005-04-29 | 1 | -1/+1 | |
| | | | | llvm-svn: 21621 | |||||
* | Fix the success criteria for the test to make call instructions with "pow" | Reid Spencer | 2005-04-29 | 1 | -1/+1 | |
| | | | | | | not just any occurrence of "pow". llvm-svn: 21620 | |||||
* | Actually make this pass test something related to fputs. | Reid Spencer | 2005-04-29 | 1 | -6/+16 | |
| | | | | llvm-svn: 21619 | |||||
* | Add a test case for the puts libcall optimization. | Reid Spencer | 2005-04-29 | 1 | -0/+16 | |
| | | | | llvm-svn: 21616 | |||||
* | Add a testcase for optimizing the strcpy libcall. | Reid Spencer | 2005-04-29 | 1 | -0/+24 | |
| | | | | llvm-svn: 21615 | |||||
* | New test case for testing pow(3) math library optimizations. | Reid Spencer | 2005-04-29 | 1 | -0/+18 | |
| | | | | llvm-svn: 21613 | |||||
* | Test the noreturn function optimization | Chris Lattner | 2005-04-27 | 1 | -0/+16 | |
| | | | | llvm-svn: 21586 | |||||
* | Add a test case for MemMove.ll | Reid Spencer | 2005-04-26 | 1 | -0/+21 | |
| | | | | llvm-svn: 21568 | |||||
* | Result of strlen is size_t which is either uint or ulong, not int. | Reid Spencer | 2005-04-26 | 1 | -4/+4 | |
| | | | | llvm-svn: 21567 | |||||
* | Add a new test case for the llvm.memcpy simplification case. | Reid Spencer | 2005-04-26 | 1 | -0/+21 | |
| | | | | llvm-svn: 21561 | |||||
* | * Add a test case for StrLenOptimization | Reid Spencer | 2005-04-26 | 3 | -0/+21 | |
| | | | | | | | * Rename ExitInMain and StrCat tests so they don't have the date the regression was entered since they are feature tests, not regressions. llvm-svn: 21558 | |||||
* | Fix RUN: line to not always pass. | Reid Spencer | 2005-04-26 | 1 | -1/+1 | |
| | | | | llvm-svn: 21553 | |||||
* | Update the test case to handle a few more (degenerate) cases and remove | Reid Spencer | 2005-04-25 | 1 | -3/+10 | |
| | | | | | | the restriction that it is an XFAIL because it now passes. llvm-svn: 21545 | |||||
* | rename fn | Chris Lattner | 2005-04-25 | 1 | -1/+1 | |
| | | | | llvm-svn: 21540 | |||||
* | new testcase | Chris Lattner | 2005-04-25 | 1 | -0/+8 | |
| | | | | llvm-svn: 21539 | |||||
* | Make sure the target buffer is null terminated so we don't blow up | Reid Spencer | 2005-04-25 | 1 | -0/+1 | |
| | | | | | | strcat when its called. llvm-svn: 21533 | |||||
* | A test case for testing the StrCatOptimizer, currently XFAILed everywhere. | Reid Spencer | 2005-04-25 | 1 | -0/+16 | |
| | | | | llvm-svn: 21532 | |||||
* | Use the %name rather than the "name" format so those familiar with the | Reid Spencer | 2005-04-25 | 1 | -5/+5 | |
| | | | | | | llvm-dis output don't go blind. llvm-svn: 21525 | |||||
* | A test case for the the ExitInMain libcall simplification. | Reid Spencer | 2005-04-25 | 2 | -0/+16 | |
| | | | | llvm-svn: 21521 | |||||
* | Test that xor/select are folded into a select with inverted operands. | Chris Lattner | 2005-04-24 | 1 | -1/+5 | |
| | | | | llvm-svn: 21494 | |||||
* | unxfail this. | Chris Lattner | 2005-04-24 | 1 | -6/+0 | |
| | | | | llvm-svn: 21490 | |||||
* | add a new testcase which occurs in 181.mcf | Chris Lattner | 2005-04-24 | 1 | -0/+6 | |
| | | | | llvm-svn: 21489 | |||||
* | add a new testcase | Chris Lattner | 2005-04-23 | 1 | -0/+6 | |
| | | | | llvm-svn: 21469 | |||||
* | new testcase | Chris Lattner | 2005-04-15 | 2 | -0/+21 | |
| | | | | llvm-svn: 21304 | |||||
* | new testcase that crashes the instcombiner. | Chris Lattner | 2005-04-08 | 1 | -0/+7 | |
| | | | | llvm-svn: 21151 | |||||
* | new test | Chris Lattner | 2005-04-07 | 1 | -0/+5 | |
| | | | | llvm-svn: 21137 | |||||
* | new testcase | Chris Lattner | 2005-04-07 | 1 | -0/+5 | |
| | | | | llvm-svn: 21135 | |||||
* | New testcase that crashes licm. | Chris Lattner | 2005-03-25 | 1 | -0/+10 | |
| | | | | llvm-svn: 20829 | |||||
* | cleanup the test | Chris Lattner | 2005-03-06 | 1 | -4/+2 | |
| | | | | llvm-svn: 20504 | |||||
* | check that we only insert one phi node per loop | Chris Lattner | 2005-03-06 | 1 | -0/+42 | |
| | | | | llvm-svn: 20503 | |||||
* | Add testcase for this: | Chris Lattner | 2005-03-06 | 1 | -0/+21 | |
| | | | | | | | | | | | | (3) Do not reduce element sizes of small power of two: char s[10]; for (i) ...s[i] ... when the indvar is not eliminable. llvm-svn: 20502 | |||||
* | testcase for A[invariant][indvar] where invariant is an instruction. | Chris Lattner | 2005-03-06 | 1 | -0/+19 | |
| | | | | llvm-svn: 20500 | |||||
* | add test for this: | Chris Lattner | 2005-03-06 | 1 | -0/+21 | |
| | | | | | | | | | | | (1) Allow loop invariant expressions to come before the induction variable (instead of just constants): int x; for (i) ...a[x][i] llvm-svn: 20499 |