Package cha
Package cha computes the call graph of a Go program using the Class
Hierarchy Analysis (CHA) algorithm.
CHA was first described in "Optimization of Object-Oriented Programs
Using Static Class Hierarchy Analysis", Jeffrey Dean, David Grove,
and Craig Chambers, ECOOP'95.
CHA is related to RTA (see go/callgraph/rta); the difference is that
CHA conservatively computes the entire "implements" relation between
interfaces and concrete types ahead of time, whereas RTA uses dynamic
programming to construct it on the fly as it encounters new functions
reachable from main. CHA may thus include spurious call edges for
types that haven't been instantiated yet, or types that are never
instantiated.
Since CHA conservatively assumes that all functions are address-taken
and all concrete types are put into interfaces, it is sound to run on
partial programs, such as libraries without a main or test function.
In the call graph viewer below, each node
is a function belonging to this package
and its children are the functions it
calls—perhaps dynamically.
The root nodes are the entry points of the
package: functions that may be called from
outside the package.
There may be non-exported or anonymous
functions among them if they are called
dynamically from another package.
Click a node to visit that function's source code.
From there you can visit its callers by
clicking its declaring func
token.
Functions may be omitted if they were
determined to be unreachable in the
particular programs or tests that were
analyzed.
func CallGraph(prog *ssa.Program) *callgraph.Graph
CallGraph computes the call graph of the specified program using the
Class Hierarchy Analysis algorithm.
ActiveGo 1.8