Uses of Package
sootup.callgraph

Packages that use sootup.callgraph
  • Class
    Description
    The interface of all implemented call graph data structures
    A 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:
  • Classes in sootup.callgraph used by qilin.core
    Class
    Description
    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.
  • Class
    Description
    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.
  • Class
    Description
    The interface of all implemented call graph data structures
     
     
    This interface defines a mutable call graph. this means a call graph that can be modified after the creation.
  • Class
    Description
    The interface of all implemented call graph data structures
  • Class
    Description
    The AbstractCallGraphAlgorithm class is the super class of all call graph algorithm.
    The interface of all implemented call graph data structures
     
    The interface of a implemented call graph algorithms
     
    This class implements a mutable call graph as a graph.
    A call graph whose calls (edges) can carry labels of type L.
    This class implements a mutable call graph as a graph whose calls can carry labels of type L.
    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 type L.
  • Class
    Description
    The interface of all implemented call graph data structures
    A 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:
  • Classes in sootup.callgraph used by sootup.spark
    Class
    Description
    The interface of all implemented call graph data structures
    A 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: