package vta

import "golang.org/x/tools/go/callgraph/vta"

Index ¶

• func CallGraph(funcs map[*ssa.Function]bool, initial *callgraph.Graph) *callgraph.Graph

Functions ¶

func CallGraph ¶

func CallGraph(funcs map[*ssa.Function]bool, initial *callgraph.Graph) *callgraph.Graph

CallGraph uses the VTA algorithm to compute call graph for all functions f such that f:true is in `funcs`. VTA refines the results of 'initial' callgraph and uses it to establish interprocedural data flow. VTA is sound if 'initial` is sound modulo reflection and unsage. The resulting callgraph does not have a root node.

Source Files ¶

graph.go propagation.go utils.go vta.go