soot.toolkits.graph

Class DominatorTreeAdapter<N>

java.lang.Object

soot.toolkits.graph.DominatorTreeAdapter<N>

All Implemented Interfaces:

Iterable<DominatorNode<N>>, DirectedGraph<DominatorNode<N>>

public class DominatorTreeAdapter<N>
extends Object
implements DirectedGraph<DominatorNode<N>>

This adapter provides a DirectedGraph interface to DominatorTree.

This might be useful if e.g. you want to apply a DirectedGraph analysis such as the PseudoTopologicalOrderer to a DominatorTree.

Author:

Navindra Umanee

Constructor Summary

Constructors

Constructor and Description
DominatorTreeAdapter(DominatorTree<N> dt)

Method Summary

Modifier and Type	Method and Description
List<DominatorNode<N>>	getHeads() Returns a list of entry points for this graph.
List<DominatorNode<N>>	getPredsOf(DominatorNode<N> node) Returns a list of predecessors for the given node in the graph.
List<DominatorNode<N>>	getSuccsOf(DominatorNode<N> node) Returns a list of successors for the given node in the graph.
List<DominatorNode<N>>	getTails() Returns a list of exit points for this graph.
Iterator<DominatorNode<N>>	iterator() Returns an iterator for the nodes in this graph.
int	size() Returns the node count for this graph.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

DominatorTreeAdapter

public DominatorTreeAdapter(DominatorTree<N> dt)

Method Detail

getHeads

public List<DominatorNode<N>> getHeads()

Description copied from interface: DirectedGraph

Returns a list of entry points for this graph.

Specified by:

getHeads in interface DirectedGraph<DominatorNode<N>>

getTails

public List<DominatorNode<N>> getTails()

Description copied from interface: DirectedGraph

Returns a list of exit points for this graph.

Specified by:

getTails in interface DirectedGraph<DominatorNode<N>>

getPredsOf

public List<DominatorNode<N>> getPredsOf(DominatorNode<N> node)

Description copied from interface: DirectedGraph

Returns a list of predecessors for the given node in the graph.

Specified by:

getPredsOf in interface DirectedGraph<DominatorNode<N>>

getSuccsOf

public List<DominatorNode<N>> getSuccsOf(DominatorNode<N> node)

Description copied from interface: DirectedGraph

Returns a list of successors for the given node in the graph.

Specified by:

getSuccsOf in interface DirectedGraph<DominatorNode<N>>

iterator

public Iterator<DominatorNode<N>> iterator()

Description copied from interface: DirectedGraph

Returns an iterator for the nodes in this graph. No specific ordering of the nodes is guaranteed.

Specified by:

iterator in interface Iterable<DominatorNode<N>>

Specified by:

iterator in interface DirectedGraph<DominatorNode<N>>

size

public int size()

Description copied from interface: DirectedGraph

Returns the node count for this graph.

Specified by:

size in interface DirectedGraph<DominatorNode<N>>