| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| ... | |
| * | Pull out setcc, this reduces stack frame size from 7520 to 6032 bytes | Chris Lattner | 2005-10-06 | 1 | -115/+117 |
| * | Pull two more methods out, reducing stack frame size from 8224 -> 7520 bytes | Chris Lattner | 2005-10-06 | 1 | -58/+65 |
| * | Add a recursive-iterative hybrid stage to attempt to reduce stack space, this | Chris Lattner | 2005-10-06 | 1 | -45/+94 |
| * | silence a bogus GCC warning | Chris Lattner | 2005-10-06 | 1 | -1/+1 |
| * | Fix the LLC regressions on X86 last night. In particular, when undoing | Chris Lattner | 2005-10-06 | 1 | -5/+12 |
| * | This is suppose to work now | Andrew Lenharth | 2005-10-06 | 2 | -1/+2 |
| * | remove VAX compatibility instruction, we will never use this | Andrew Lenharth | 2005-10-06 | 1 | -2/+0 |
| * | Make the legalizer completely non-recursive | Chris Lattner | 2005-10-06 | 1 | -28/+63 |
| * | Let the combiner handle more cases | Nate Begeman | 2005-10-05 | 1 | -1/+4 |
| * | Remove some bad code from Legalize | Nate Begeman | 2005-10-05 | 1 | -4/+1 |
| * | Check in some more DAGCombiner pieces | Nate Begeman | 2005-10-05 | 1 | -23/+45 |
| * | Fix a bug in the local spiller, where we could take code like this: | Chris Lattner | 2005-10-05 | 1 | -5/+5 |
| * | silence some warnings | Chris Lattner | 2005-10-05 | 2 | -2/+2 |
| * | implement visitBR_CC so that PowerPC/inverted-bool-compares.ll passes | Chris Lattner | 2005-10-05 | 2 | -2/+25 |
| * | fix some pastos | Chris Lattner | 2005-10-05 | 1 | -2/+2 |
| * | Add a new HandleNode class, which is used to handle (haha) cases in the | Chris Lattner | 2005-10-05 | 2 | -11/+17 |
| * | Implement the code for PowerPC/inverted-bool-compares.ll, even though it | Chris Lattner | 2005-10-05 | 1 | -1/+16 |
| * | make sure that -view-isel-dags is the input to the isel, not the input to | Chris Lattner | 2005-10-05 | 1 | -2/+2 |
| * | Fix a crash compiling Olden/tsp | Chris Lattner | 2005-10-05 | 1 | -6/+4 |
| * | refactor a bit of code. | Chris Lattner | 2005-10-04 | 1 | -29/+35 |
| * | Minor speedup to avoid array searches given a Use*. This speeds up bc reading | Chris Lattner | 2005-10-04 | 1 | -23/+39 |
| * | Change the signature of replaceUsesOfWithOnConstant. The bool was always | Chris Lattner | 2005-10-04 | 3 | -37/+14 |
| * | For large constants (e.g. arrays and structs with many elements) just | Chris Lattner | 2005-10-04 | 1 | -23/+56 |
| * | minor cleanup/fastpath for the bcreader. This speeds up the bcreader | Chris Lattner | 2005-10-04 | 1 | -2/+23 |
| * | Reverting to version - until problem isolated. | Jim Laskey | 2005-10-04 | 1 | -70/+238 |
| * | Add a forward def | Chris Lattner | 2005-10-04 | 1 | -1/+2 |
| * | Fix some faulty logic in the libcall inserter. | Nate Begeman | 2005-10-04 | 1 | -19/+11 |
| * | implement the struct version of the array speedup, speeding up the | Chris Lattner | 2005-10-04 | 1 | -9/+49 |
| * | Fix DemoteRegToStack on an invoke. This fixes PR634. | Chris Lattner | 2005-10-04 | 1 | -1/+2 |
| * | Add back a workaround that fixes some breakages from chris's last change. | Nate Begeman | 2005-10-04 | 1 | -2/+13 |
| * | Clean up the code a bit. Use isInstructionTriviallyDead to be more aggressive | Chris Lattner | 2005-10-03 | 1 | -4/+8 |
| * | Change ConstantArray::replaceUsesOfWithOnConstant to attempt to update | Chris Lattner | 2005-10-03 | 1 | -8/+58 |
| * | move some methods, no other changes | Chris Lattner | 2005-10-03 | 1 | -130/+132 |
| * | minor microoptimizations | Chris Lattner | 2005-10-03 | 1 | -14/+21 |
| * | Use a map to cache the ModuleType information, so we can do logarithmic | Chris Lattner | 2005-10-03 | 2 | -8/+47 |
| * | Refactor gathering node info and emission. | Jim Laskey | 2005-10-03 | 1 | -238/+70 |
| * | clean up this code a bit, no functionality change | Chris Lattner | 2005-10-03 | 1 | -101/+116 |
| * | Speed up the asm printer a lot by not printing formatted LLVM asm output | Chris Lattner | 2005-10-03 | 1 | -9/+3 |
| * | Break the body of the loop out into a new method | Chris Lattner | 2005-10-03 | 1 | -144/+155 |
| * | Make IVUseShouldUsePostIncValue more aggressive when the use is a PHI. In | Chris Lattner | 2005-10-03 | 1 | -6/+38 |
| * | Refactor some code into a function | Chris Lattner | 2005-10-03 | 1 | -7/+23 |
| * | This break is bogus and I have no idea why it was there. Basically it prevents | Chris Lattner | 2005-10-03 | 1 | -1/+0 |
| * | when checking if we should move a split edge block outside of a loop, | Chris Lattner | 2005-10-03 | 1 | -7/+6 |
| * | Fix a problem where the legalizer would run out of stack space on extremely | Chris Lattner | 2005-10-02 | 1 | -9/+36 |
| * | silence a bogus warning | Chris Lattner | 2005-10-02 | 1 | -1/+1 |
| * | silence some warnings | Chris Lattner | 2005-10-02 | 1 | -3/+2 |
| * | silence a warning | Chris Lattner | 2005-10-02 | 1 | -1/+1 |
| * | add patterns for float binops and fma ops | Chris Lattner | 2005-10-02 | 1 | -8/+12 |
| * | Sort the cpu and features table, so that the alpha backend doesn't fail EVERY | Chris Lattner | 2005-10-02 | 1 | -2/+2 |
| * | Add assertions to the trivial scheduler to check that the value types match | Chris Lattner | 2005-10-02 | 1 | -0/+21 |
