1 // Package static computes the call graph of a Go program containing
2 // only static call edges.
3 package static // import "honnef.co/go/tools/callgraph/static"
6 "honnef.co/go/tools/callgraph"
7 "honnef.co/go/tools/ir"
8 "honnef.co/go/tools/ir/irutil"
11 // CallGraph computes the call graph of the specified program
12 // considering only static calls.
14 func CallGraph(prog *ir.Program) *callgraph.Graph {
15 cg := callgraph.New(nil) // TODO(adonovan) eliminate concept of rooted callgraph
17 // TODO(adonovan): opt: use only a single pass over the ir.Program.
18 // TODO(adonovan): opt: this is slower than RTA (perhaps because
19 // the lower precision means so many edges are allocated)!
20 for f := range irutil.AllFunctions(prog) {
21 fnode := cg.CreateNode(f)
22 for _, b := range f.Blocks {
23 for _, instr := range b.Instrs {
24 if site, ok := instr.(ir.CallInstruction); ok {
25 if g := site.Common().StaticCallee(); g != nil {
26 gnode := cg.CreateNode(g)
27 callgraph.AddEdge(fnode, site, gnode)