| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Fix a tiny bug that caused an incorrect assertion failure poolallocating | Chris Lattner | 2004-03-13 | 1 | -4/+6 |
| * | implement new method | Chris Lattner | 2004-03-09 | 1 | -0/+24 |
| * | Fix a bug handling globals that are constants, but are still external | Chris Lattner | 2004-03-08 | 1 | -1/+1 |
| * | Implement a FIXME, improving the efficiency of DSA on povray. | Chris Lattner | 2004-03-04 | 1 | -2/+16 |
| * | Fix BU datastructures with povray! | Chris Lattner | 2004-03-04 | 1 | -11/+25 |
| * | Only clone nodes that are needed in the caller, don't clone ALL aux calls. T... | Chris Lattner | 2004-03-04 | 1 | -20/+48 |
| * | Fix a DSA bug that caused DSA to generate incredibly huge graphs and take for... | Chris Lattner | 2004-03-03 | 1 | -1/+34 |
| * | Deinline methods, add fast exit | Chris Lattner | 2004-03-03 | 1 | -0/+27 |
| * | Fix a node mapping problem that was causing the pool allocator to locally all... | Chris Lattner | 2004-03-03 | 1 | -0/+3 |
| * | Only clone global nodes between graphs if both graphs have the global. | Chris Lattner | 2004-02-27 | 1 | -13/+6 |
| * | Fix typo | Chris Lattner | 2004-02-26 | 1 | -1/+1 |
| * | The node doesn't have to be _no_ node flags, it just has to be complete and | Chris Lattner | 2004-02-26 | 1 | -2/+3 |
| * | Two changes: | Chris Lattner | 2004-02-25 | 1 | -1/+4 |
| * | Simplify the dead node elimination stuff | Chris Lattner | 2004-02-25 | 1 | -10/+12 |
| * | Use isNull instead of getNode() to test for existence of a node, this is chea... | Chris Lattner | 2004-02-22 | 1 | -6/+11 |
| * | Fix an iterator invalidation problem which was causing some nodes to not be | Chris Lattner | 2004-02-21 | 1 | -20/+19 |
| * | Adjust to the changed StructType interface. In particular, getElementTypes()... | Chris Lattner | 2004-02-09 | 1 | -6/+6 |
| * | Instead of callign removeTriviallyDeadNodes on the global graph every time | Chris Lattner | 2004-02-08 | 1 | -8/+9 |
| * | Substantially improve the DSA code by removing 'forwarding' nodes from | Chris Lattner | 2004-02-08 | 1 | -1/+5 |
| * | Bugfix for ilist conversion. The ilist wants to make an 'end' node which has | Chris Lattner | 2004-02-08 | 1 | -1/+1 |
| * | Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> | Chris Lattner | 2004-02-08 | 1 | -19/+17 |
| * | Change to use node_iterators instead of direct access to Nodes | Chris Lattner | 2004-02-08 | 1 | -34/+43 |
| * | getNodes() is gone, use node_begin/end instead | Chris Lattner | 2004-02-07 | 1 | -5/+7 |
| * | There is no need to clone over nodes that are going to be dead anyway | Chris Lattner | 2004-02-07 | 1 | -3/+5 |
| * | Fix a bug aflicting 265.gap | Chris Lattner | 2004-01-29 | 1 | -4/+18 |
| * | Minor bugfixes | Chris Lattner | 2004-01-29 | 1 | -8/+12 |
| * | Rename DSGraph::ScalarMapTy -> DSScalarMap | Chris Lattner | 2004-01-28 | 1 | -6/+6 |
| * | Fix a bug | Chris Lattner | 2004-01-28 | 1 | -1/+1 |
| * | Eliminate the call to removeTriviallyDeadNodes from updateFromGlobals graph, | Chris Lattner | 2004-01-28 | 1 | -4/+1 |
| * | In updateFromGlobalsGraph, instead of iterating over all of the scalars in the | Chris Lattner | 2004-01-28 | 1 | -8/+7 |
| * | Minor tweaks, eliminate useless integer pruning optimziation, turn on | Chris Lattner | 2004-01-28 | 1 | -4/+6 |
| * | Further reduce the number of nodes cloned with getClonedNH, using merge instead. | Chris Lattner | 2004-01-28 | 1 | -1/+1 |
| * | Add a timer, fix a minor bug. | Chris Lattner | 2004-01-28 | 1 | -4/+12 |
| * | Another bugfix, disable "spurious" output. | Chris Lattner | 2004-01-28 | 1 | -1/+4 |
| * | fix bug in previous checkin | Chris Lattner | 2004-01-27 | 1 | -1/+0 |
| * | * Add a new commandline argument to control the "global roots hack". Default | Chris Lattner | 2004-01-27 | 1 | -454/+407 |
| * | Initial support for implementing clonePartiallyInto in terms of cloneReachabl... | Chris Lattner | 2004-01-23 | 1 | -57/+122 |
| * | Eliminated the CompletedNodes argument to the cloneReachable* methods. This | Chris Lattner | 2004-01-22 | 1 | -41/+20 |
| * | Ok, I'm tired of pulling out all my timers to check stuff in, just do it. | Chris Lattner | 2004-01-22 | 1 | -0/+18 |
| * | Bug fix: X.mergeWith(Y) was not updating Y if Y was a null node handle! | Chris Lattner | 2004-01-22 | 1 | -2/+9 |
| * | Start implementing DSGraph::clonePartiallyInto and implement mergeInGraph | Chris Lattner | 2004-01-22 | 1 | -66/+176 |
| * | Fine-grainify namespaces for this library | Chris Lattner | 2003-11-12 | 1 | -4/+1 |
| * | Add new argument to disable checking | Chris Lattner | 2003-11-12 | 1 | -3/+5 |
| * | Don't crash if no gg | Chris Lattner | 2003-11-12 | 1 | -1/+1 |
| * | Put all LLVM code into the llvm namespace, as per bug 109. | Brian Gaeke | 2003-11-11 | 1 | -2/+5 |
| * | Compute node offsets correctly | Chris Lattner | 2003-11-11 | 1 | -2/+2 |
| * | Add new method for computing node mappings. This is used by the pool allocator | Chris Lattner | 2003-11-11 | 1 | -0/+31 |
| * | All DSGraphs keep a reference to the targetdata they are created with. This is | Chris Lattner | 2003-11-02 | 1 | -9/+14 |
| * | Fix bug: test/Regression/Analysis/DSGraph/2003-11-02-NodeCollapsing.ll | Chris Lattner | 2003-11-02 | 1 | -6/+8 |
| * | Added LLVM project notice to the top of every C++ source file. | John Criswell | 2003-10-20 | 1 | -0/+7 |
