Declaration of Kildall iterative data flow solver for directed graphs. More...
#include <OpenAnalysis/Utils/OA_ptr.hpp>#include <OpenAnalysis/Utils/DGraph/DGraphInterface.hpp>#include <OpenAnalysis/Utils/DGraph/DGraphImplement.hpp>#include <OpenAnalysis/CFG/CFGInterface.hpp>#include <OpenAnalysis/CFG/CFG.hpp>#include <iostream>#include <sys/times.h>#include <vector>#include <set>#include <queue>#include <OpenAnalysis/DataFlow/WorkList.hpp>

Go to the source code of this file.
Classes | |
| class | OA::DataFlow::node_compare |
| class | OA::DataFlow::Worklist_PQueue |
Namespaces | |
| namespace | OA |
Namespace for the whole OpenAnalysis Toolkit. | |
| namespace | OA::DataFlow |
Variables | |
| static std::map< OA_ptr < DGraph::NodeInterface >, int > | OA::DataFlow::NodeToPriorityMap |
Declaration of Kildall iterative data flow solver for directed graphs.
Copyright (c) 2002-2005, Rice University
Copyright (c) 2004-2005, University of Chicago
Copyright (c) 2006, Contributors
All rights reserved.
See ../../../Copyright.txt for details.
Definition in file WorkListPQueue.hpp.
1.7.1