aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/DataStructure.cpp
AgeCommit message (Expand)Author
2003-02-01Remove dead nodes more efficientlyChris Lattner
2003-02-01Improve efficiency of aliveness traversal codeChris Lattner
2003-02-01Change DSGraph stuff to use hash_(set|map) instead of std::(set|map)Chris Lattner
2003-02-01Remove using declarationsChris Lattner
2003-01-31Remove globals on the bottom up pass which do not contain any informationChris Lattner
2003-01-29Use and implement API for graph traversalsChris Lattner
2003-01-23* Eliminate boolean arguments in favor of using enumsChris Lattner
2003-01-22Fix analysis of the Burg programChris Lattner
2002-12-06Fix several related bugs in DSNode::mergeWith() caused by theVikram S. Adve
2002-12-05Cute bug fix: when moving links from N to this, some links could haveVikram S. Adve
2002-11-27Fix logical error in TD pass: we should clear Mod/Ref bits of each callerVikram S. Adve
2002-11-25Keep global nodes in each DS Graph (by forcing them to be marked live).Vikram S. Adve
2002-11-18Add peak memory usage measurement stuffChris Lattner
2002-11-12Fix two bugs:Chris Lattner
2002-11-11Elimiante calls to a node with nothing in it.Chris Lattner
2002-11-11Mark stuff reachable by _AUX_ calls as incomplete in the BU graphChris Lattner
2002-11-11Use call site mergeWith method to simplify codeChris Lattner
2002-11-10Fix a bug that could trigger when varargs call sites had non-matching number ...Chris Lattner
2002-11-10* Dramatically rework liveness evaluation.Chris Lattner
2002-11-09eliminate the ability to remove global nodes from deadNodeElminate... for now.Chris Lattner
2002-11-09Move maskNodeTypes to header fileChris Lattner
2002-11-09Clean up DSGraph::removeDeadNodes interfaceChris Lattner
2002-11-09Make removeTriviallyDeadNodes a private interface of DSGraphChris Lattner
2002-11-09Add initial support for a globals graphChris Lattner
2002-11-09Tighten up array handlingChris Lattner
2002-11-09Fix warning & release buildChris Lattner
2002-11-08Fold arrays down to a single element. This causes huge wins on some benchmarksChris Lattner
2002-11-08Allow specification of whether the call sites should be copied, AND whetherChris Lattner
2002-11-08- Add a bunch of checking to make sure that dead nodes are not used after theyChris Lattner
2002-11-08Use DSNodeHandleMap instead to be safeChris Lattner
2002-11-08Add flushChris Lattner
2002-11-07Instead of using a bool that constant has to be explained, use a selfChris Lattner
2002-11-07Implement a new mergeInGraph method, which basically factors code out ofChris Lattner
2002-11-07Rename DataStructureAnalysis namespace to DSChris Lattner
2002-11-07Minor bugfix to enable generation of methcall.llvm.lib, objinst.llvm.lib, andChris Lattner
2002-11-07Move printouts to be wrapped in DEBUG() macrosChris Lattner
2002-11-06Make PointerSize & Shift be enumsChris Lattner
2002-11-06Dramatically simplify internal DSNode representation, get implementationChris Lattner
2002-11-05Attempted fixes to the mergemap to make it work better.Chris Lattner
2002-11-04Change the "Cannot merge two portions of the same node yet" from an assertionChris Lattner
2002-11-03Rename ValueMap to ScalarMapChris Lattner
2002-11-03Rename NewNode flag to HeapNodeChris Lattner
2002-11-02Stop representing scalars as explicit nodes in the graph. Now the onlyChris Lattner
2002-10-31 * Minor optimization: when merging nodes, merge the smaller one into theChris Lattner
2002-10-31This fixes all kinds of problems with array handling. There are still bugs toChris Lattner
2002-10-21Delete unused arguments to DSGraph::cloneInto methodChris Lattner
2002-10-21Add another copy ctor formChris Lattner
2002-10-21As it turns out, we don't need a fully generic mapping copy ctor, we just needChris Lattner
2002-10-21Remove some unneccesary 'using' directivesChris Lattner
2002-10-21Fix bug with prior checkinChris Lattner
generated by cgit v1.2.3-18-g5258 (git 2.32.0) at 2025-05-01 16:49:26 +0000