iteratedDominanceFrontier.h File Reference

#include <boostGraphCFG.h>
#include "rose.h"
#include <vector>
#include <set>
#include <map>
#include <iterator>
#include <boost/foreach.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/topological_sort.hpp>

Include dependency graph for iteratedDominanceFrontier.h:

Go to the source code of this file.

Namespaces
namespace	ssa_private
Functions
template<class CfgNodeT>
set< CfgNodeT >	ssa_private::calculateIteratedDominanceFrontier (const map< CfgNodeT, set< CfgNodeT > > &dominanceFrontiers, const vector< CfgNodeT > &startNodes)
	Given the dominance frontiers of each node and a set of start nodes, calculate the iterated dominance frontier of the start nodes.
template<class CfgNodeT, class CfgEdgeT>
map< CfgNodeT, set< CfgNodeT > >	ssa_private::calculateDominanceFrontiers (SgFunctionDefinition *func, map< CfgNodeT, CfgNodeT > *iDominatorMap, map< CfgNodeT, CfgNodeT > *iPostDominatorMap)
	Calculates the dominance frontier for each node in the control flow graph of the given function.

---