Source code for angr.analyses.forward_analysis.visitors.call_graph
from angr.utils.graph import GraphUtils
from .graph import GraphVisitor
[docs]class CallGraphVisitor(GraphVisitor):
"""
:param networkx.DiGraph callgraph:
"""
[docs] def __init__(self, callgraph):
super().__init__()
self.callgraph = callgraph
self.reset()
[docs] def successors(self, node):
return list(self.callgraph.successors(node))
[docs] def predecessors(self, node):
return list(self.callgraph.predecessors(node))
[docs] def sort_nodes(self, nodes=None):
sorted_nodes = GraphUtils.quasi_topological_sort_nodes(self.callgraph)
if nodes is not None:
sorted_nodes = [n for n in sorted_nodes if n in set(nodes)]
return sorted_nodes