Call Graph Construction
A call graph shows the method calling relationship of a program. It is a directed graph, whose nodes represent different methods, and edges represent caller -> callee relationship.
SootUp contains several call graph construction algorithms. Below, we show how you can use each of these.
Creating the Type Hierarchy
All the call graph construction algorithms require the view to access the type hierarchy for resolving method calls based of sub typing relationship. Below, we show how to create a type hierarchy:
1 2 3 4 5 6 | |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | |
Defining an Entry Method
All call graph construction algorithms require an entry method to start with. In java application, you usually define the main method. However, it is possible to define arbitrary entry methods depending on your needs. Below, we show how to define such an entry method:
1 2 3 4 5 6 7 8 9 10 | |
1 2 3 | |
1 2 | |
Scoping the Call Graph
By default, every call graph algorithm stops exploring at library classes
(classes whose SourceType is Library, e.g. the JDK classes pulled in via DefaultRuntimeAnalysisInputLocation):
a call into a library method is still recorded as an edge, but the library method's own body is never analyzed, so it never gets outgoing edges of its own.
This behavior is controlled by a CallGraphScope. CallGraphScope.filter(SootClass, MethodSignature) is asked once per method before its calls are resolved;
returning true excludes the method from expansion. The method still shows up as a node in the resulting call graph:
it simply has no outgoing edges, since its body is never analyzed.
The default scope (DefaultCallGraphScope) is exactly the "skip library classes" behavior described above.
You can pass a custom CallGraphScope to ClassHierarchyAnalysisAlgorithm/RapidTypeAnalysisAlgorithm to change what gets explored, e.g. to also cut off a specific package:
1 2 3 4 5 | |
If you need to know what got excluded, e.g. to diagnose why an expected method is missing from the call graph, use ExcludedCallsCollectingCallGraphScope, which applies the default library-class filtering while recording every excluded method signature:
1 2 3 4 5 | |
Scope prunes expansion, not existing edges
A CallGraphScope only decides whether a method's own calls get resolved. It does not remove edges that other, non-excluded methods already call into it -- those calls are still part of the call graph.
Class Hierarchy Analysis
Class Hierarchy Analysis (CHA) algorithm is the most sound call graph construction algorithm available in SootUp. It soundly includes all implementers of an interface, when resolving a method call on an interface. You can construct a call graph with CHA as follows:
1 2 3 4 5 6 | |
1 2 3 4 5 6 7 8 | |
Rapid Type Analysis
Rapid Type Analysis (RTA) algorithm constructs a rather precise version of the call graph that the CHA constructs. It refines CHA by considering only the instantiated implementers of an interface, when resolving a method call on an interface. You can construct a call graph with RTA as follows:
1 2 3 4 5 6 | |
1 2 3 4 5 6 7 8 9 10 11 12 13 | |
Exporting the call graph in a Dot format
This guide describes how to export a call graph created by one of the call graph algorithms to a .dot format for visualization with tools like Graphviz.
The nodes represent method signatures, and the edges contain labels showing the line numbers of the invoking statements.
In this example, the call graph was created using CHA.
The exported call graph can be sorted by providing a Comparator for Calls.
1 2 | |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | |