Returns the invoke instructions (by means of (Method
,PC
) pairs) that
call the given method.
Returns the invoke instructions (by means of (Method
,PC
) pairs) that
call the given method. If this method is not called by any other method an
empty map is returned.
Number of methods that are called by at least one other method.
Statistics about the number of methods that potentially call a specific method.
Statistics about the number of methods that potentially call a specific method. (TSV format (tab-separated file) - can easily be read by most spreadsheet applications).
Returns the methods that are called by the invoke instructions of the given method.
Returns the methods that are called by the invoke instructions of the given method.
If this method does not call any methods an empty map is returned.
Returns the methods that are potentially invoked by the invoke instruction
identified by the (method
,pc
) pair.
Returns the methods that are potentially invoked by the invoke instruction
identified by the (method
,pc
) pair.
If the project is incomplete the iterable may be empty!
Number of methods that call at least one other method.
Statistics about the number of potential targets per call site.
Statistics about the number of potential targets per call site. (TSV format (tab-separated file) - can easily be read by most spreadsheet applications).
Calls the function f
for each method that is called by some other method.
Calls the function f
for each method that calls some other method.
Basic representation of a (calculated) call graph.
Terminology
A method that calls another method is referred to as the
caller
. The method that is called is called thecallee
. Hence, a caller calls a callee.Thread Safety
The call graph is effectively immutable and can be accessed by multiple threads concurrently. Calls will never block.
Call Graph Construction
The call graph is constructed by the CallGraphFactory.