Field Detail

• mr2Nodes

  protected final Map<MethodReference,​Set<CGNode>> mr2Nodes

  A mapping from MethodReference to Set of nodes that represent this methodReference. TODO: rhs of mapping doesn't have to be a set if it's a singleton; could be a node instead. TODO: this is a bit redundant with the nodes Map. Restructure these data structures for space efficiency.

Constructor Detail

• BasicCallGraph

  public BasicCallGraph()

Method Detail

• init

  public void init()
            throws CancelException

  Throws:

  CancelException

• makeFakeRootNode

  protected abstract CGNode makeFakeRootNode()
                                      throws CancelException

  Throws:

  CancelException

• makeFakeWorldClinitNode

  protected abstract CGNode makeFakeWorldClinitNode()
                                             throws CancelException

  Throws:

  CancelException

• findOrCreateNode

  public abstract CGNode findOrCreateNode​(IMethod method,
                                          Context C)
                                   throws CancelException

  Use with extreme care.

  Throws:

  CancelException - TODO

• registerNode

  protected void registerNode​(BasicCallGraph.Key K,
                              CGNode N)

• getNode

  protected BasicCallGraph.NodeImpl getNode​(BasicCallGraph.Key K)

• getFakeRootNode

  public CGNode getFakeRootNode()

  Description copied from interface: CallGraph
  Return the (fake) interprocedural root node of the call graph.

  Specified by:

  getFakeRootNode in interface CallGraph

  Returns:

  the "fake" root node the call graph

• getFakeWorldClinitNode

  public CGNode getFakeWorldClinitNode()

  Specified by:

  getFakeWorldClinitNode in interface CallGraph

• registerEntrypoint

  public void registerEntrypoint​(CGNode node)

  record that a node is an entrypoint

• getEntrypointNodes

  public Collection<CGNode> getEntrypointNodes()

  Note: not all successors of the root node are entrypoints

  Specified by:

  getEntrypointNodes in interface CallGraph

  Returns:

  an Iterator of the nodes designated as "root nodes"

• toString

  public String toString()

  Overrides:

  toString in class AbstractGraph<CGNode>

• removeNodeAndEdges

  public void removeNodeAndEdges​(CGNode N)
                          throws UnimplementedError

  Description copied from interface: Graph
  remove a node and all its incident edges

  Specified by:

  removeNodeAndEdges in interface Graph<T>

  Overrides:

  removeNodeAndEdges in class AbstractGraph<CGNode>

  Throws:

  UnimplementedError

• getNode

  public CGNode getNode​(IMethod method,
                        Context C)

  Description copied from interface: CallGraph
  If you want to get all the nodes corresponding to a particular method, regardless of context, then use getNodes

  Specified by:

  getNode in interface CallGraph

  Returns:

  NodeImpl, or null if none found

• getNodes

  public Set<CGNode> getNodes​(MethodReference m)

  Specified by:

  getNodes in interface CallGraph

  Parameters:

  m - a method reference

  Returns:

  the set of all nodes in the call graph that represent this method.

• getInterpreter

  protected T getInterpreter​(CGNode node)

  Parameters:

  node - a call graph node we want information about

  Returns:

  an object that knows how to interpret information about the node

• getNumberOfNodes

  public int getNumberOfNodes()

  We override this since this class supports remove() on nodes, but the superclass doesn't.

  Specified by:

  getNumberOfNodes in interface NodeManager<T>

  Overrides:

  getNumberOfNodes in class AbstractGraph<CGNode>

  Returns:

  the number of nodes in this graph

  See Also:

  NodeManager.getNumberOfNodes()

• iterator

  public Iterator<CGNode> iterator()

  We override this since this class supports remove() on nodes, but the superclass doesn't.

  Specified by:

  iterator in interface Iterable<T>

  Specified by:

  iterator in interface NodeManager<T>

  Overrides:

  iterator in class AbstractGraph<CGNode>

  Returns:

  an Iterator of the nodes in this graph

  See Also:

  NodeManager.iterator()

• containsNode

  public boolean containsNode​(CGNode N)

  This implementation is necessary because the underlying SparseNumberedGraph may not support node membership tests.

  Specified by:

  containsNode in interface NodeManager<T>

  Overrides:

  containsNode in class AbstractGraph<CGNode>

  Returns:

  true iff the graph contains the specified node

  Throws:

  IllegalArgumentException - if N is null

• setInterpreter

  public void setInterpreter​(T interpreter)

• getNodeManager

  protected NumberedNodeManager<CGNode> getNodeManager()

  Specified by:

  getNodeManager in class AbstractNumberedGraph<CGNode>

  Returns:

  the object which manages nodes in the graph

• summarizeByPackage

  public void summarizeByPackage()