| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | implement SSAUpdater::RewriteUseAfterInsertions, a helpful form of RewriteUse. | Chris Lattner | 2010-08-29 | 1 | -0/+16 |
| * | remove the ABCD and SSI passes. They don't have any clients that | Chris Lattner | 2010-08-28 | 2 | -434/+0 |
| * | Reapply r112091 and r111922, support for metadata linking, with a | Dan Gohman | 2010-08-26 | 4 | -51/+84 |
| * | Revert r111922, "MapValue support for MDNodes. This is similar to r109117, | Daniel Dunbar | 2010-08-26 | 1 | -27/+8 |
| * | Revert r112091, "Remap metadata attached to instructions when remapping | Daniel Dunbar | 2010-08-26 | 2 | -12/+16 |
| * | Remap metadata attached to instructions when remapping individual | Dan Gohman | 2010-08-25 | 2 | -16/+12 |
| * | Use MapValue in the Linker instead of having a private function | Dan Gohman | 2010-08-24 | 4 | -32/+3 |
| * | MapValue support for MDNodes. This is similar to r109117, except | Dan Gohman | 2010-08-24 | 1 | -8/+27 |
| * | Now that PassInfo and Pass::ID have been separated, move the rest of the pass... | Owen Anderson | 2010-08-23 | 7 | -12/+14 |
| * | fit in 80 cols | Chris Lattner | 2010-08-18 | 1 | -2/+3 |
| * | remove some dead code. | Chris Lattner | 2010-08-18 | 2 | -12/+2 |
| * | Use the getUniquePredecessor() utility function, instead of doing | Dan Gohman | 2010-08-17 | 1 | -15/+5 |
| * | Avoid #include <ScalarEvolution.h> in LoopSimplify.cpp, which doesn't | Dan Gohman | 2010-08-16 | 1 | -2/+1 |
| * | Instead, teach SimplifyCFG to trim non-address-taken blocks from | Dan Gohman | 2010-08-16 | 1 | -2/+3 |
| * | LoopSimplify shouldn't split loop backedges that use indirectbr. PR7867. | Dan Gohman | 2010-08-14 | 1 | -0/+5 |
| * | Teach SimplifyCFG how to simplify indirectbr instructions. | Dan Gohman | 2010-08-14 | 2 | -13/+43 |
| * | Eliminate PromoteMemoryToRegisterID; just use addPreserved("mem2reg") | Dan Gohman | 2010-08-06 | 4 | -5/+3 |
| * | Reapply r110396, with fixes to appease the Linux buildbot gods. | Owen Anderson | 2010-08-06 | 8 | -15/+15 |
| * | Revert r110396 to fix buildbots. | Owen Anderson | 2010-08-06 | 8 | -15/+15 |
| * | Don't use PassInfo* as a type identifier for passes. Instead, use the addres... | Owen Anderson | 2010-08-05 | 8 | -15/+15 |
| * | simplify | Gabor Greif | 2010-07-28 | 1 | -2/+2 |
| * | simplify: CallSite::get --> CallSite constructor | Gabor Greif | 2010-07-27 | 1 | -4/+4 |
| * | Remove LCSSA's bogus dependence on LoopSimplify and LoopSimplify's bogus | Dan Gohman | 2010-07-26 | 2 | -16/+6 |
| * | Preserve ScalarEvolution in the loop unroller. | Dan Gohman | 2010-07-26 | 1 | -0/+6 |
| * | Revert this because we can't clone cyclic MDNodes which are creating during a | Nick Lewycky | 2010-07-24 | 1 | -3/+4 |
| * | Whether function-local or not, a MDNode may reference a Function in which case | Nick Lewycky | 2010-07-24 | 1 | -4/+3 |
| * | Speculatively revert 109117 | Devang Patel | 2010-07-22 | 1 | -27/+6 |
| * | keep in 80 cols | Gabor Greif | 2010-07-22 | 1 | -3/+4 |
| * | Map MDNode correctly. | Devang Patel | 2010-07-22 | 1 | -6/+27 |
| * | mass elimination of reliance on automatic iterator dereferencing | Gabor Greif | 2010-07-22 | 2 | -3/+3 |
| * | pass dereferenced iterator to dyn_cast | Gabor Greif | 2010-07-22 | 1 | -1/+1 |
| * | undo 80 column trespassing I caused | Gabor Greif | 2010-07-22 | 1 | -5/+6 |
| * | Make NamedMDNode not be a subclass of Value, and simplify the interface | Dan Gohman | 2010-07-21 | 1 | -4/+2 |
| * | Fix batch of converting RegisterPass<> to INTIALIZE_PASS(). | Owen Anderson | 2010-07-21 | 2 | -5/+6 |
| * | Use DebugLocs instead of MDNodes. | Dan Gohman | 2010-07-20 | 1 | -32/+27 |
| * | Don't look up the "dbg" metadata kind by name. | Dan Gohman | 2010-07-20 | 2 | -12/+12 |
| * | Reorder the contents of various getAnalysisUsage functions, eliminating | Dan Gohman | 2010-07-16 | 2 | -14/+17 |
| * | eliminate CallInst::ArgOffset | Gabor Greif | 2010-07-16 | 1 | -5/+5 |
| * | Remove unneeded check, and correct style. | Owen Anderson | 2010-07-15 | 1 | -3/+2 |
| * | make various clients of ReplaceAndSimplifyAllUses tolerate | Chris Lattner | 2010-07-15 | 1 | -2/+3 |
| * | Extend SimplifyCFG's common-destination folding heuristic to allow a single | Owen Anderson | 2010-07-14 | 1 | -5/+67 |
| * | cache dereferenced iterators | Gabor Greif | 2010-07-12 | 1 | -4/+6 |
| * | cache dereferenced iterators | Gabor Greif | 2010-07-12 | 1 | -3/+5 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -3/+5 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -2/+4 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -2/+3 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -4/+6 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -2/+3 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -3/+4 |
| * | cache result of operator* | Gabor Greif | 2010-07-09 | 1 | -3/+5 |
