Package sootup.callgraph
package sootup.callgraph
-
ClassDescriptionThe AbstractCallGraphAlgorithm class is the super class of all call graph algorithm.The interface of all implemented call graph data structuresThe interface of a implemented call graph algorithmsA configuration object that already carries everything needed to build a
CallGraph- the view, entry points, algorithm choice, and algorithm-specific options - so that constructing a call graph with any algorithm (CHA, RTA, Spark, a Qilin context-sensitivity variant) follows one consistent shape:Comparator for orderingCallGraph.Callobjects by their source location.This class implements the Class Hierarchy Analysis call graph algorithm.This class implements a mutable call graph as a graph.A call graph whose calls (edges) can carry labels of typeL.This class implements a mutable call graph as a graph whose calls can carry labels of typeL.JVM method lookup shared by all call graph / points-to algorithms: from a start class (declared owner for resolution, receiver type for dispatch) find the method a sub-signature binds to.This interface defines a mutable call graph. this means a call graph that can be modified after the creation.A mutable call graph whose calls (edges) can carry labels of typeL.This class implements the Rapid Type Analysis call graph algorithm.Resolution of signature-polymorphic methods (JVMS 2.9.3, 5.4.3.3), e.g.