aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure
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-31Add functions to the ban listChris Lattner
2003-01-29Use and implement API for graph traversalsChris Lattner
2003-01-28free instructions mark their operands as being heap nodes.Chris Lattner
2003-01-23* Eliminate boolean arguments in favor of using enumsChris Lattner
2003-01-23* Eliminate boolean arguments in favor of using enumsChris Lattner
2003-01-23Slight efficiency improvementChris Lattner
2003-01-22Fix analysis of the Burg programChris Lattner
2002-12-12'graph' is spelled without a 'c'.Misha Brukman
2002-12-10This file implements a pass that automatically parallelizes a program,Vikram S. Adve
2002-12-08Iterator that enumerates the ProgramDependenceGraph (PDG) for a function,Vikram S. Adve
2002-12-08An explicit representation of dependence graphs, and a pass thatVikram S. Adve
2002-12-06Two bug fixes:Vikram S. Adve
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-27(1) Bug fix that was causing nodes with dangling references to be freed.Vikram 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-18Add peak memory usage supportChris Lattner
2002-11-18Add statsChris Lattner
2002-11-17Add hack to only consider indirect calls indirect if they do more than castChris Lattner
2002-11-17Add MaxSCC statisticsChris Lattner
2002-11-13Pass to compute various statisics related to DSGraphs.Vikram S. Adve
2002-11-12Inline graphs from outside the SCC into the SCC before SCC resolution startsChris Lattner
2002-11-12Fix two bugs:Chris Lattner
2002-11-11Fix bugChris Lattner
2002-11-11Handle a mismatch between # function args and call site argsChris Lattner
2002-11-11Elimiante calls to a node with nothing in it.Chris Lattner
2002-11-11Complete rewrite of BU code to use Tarjan's SCC finding algorithm to driveChris Lattner
2002-11-11Mark stuff reachable by _AUX_ calls as incomplete in the BU graphChris Lattner
2002-11-11Fix infinite loop in the BU algorithm. Unfortunately this dies a seriousChris Lattner
2002-11-11Print the right call set sizeChris 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-10Honor the shouldPrintAuxCalls flagChris Lattner
2002-11-10Initialize PrintAuxCalls memberChris Lattner
2002-11-10* Bottom-Up graphs print the Aux call vectorChris Lattner
2002-11-09eliminate the ability to remove global nodes from deadNodeElminate... for now.Chris Lattner
2002-11-09Remove obsolete codeChris Lattner
2002-11-09Fix logicChris Lattner
2002-11-09Add globals graphs to all three passesChris 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
generated by cgit v1.2.3-18-g5258 (git 2.32.0) at 2025-08-06 07:22:52 +0000