| Commit message (Expand) | Author | Age | Files | Lines |
| * | Adjust to the changed StructType interface. In particular, getElementTypes()... | Chris Lattner | 2004-02-09 | 1 | -6/+6 |
| * | Add one that I missed | Chris Lattner | 2004-02-08 | 1 | -0/+1 |
| * | Instead of callign removeTriviallyDeadNodes on the global graph every time | Chris Lattner | 2004-02-08 | 4 | -8/+13 |
| * | Remove another unneeded call. | Chris Lattner | 2004-02-08 | 1 | -1/+0 |
| * | This call is no longer needed now that merging does not produce garbage | Chris Lattner | 2004-02-08 | 1 | -1/+0 |
| * | 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 | 3 | -15/+18 |
| * | There is no need to clone over nodes that are going to be dead anyway | Chris Lattner | 2004-02-07 | 1 | -3/+5 |
| * | Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. This | Chris Lattner | 2004-01-31 | 1 | -9/+11 |
| * | Forward method request to chained aa implementation | Chris Lattner | 2004-01-30 | 2 | -0/+8 |
| * | 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 | 2 | -9/+9 |
| * | 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 the TD pass, iterate over globals directly instead of through the whole sc... | Chris Lattner | 2004-01-28 | 1 | -9/+8 |
| * | In the TD pass, don't iterate over the scalar map to find the globals, iterat... | Chris Lattner | 2004-01-28 | 1 | -3/+2 |
| * | 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 |
| * | Rewrite to use the reachability cloner interface. Also, make this much more | Chris Lattner | 2004-01-27 | 1 | -58/+39 |
| * | minor cleanups | Chris Lattner | 2004-01-27 | 2 | -7/+5 |
| * | Get clone flags right, so we don't build InlinedGlobals only to clear them | Chris Lattner | 2004-01-27 | 2 | -8/+5 |
| * | Initial support for implementing clonePartiallyInto in terms of cloneReachabl... | Chris Lattner | 2004-01-23 | 4 | -60/+128 |
| * | Eliminated the CompletedNodes argument to the cloneReachable* methods. This | Chris Lattner | 2004-01-22 | 2 | -43/+21 |
| * | 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 |
| * | Allow disabling of ALL printing overhead when performing timings | Chris Lattner | 2004-01-22 | 1 | -0/+5 |
| * | Do not depend on index type to determine whether it is a structure or sequent... | Chris Lattner | 2003-11-25 | 1 | -11/+12 |
| * | Implement a small optimization to handling of GEP's that are equivalent to ca... | Chris Lattner | 2003-11-14 | 1 | -0/+18 |
| * | Trying to get the dsgraph for an external function is bad for DSA's health | Chris Lattner | 2003-11-13 | 1 | -11/+12 |
| * | Implement the CompleteBU pass | Chris Lattner | 2003-11-13 | 2 | -7/+142 |
| * | Minor code cleanup | Chris Lattner | 2003-11-13 | 1 | -2/+2 |
| * | Disable integer tracking by default | Chris Lattner | 2003-11-13 | 1 | -1/+6 |
| * | Add an initial version of the CompleteBUDataStructures class, which is currently | Chris Lattner | 2003-11-13 | 1 | -0/+75 |
| * | Fine-grainify namespaces for this library | Chris Lattner | 2003-11-12 | 10 | -36/+14 |
| * | Add new argument to disable checking | Chris Lattner | 2003-11-12 | 1 | -3/+5 |
| * | Print return nodes for graphs with multiple functions in them correctly | Chris Lattner | 2003-11-12 | 1 | -2/+2 |
| * | 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 | 11 | -6/+46 |
| * | 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 |